%%% -*-BibTeX-*- %%% ==================================================================== %%% BibTeX-file{ %%% author = "Nelson H. F. Beebe", %%% version = "2.15", %%% date = "14 October 2017", %%% time = "08:49:19 MDT", %%% filename = "infoproc1980.bib", %%% address = "University of Utah %%% Department of Mathematics, 110 LCB %%% 155 S 1400 E RM 233 %%% Salt Lake City, UT 84112-0090 %%% USA", %%% telephone = "+1 801 581 5254", %%% FAX = "+1 801 581 4148", %%% URL = "https://www.math.utah.edu/~beebe", %%% checksum = "13561 51028 220515 2258616", %%% email = "beebe at math.utah.edu, beebe at acm.org, %%% beebe at computer.org (Internet)", %%% codetable = "ISO/ASCII", %%% keywords = "bibliography, BibTeX, Information Processing %%% Letters", %%% license = "public domain", %%% supported = "yes", %%% docstring = "This is a bibliography of the journal %%% Information Processing Letters (CODEN IFPLAT, %%% ISSN 0020-0190), published by %%% Elsevier/North-Holland, covering %%% (incompletely) the decade 1980--1989. %%% %%% At version 1.26, the original infoproc.bib %%% file was approaching 4000 entries, so it was %%% split into decade-specific files, to avoid %%% hitting internal limits of BibTeX and TeX. %%% %%% Entries with addenda, comments, corrigenda, %%% errata, letters to the editor, and remarks on %%% earlier articles contain cross references to %%% entries for those articles, which are %%% included here for completeness, even if they %%% are duplicated in another of the %%% decade-specific bibliographies for this %%% journal. %%% %%% This journal now has World-Wide Web sites at %%% %%% http://www.sciencedirect.com/science/journal/00200190 %%% http://www.elsevier.com/wps/find/journaldescription.cws_home/505612/ %%% http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/ %%% %%% with tables of contents for all volumes. %%% %%% Abstracts and full text of articles are %%% available electronically to qualified %%% subscribers, which includes members of %%% organizations with institutional %%% subscriptions; most large universities should %%% fall in this group. For details, visit %%% %%% http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/?menu=cont&label=table %%% %%% At version 2.15, the year coverage looked %%% like this: %%% %%% 1972 ( 1) 1980 ( 118) 1988 ( 188) %%% 1973 ( 0) 1981 ( 115) 1989 ( 207) %%% 1974 ( 0) 1982 ( 108) 1990 ( 2) %%% 1975 ( 0) 1983 ( 113) 1991 ( 3) %%% 1976 ( 0) 1984 ( 105) 1992 ( 1) %%% 1977 ( 1) 1985 ( 102) 1993 ( 1) %%% 1978 ( 1) 1986 ( 123) %%% 1979 ( 7) 1987 ( 184) %%% %%% Article: 1380 %%% %%% Total entries: 1380 %%% %%% The initial draft was extracted from the ACM %%% Computing Archive CD ROM for the 1980s, with %%% manual corrections and additions. %%% %%% At version 1.09, this bibliography was %%% extended with 854 new entries derived from %%% the OCLC Contents1st database, after %%% conversion to BibTeX format, and extensive %%% editing and correction. Regrettably, that %%% database does not record final page numbers %%% of journal articles, so were are many page %%% ranges of the form 123--?? in this %%% bibliography, until they were corrected %%% with data from other databases, and from %%% manual checking of articles in the original %%% journal issues. At version 1.17, another %%% 1044 entries were added from a search in %%% the Compendex databases (1970--1996), and %%% about 1000 others were updated with %%% additional information. %%% %%% An additional 470 new entries were added at %%% version 1.22 from the MathSciNet database, %%% and most of the missing final page numbers in %%% the other entries were supplied from %%% MathSciNet data. %%% %%% At version 1.25, another 134 new entries were %%% added from a combination of data from the %%% journal Web site, and from other databases. %%% %%% Numerous errors in the sources noted above %%% have been corrected. Spelling has been %%% verified with the UNIX spell and GNU ispell %%% programs using the exception dictionary %%% stored in the companion file with extension %%% .sok. %%% %%% BibTeX citation tags are uniformly chosen %%% as name:year:abbrev, where name is the %%% family name of the first author or editor, %%% year is a 4-digit number, and abbrev is a %%% 3-letter condensation of important title %%% words. Citation tags were automatically %%% generated by software developed for the %%% BibNet Project. %%% %%% In this bibliography, entries are sorted in %%% publication order, using bibsort -byvolume. %%% %%% The checksum field above contains a CRC-16 %%% checksum as the first value, followed by the %%% equivalent of the standard UNIX wc (word %%% count) utility output of lines, words, and %%% characters. This is produced by Robert %%% Solovay's checksum utility.", %%% } %%% ==================================================================== @Preamble{ "\ifx \cedla \undefined \let \cedla = \c \fi" # "\ifx \cftil \undefined \def \cftil#1{\~#1} \fi" # "\ifx \cprime \undefined \def \cprime {$\mathsurround=0pt '$}\fi" # "\ifx \Dbar \undefined \def \Dbar {\leavevmode\raise0.2ex\hbox{--}\kern-0.5emD} \fi" # "\ifx \k \undefined \let \k = \c \fi" # "\ifx \lfhook \undefined \let \lfhook = \relax \fi" # "\ifx \mathbb \undefined \def \mathbb #1{{\bf #1}}\fi" # "\ifx \polhk \undefined \let \polhk = \k \fi" # "\ifx \soft \undefined \def \soft{'} \fi" # "\hyphenation{ Ishi-zu-ka Kath-ryn Ker-n-i-ghan Krom-mes Lar-ra-bee Man-o-har Mehl-horn Mee-nak-shi Ne-va-lai-nen Pat-rick Port-able Post-Script Pren-tice Rich-ard Richt-er Ro-bert Schra-der Schwartz-bach Sha-mos Sit-ha-ra-ma Spring-er Ta-ka-na-mi The-o-dore Uz-ga-lis Vong-sat-horn } " } %%% ==================================================================== %%% Acknowledgement abbreviations: @String{ack-nhfb = "Nelson H. F. Beebe, University of Utah, Department of Mathematics, 110 LCB, 155 S 1400 E RM 233, Salt Lake City, UT 84112-0090, USA, Tel: +1 801 581 5254, FAX: +1 801 581 4148, e-mail: \path|beebe@math.utah.edu|, \path|beebe@acm.org|, \path|beebe@computer.org| (Internet), URL: \path|https://www.math.utah.edu/~beebe/|"} %%====================================================================== %% Journal abbreviations: @String{j-INFO-PROC-LETT = "Information Processing Letters"} %%% ==================================================================== %%% Bibliography entries: %%% The University of Utah Marriott Library has volumes 8..60 %%% (1979--1996), so I have been unable to check questions about entries %%% for volumes 1..7. @Article{Graham:1972:EAD, author = "R. L. Graham", title = "An efficient algorithm for determining the convex hull of a finite planar set", journal = j-INFO-PROC-LETT, volume = "1", number = "4", pages = "132--133", day = "??", month = jun, year = "1972", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See note \cite{Gries:1987:NGC}.", acknowledgement = ack-nhfb, classification = "C4190 (Other numerical methods)", corpsource = "Bell Telephone Labs. Inc., Murray Hill, NJ, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "convex hull; efficient algorithm; extreme points; finite planar set; numerical methods; set theory", treatment = "T Theoretical or Mathematical", } @Article{Bui:1977:SMS, author = "T. D. Bui", title = "On an {$L$}-stable method for stiff differential equations", journal = j-INFO-PROC-LETT, volume = "6", number = "5", pages = "158--161", day = "??", month = oct, year = "1977", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See erratum \cite{Bui:1979:ESM} and comments \cite{Day:1980:CSM}.", acknowledgement = ack-nhfb, classification = "C4170 (Differential equations)", corpsource = "Dept. of Computer Sci., Concordia Univ., Montreal, Que., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "differential equations; L-stable method; stiff differential equations", treatment = "T Theoretical or Mathematical", } @Article{Bykat:1978:CHF, author = "A. Bykat", title = "Convex hull of a finite set of points in two dimensions", journal = j-INFO-PROC-LETT, volume = "7", number = "6", pages = "296--298", day = "??", month = oct, year = "1978", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C05 (52-04)", MRnumber = "80b:68041", MRreviewer = "D. T. Lee", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See also comments \cite{Devai:1979:CCH,Fournier:1979:CCH,Overmars:1980:FCB}.", acknowledgement = ack-nhfb, classification = "B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics)", corpsource = "Dept. of Math., Polytech. of North London, London, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "algorithm; convex hull; finite set of points; topology; two dimensions", treatment = "T Theoretical or Mathematical", } @Article{Morris:1979:SSM, author = "J. M. Morris", title = "A starvation-free solution to the mutual exclusion problem", journal = j-INFO-PROC-LETT, volume = "8", number = "2", pages = "76--80", day = "15", month = feb, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See comments \cite{Annot:1986:CMS}.", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6150J (Operating systems)", corpsource = "Dept. of Computer Sci., Trinity Coll., Dublin, Ireland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "algorithm; binary semaphores; multi-access systems; mutual exclusion; programming theory; starvation", treatment = "T Theoretical or Mathematical", } @Article{Aspvall:1979:LTA, author = "Bengt Aspvall and Michael F. Plass and Robert Endre Tarjan", title = "A linear-time algorithm for testing the truth of certain quantified {Boolean} formulas", journal = j-INFO-PROC-LETT, volume = "8", number = "3", pages = "121--123", day = "15", month = mar, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25", MRnumber = "80b:68050", MRreviewer = "Henry S. Warren, Jr.", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See also erratum \cite{Aspvall:1982:ELT}.", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Computer Sci. Dept., Stanford Univ., Stanford, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "2 CNF; 2 satisfiability; Boolean formulas; Boolean functions; linear time algorithm; strongly connected components; truth", treatment = "T Theoretical or Mathematical", } @Article{Fournier:1979:CCH, author = "Alain Fournier", title = "Comments on convex hull of a finite set of points in two dimensions {[Inform. Process. Lett. {\bf 7} (1978), no. 6, 296--298; MR 80b:68041]}", journal = j-INFO-PROC-LETT, volume = "8", number = "4", pages = "173--173", day = "30", month = apr, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25 (52-04)", MRnumber = "81a:68047", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See \cite{Bykat:1978:CHF,Devai:1979:CCH,Overmars:1980:FCB}.", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics)", corpsource = "Programs in Math. Sci., Univ of Texas, Dallas, TX, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "convex hull; finite set of points in two dimensions; set theory", treatment = "T Theoretical or Mathematical", } @Article{Bui:1979:ESM, author = "T. D. Bui", title = "Erratum: {``On an {$L$}-stable method for stiff differential equations''}", journal = j-INFO-PROC-LETT, volume = "8", number = "4", pages = "218--218", day = "30", month = apr, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See \cite{Bui:1977:SMS,Day:1980:CSM}.", acknowledgement = ack-nhfb, fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", } @Article{Colbourn:1979:CSM, author = "Charles J. Colbourn", title = "The complexity of symmetrizing matrices", journal = j-INFO-PROC-LETT, volume = "9", number = "3", pages = "108--109", day = "5", month = oct, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25 (05B99)", MRnumber = "81a:68045", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See also correction \cite{Colbourn:1980:CCP}.", acknowledgement = ack-nhfb, classification = "C1110 (Algebra); C1160 (Combinatorial mathematics)", corpsource = "Dept. of Computer Sci., Univ. of Toronto, Toronto, Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "complexity; graph isomorphism; graph theory; matrix algebra; polynomial time equivalent; symmetrizing matrices", treatment = "T Theoretical or Mathematical", } @Article{Devai:1979:CCH, author = "F. D{\'e}vai and T. Szendr{\'e}nyi", title = "Comments on convex hull of a finite set of points in two dimensions", journal = j-INFO-PROC-LETT, volume = "9", number = "3", pages = "141--142", day = "5", month = oct, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See \cite{Bykat:1978:CHF,Fournier:1979:CCH,Overmars:1980:FCB}.", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics)", corpsource = "Computer and Automation Inst., Acad. of Sci., Budapest, Hungary", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "clustering algorithm; computer graphics; convex hull; finite set; topology; two dimensions", treatment = "T Theoretical or Mathematical", } @Article{Andrew:1979:AEA, author = "A. M. Andrew", title = "Another efficient algorithm for convex hulls in two dimensions", journal = j-INFO-PROC-LETT, volume = "9", number = "5", pages = "216--219", day = "16", month = dec, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See corrigendum \cite{Andrew:1980:CAE}.", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Dept. of Cybernetics, Univ. of Reading, Reading, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "convex hulls; efficient algorithm; ordering algorithm; programming theory", treatment = "T Theoretical or Mathematical", } @Article{Gordon:1980:DSS, author = "Michael J. C. Gordon", title = "The denotational semantics of sequential machines", journal = j-INFO-PROC-LETT, volume = "10", number = "1", pages = "1--3", day = "12", month = feb, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68D15", MRnumber = "81a:68061", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4230D (Sequential switching theory)", corpsource = "Dept. of Computer Sci., Univ. of Edinburgh, Edinburgh, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "denotational semantics; function space; sequential machines", treatment = "T Theoretical or Mathematical", } @Article{Olivie:1980:RBS, author = "H. Olivi{\'e}", title = "On the relationship between son-trees and symmetric binary {$B$}-trees", journal = j-INFO-PROC-LETT, volume = "10", number = "1", pages = "4--8", day = "12", month = feb, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E10", MRnumber = "81a:68070", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C4210 (Formal logic); C6120 (File organisation)", corpsource = "Interstedelijke Industriele Hogeschool Antwerpen-Mechelen, Antwerpen, Belgium", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "balanced binary search trees; data processing; data structures; dictionary; symmetric binary B trees; trees (mathematics)", treatment = "P Practical", } @Article{Rayward-Smith:1980:FLC, author = "V. J. Rayward-Smith and R. N. Rolph", title = "Finding Linear and Circular Sequences of Minimal and Maximal Total Adjacency", journal = j-INFO-PROC-LETT, volume = "10", number = "1", pages = "9--13", day = "12", month = feb, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68B15 (68C25)", MRnumber = "80j:68015", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; 921; C6130B (Graphics techniques)", corpsource = "School of Computing Studies and Accountancy, Univ. of East Anglia, Norwich, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "circular sequences; computer aided design; computer aided geometric design; computer graphics; data base design; mathematical techniques --- Combinational Mathematics; maximal total adjacency; spatial modelling", treatment = "P Practical", } @Article{Honeyman:1980:TUI, author = "Peter Honeyman and Richard E. Ladner and Mihalis Yannakakis", title = "Testing the universal instance assumption", journal = j-INFO-PROC-LETT, volume = "10", number = "1", pages = "14--19", day = "12", month = feb, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68B15 (68C25)", MRnumber = "81a:68024", bibdate = "Tue Nov 17 17:58:41 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C6160D (Relational databases)", corpsource = "Dept. of Electrical Engng. and Computer Sci., Princeton Univ., Princeton, NJ, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "database management systems; DBMS; multivalued dependencies; relational database management system; universal instance assumption", treatment = "P Practical", } @Article{Deb:1980:CFA, author = "Ashoke Deb", title = "Conflict-free access of arrays --- a counter example", journal = j-INFO-PROC-LETT, volume = "10", number = "1", pages = "20--20", day = "12", month = feb, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation)", corpsource = "Dept. of Computer Sci., Memorial Univ. of Newfoundland, St. Johns, Nfld., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "columns; conflict free access of arrays; file organisation; memory modules; rows", treatment = "P Practical", } @Article{Truszczynski:1980:OMS, author = "Miros{\l}aw Truszczy{\'n}ski", title = "Once more on storage for consecutive retrieval", journal = j-INFO-PROC-LETT, volume = "10", number = "1", pages = "21--24", day = "12", month = feb, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68H05", MRnumber = "81a:68110", bibdate = "Tue Nov 17 17:58:46 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation)", corpsource = "Inst. of Math., Tech. Univ. of Warsaw, Warsaw, Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "consecutive retrieval; file organisation; file organization; shortest linear organization; storage", treatment = "P Practical", } @Article{Goldschlager:1980:SEA, author = "Leslie M. Goldschlager", title = "A space efficient algorithm for the monotone planar circuit value problem", journal = j-INFO-PROC-LETT, volume = "10", number = "1", pages = "25--27", day = "12", month = feb, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25", MRnumber = "81b:68044", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "721; 723; C4240 (Programming and algorithm theory)", corpsource = "Dept. of Computer Sci., Univ. of Queensland, St. Lucia, Qld., Australia", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Boolean values; computational complexity; computer programming --- Subroutines; feedback loops; logic circuits, combinatorial; monotone planar circuit value problem; parallel processing; space efficient algorithm", treatment = "T Theoretical or Mathematical", } @Article{Lloyd:1980:LSB, author = "Errol L. Lloyd", title = "List Scheduling Bounds for {UET} Systems with Resources", journal = j-INFO-PROC-LETT, volume = "10", number = "1", pages = "28--31", day = "12", month = feb, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C15", MRnumber = "81a:68042", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See also errata \cite{Lloyd:1980:ELS,vanLeeuwen:1980:ELS}.", acknowledgement = ack-nhfb, classification = "912; C6130 (Data handling techniques)", corpsource = "Lab. for Computer Sci., MIT, Cambridge, MA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "arbitrary list schedule; list processing; operations research; optimal schedule; resources; task systems; UET systems", treatment = "P Practical", } @Article{Zaniolo:1980:MTF, author = "Carlo Zaniolo", title = "Mixed transitivity for functional and multivalued dependencies in database relations", journal = j-INFO-PROC-LETT, volume = "10", number = "1", pages = "32--34", day = "12", month = feb, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Tue Nov 17 17:58:57 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C6160D (Relational databases)", corpsource = "Sperry Res. Center, Sudbury, MA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "combined functional; complete axiomatization; database management systems; database relations; DBMS; mixed transitivity; multivalued dependencies", treatment = "P Practical", } @Article{Bui:1980:NIB, author = "T. D. Bui", title = "A note on an improved bisection algorithm", journal = j-INFO-PROC-LETT, volume = "10", number = "1", pages = "35--36", day = "12", month = feb, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", } @Article{Sleator:1980:TOA, author = "Daniel D. K. D. B. Sleator", title = "A $2.5$ times optimal algorithm for packing in two dimensions", journal = j-INFO-PROC-LETT, volume = "10", number = "1", pages = "37--40", day = "12", month = feb, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25 (52A45)", MRnumber = "81a:68052", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer programming", } @Article{Sarwate:1980:NUC, author = "Dilip V. Sarwate", title = "A note on: {``Universal classes of hash functions'' [J. Comput. System Sci. {\bf 18} (1979), no. 2, 143--154; MR 80f:68110a] by J. L. Carter and M. N. Wegman}", journal = j-INFO-PROC-LETT, volume = "10", number = "1", pages = "41--45", day = "12", month = feb, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68H05", MRnumber = "80f:68110b", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", } @Article{Anderson:1980:EPI, author = "Bruce Anderson", title = "Encoded Pointers --- an Interesting Data-Structure for Modern {SIL}'s", journal = j-INFO-PROC-LETT, volume = "10", number = "2", pages = "47--50", day = "18", month = mar, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C6120 (File organisation)", corpsource = "Dept. of Electrical Engng. Sci., Univ. of Essex, Colchester, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer programming languages; data processing; data structures; encoded pointers; sils; systems programming languages", treatment = "P Practical", } @Article{vanLeeuwen:1980:DDS, author = "Jan {van Leeuwen} and Derick Wood", title = "Dynamization of decomposable searching problems", journal = j-INFO-PROC-LETT, volume = "10", number = "2", pages = "51--56", day = "18", month = mar, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E05", MRnumber = "81i:68091a", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation)", corpsource = "Dept. of Computer Sci., Univ. of Utrecht, Utrecht, Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "decomposable searching problems; degrees of freedom; dynamic storage allocation facility; full dynamization; information retrieval; optimized response times; programming environment", treatment = "P Practical", } @Article{Sabelfeld:1980:LTE, author = "V. K. Sabel{\cprime}fel{\cprime}d", title = "The logic-termal equivalence is polynomial-time decidable", journal = j-INFO-PROC-LETT, volume = "10", number = "2", pages = "57--62", day = "18", month = mar, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C05 (68C25)", MRnumber = "81a:68039", bibdate = "Tue Nov 17 17:59:08 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Computing Center, Acad. of Sci., Novosibirsk, USSR", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "graph node; information flow; logic term equivalence; lt equivalence; polynomial time decidability; predicate checks; programming theory; time upper bound", treatment = "T Theoretical or Mathematical", } @Article{Passy:1980:SPT, author = "Solomon Passy", title = "Structured programs for {Turing} machines", journal = j-INFO-PROC-LETT, volume = "10", number = "2", pages = "63--67", day = "18", month = mar, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68F10 (03D10)", MRnumber = "81h:68080", bibdate = "Tue Nov 17 17:59:18 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4220 (Automata theory)", corpsource = "Inst. of Math., Acad. of Sci., Sofia, Bulgaria", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "context free languages; context-free languages; structured language; structured programming; Turing machines", treatment = "P Practical", } @Article{Wilson:1980:ACG, author = "Thomas C. Wilson and Joseph Shortt", title = "An {$O(\log n)$} algorithm for computing general order-$k$ {Fibonacci} numbers", journal = j-INFO-PROC-LETT, volume = "10", number = "2", pages = "68--75", day = "18", month = mar, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25 (10A35)", MRnumber = "81a:68053", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C7310 (Mathematics computing)", corpsource = "Univ. of Guelph, Guelph, Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "complete algorithm; Fibonacci numbers; intermediate storage locations; iterative algorithm; iterative methods; mathematics", treatment = "T Theoretical or Mathematical", } @Article{Liang:1980:LBL, author = "Frank M. Liang", title = "A lower bound for on-line bin packing", journal = j-INFO-PROC-LETT, volume = "10", number = "2", pages = "76--79", day = "18", month = mar, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25 (90B05)", MRnumber = "81e:68048", MRreviewer = "Andrew Yao", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation)", corpsource = "Computer Sci. Dept., Stanford Univ., Stanford, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "heuristic algorithms; list of objects; list processing; lower bound; NP completeness; online bin packing; performance ratio; unit capacity bins", treatment = "T Theoretical or Mathematical", } @Article{Blum:1980:EFB, author = "Manuel Blum and Ashok K. Chandra and Mark N. Wegman", title = "Equivalence of free {Boolean} graphs can be decided probabilistically in polynomial time", journal = j-INFO-PROC-LETT, volume = "10", number = "2", pages = "80--82", day = "18", month = mar, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C05 (68C25)", MRnumber = "82d:68022", MRreviewer = "Kabekode V. S. Bhat", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Computer Sci. Dept., IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "Boolean algebra; equivalence; free Boolean graphs; graph theory; polynomial time; probability of error", treatment = "T Theoretical or Mathematical", } @Article{Vitanyi:1980:AHS, author = "Paul M. B. Vit{\'a}nyi", title = "Achievable high scores of $\varepsilon$-moves and running times in {DPDA} computations", journal = j-INFO-PROC-LETT, volume = "10", number = "2", pages = "83--86", day = "18", month = mar, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68D35 (68C25 68F25)", MRnumber = "81d:68071", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory)", corpsource = "Math. Centrum, Amsterdam, Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "automata theory; deterministic pushdown automata; DPDA computations; high scores; loop; popping; running times; stack", treatment = "T Theoretical or Mathematical", } @Article{Santoro:1980:EFR, author = "Nicola Santoro", title = "Extending the Four {Russians}' Bound to General Matrix Multiplication", journal = j-INFO-PROC-LETT, volume = "10", number = "2", pages = "87--88", day = "18", month = mar, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25", MRnumber = "81a:68051", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "B0290H (Linear algebra); C4140 (Linear algebra)", corpsource = "Dept. of Computer Sci., Univ. of Waterloo, Waterloo, Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "algorithms; Boolean matrix; bounded matrix size; Four Russians' bound; general matrix multiplication; matrix algebra", treatment = "T Theoretical or Mathematical", } @Article{Samet:1980:PED, author = "Hanan Samet and Leo Marcus", title = "Purging in an Equality Data Base", journal = j-INFO-PROC-LETT, volume = "10", number = "2", pages = "89--95", day = "18", month = mar, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68B15", MRnumber = "81a:68026", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C6160 (Database management systems (DBMS))", corpsource = "Dept. of Computer Sci., Univ. of Maryland, College Park, MD, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "code optimizers; data base systems; database management systems; DBMS; equality data base; program verifiers; proofs of equality; purging; register value; removing information; symbolic execution systems; symbolic machine execution; theorem provers", treatment = "P Practical", } @Article{Ben-Ari:1980:SPR, author = "Mordechai Ben-Ari", title = "A simplified proof that regular resolution is exponential", journal = j-INFO-PROC-LETT, volume = "10", number = "2", pages = "96--98", day = "18", month = mar, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25", MRnumber = "81g:68062", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics)", corpsource = "Div. of Computer Sci., Tel Aviv Univ., Ramat Aviv, Israel", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "graph theory; regular resolution", treatment = "T Theoretical or Mathematical", } @Article{Brandwajn:1980:SFT, author = "Alexandre Brandwajn and Rene Joly", title = "A scheme for a fault-tolerant virtual memory", journal = j-INFO-PROC-LETT, volume = "10", number = "2", pages = "99--103", day = "18", month = mar, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "722; 723; C6120 (File organisation)", corpsource = "Amdahl Corp., Sunnyvale, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer systems, digital; fault tolerant computing; fault tolerant virtual memory; I/O components; main memory; virtual storage", treatment = "P Practical", } @Article{Pagan:1980:GCL, author = "Frank G. Pagan", title = "On the generation of compilers from language definitions", journal = j-INFO-PROC-LETT, volume = "10", number = "2", pages = "104--107", day = "18", month = mar, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Tue Nov 17 17:59:29 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C6150C (Compilers, interpreters and other processors)", corpsource = "Computer Sci. Dept., Southern Illinois Univ., Carbondale, IL, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "automatic programming; compilers; formal languages; formal semantic definitions; language definitions; metalanguage; program compilers; programming language", treatment = "P Practical", } @Article{Jazayeri:1980:IID, author = "M. Jazayeri", title = "An improvement in the iterative data flow analysis algorithm", journal = j-INFO-PROC-LETT, volume = "10", number = "2", pages = "108--110", day = "18", month = mar, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C6110 (Systems analysis and programming)", corpsource = "Dept. of Computer Sci., Univ. of North Carolina, Chapel Hill, NC, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "convergence; iterative data flow analysis algorithm; software engineering; stability", treatment = "P Practical", } @Article{Arora:1980:AMA, author = "R. K. Arora and S. P. Rana", title = "Analysis of the Module Assignment Problem in Distributed Computing Systems with Limited Storage", journal = j-INFO-PROC-LETT, volume = "10", number = "3", pages = "111--115", day = "18", month = apr, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "722; 723; C6150J (Operating systems)", corpsource = "Computer Centre, Indian Inst. of Technol., New Delhi, India", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer systems, digital; distributed computing systems; distributed processing; efficient heuristics; limited storage; module assignment problem; optimal solution techniques; storage allocation", treatment = "P Practical", } @Article{Watanabe:1980:AAR, author = "O. Watanabe", title = "Another application of recursion introduction", journal = j-INFO-PROC-LETT, volume = "10", number = "3", pages = "116--119", day = "18", month = apr, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Information Sci., Tokyo Inst. of Technol., Tokyo, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "algorithm theory; automata theory; deterministic pushdown automata; obvious algorithm; recursion introduction; recursive calls; stack elimination technique; tabulation method", treatment = "P Practical", } @Article{Wallis:1980:EIA, author = "Peter J. L. Wallis and Bernard W. Silverman", title = "Efficient Implementation of the {Ada} Overloading Rules", journal = j-INFO-PROC-LETT, volume = "10", number = "3", pages = "120--123", day = "18", month = apr, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C6140D (High level languages)", corpsource = "School of Math., Univ. of Bath, Bath, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Ada overloading rules; computer programming; parse tree; procedure oriented languages", treatment = "P Practical", } @Article{Hemerik:1980:FDL, author = "C. Hemerik", title = "Formal derivation of a list processing program", journal = j-INFO-PROC-LETT, volume = "10", number = "3", pages = "124--126", day = "18", month = apr, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C6130 (Data handling techniques)", corpsource = "Dept. of Math., Technol. Univ., Eindhoven, Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "formal language; formal languages; LISP; list manipulation problem; list processing; list processing program; systematic program development", treatment = "P Practical", } @Article{Kirkpatrick:1980:NDO, author = "David G. Kirkpatrick", title = "A note on {Delaunay} and optimal triangulations", journal = j-INFO-PROC-LETT, volume = "10", number = "3", pages = "127--128", day = "??", month = apr, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25 (68E99)", MRnumber = "81e:68047", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", } @Article{Wang:1980:SNR, author = "Patrick Shen-Pei Wang", title = "Some new results on isotonic array grammars", journal = j-INFO-PROC-LETT, volume = "10", number = "3", pages = "129--131", day = "18", month = apr, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68F05 (68G10)", MRnumber = "81e:68097", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Computer Sci., Univ. of Oregon, Eugene, OR, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "array languages; data processing; formal languages; grammars; isotonic array grammars; patterns", treatment = "P Practical", } @Article{vanEmdeBoas:1980:LBC, author = "Peter {van Emde Boas}", title = "On the {$\Omega(n\log n)$} lower bound for convex hull and maximal vector determination", journal = j-INFO-PROC-LETT, volume = "10", number = "3", pages = "132--136", day = "18", month = apr, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25 (52-04 52A10 90C25)", MRnumber = "83e:68034a", MRreviewer = "Selim G. Akl", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See also comments \cite{Avis:1980:CLB}.", acknowledgement = ack-nhfb, fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", } @Article{Cellary:1980:SMQ, author = "Wojciech Cellary and Daniel Mayer", title = "A simple model of query scheduling in distributed data base systems", journal = j-INFO-PROC-LETT, volume = "10", number = "3", pages = "137--147", day = "18", month = apr, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C6160B (Distributed databases); C6160D (Relational databases)", corpsource = "Dept. of Appl. Math., Univ. of Nancy I, Nancy, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "access point; data base systems; data interchanges; database management systems; DBMS; decomposition of queries; distributed data base systems; distributed processing; final response; optimization; query scheduling; relational operations; storage point; transportation network", treatment = "P Practical", } @Article{Barnden:1980:CSD, author = "J. A. Barnden", title = "A characterization of systems derived from terminating concurrent histories", journal = j-INFO-PROC-LETT, volume = "10", number = "3", pages = "148--152", day = "18", month = apr, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E10 (68D90)", MRnumber = "81b:68077", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Computer Sci., Univ. of Reading, Reading, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "case graph; concurrency; determinacy; finite labelled partially ordered set; graph theory; programming theory; terminating concurrent histories", treatment = "T Theoretical or Mathematical", } @Article{Czaja:1980:PSS, author = "Ludwik Czaja", title = "Parallel System Schemas and Their Relation to Automata", journal = j-INFO-PROC-LETT, volume = "10", number = "3", pages = "153--158", day = "18", month = apr, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68D05", MRnumber = "84c:68037", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "721; 722; 723; C4220 (Automata theory)", corpsource = "Inst. Informatyki, Univ. Warszawskiego, Warszawa, Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "actions; authorization conditions; automata; automata theory; Boolean functions; computer systems, digital; finite automata; parallel system schemas; processors", treatment = "T Theoretical or Mathematical", } @Article{Kessels:1980:RWP, author = "J. L. W. I. Kessels", title = "The readers and writers problem avoided", journal = j-INFO-PROC-LETT, volume = "10", number = "3", pages = "159--162", day = "18", month = apr, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory); C6150J (Operating systems)", corpsource = "Philips Res. Labs., Eindhoven, Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "common data set; computer operating systems; concurrent transactions; parallel processing; programming theory; readers and writers problem", treatment = "T Theoretical or Mathematical", } @Article{vanderNat:1980:FSA, author = "M. {van der Nat}", title = "A Fast Sorting Algorithm, a Hybrid of Distributive and Merge Sorting", journal = j-INFO-PROC-LETT, volume = "10", number = "3", pages = "163--167", day = "18", month = apr, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Tue Nov 17 17:59:50 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C6130 (Data handling techniques)", corpsource = "Inst. of Appl. Math. and Computer Sci., Univ. of Leiden, Leiden, Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "distributive partitioning approach; distributive sort; fast sorting algorithm; floating point arithmetic; general purpose sorting packages; merge sorting; sorting", treatment = "P Practical", } @Article{Andrew:1980:CAE, author = "A. M. Andrew", title = "Corrigendum: {``Another efficient algorithm for convex hulls in two dimensions'' (Inform. Process. Lett. {\bf 9} (1979), no. 5, 216--219)}", journal = j-INFO-PROC-LETT, volume = "10", number = "3", pages = "168--168", day = "18", month = apr, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Mon Nov 16 21:38:58 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See \cite{Andrew:1979:AEA}.", acknowledgement = ack-nhfb, fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", } @Article{Melville:1980:CDS, author = "Robert Melville and David Gries", title = "Controlled Density Sorting", journal = j-INFO-PROC-LETT, volume = "10", number = "4--5", pages = "169--172", day = "5", month = jul, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Tue Nov 17 18:00:22 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C6120 (File organisation)", corpsource = "Computer Sci. Dept., Cornell Univ., Ithaca, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer systems programming; controlled density sorting; insertion sort; sorting", treatment = "P Practical", } @Article{Bertossi:1980:CSJ, author = "Alan A. Bertossi", title = "On the complexity of scheduling jobs on dedicated resources to minimize set-up costs", journal = j-INFO-PROC-LETT, volume = "10", number = "4--5", pages = "173--177", day = "5", month = jul, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "90B35 (68C15)", MRnumber = "82b:90063", MRreviewer = "J{\'o}zef Grabowski", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C1180 (Optimisation techniques); C4290 (Other computer theory)", corpsource = "Ist. di Sci dell'Informazione, Univ. di Pisa, Pisa, Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "computation theory; computational complexity; computer metatheory; dedicated resources; drives; NP hardness; optimisation; scheduling; scheduling jobs; volumes", treatment = "T Theoretical or Mathematical", } @Article{Fraenkel:1980:CSA, author = "Aviezri S. Fraenkel and Yaacov Yesha", title = "Complexity of solving algebraic equations", journal = j-INFO-PROC-LETT, volume = "10", number = "4--5", pages = "178--179", day = "5", month = jul, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25 (03D15)", MRnumber = "82a:68071", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Dept. of Appl. Math., Weizmann Inst. of Sci., Rehovot, Israel", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "algebraic equations; Boolean conjunctive normal form; computational complexity; NP complete; optimisation", treatment = "T Theoretical or Mathematical", } @Article{Luccio:1980:CMC, author = "F. Luccio and S. Mazzone", title = "A cryptosystem for multiple communication", journal = j-INFO-PROC-LETT, volume = "10", number = "4--5", pages = "180--183", day = "5", month = jul, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See notes \cite{Meijer:1981:NCM,Hellman:1981:ACA}.", acknowledgement = ack-nhfb, classification = "723; B6120B (Codes); B6210L (Computer communications); C5620 (Computer networks and techniques); C6130 (Data handling techniques)", corpsource = "Univ. of Pisa, Pisa, Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "authentication; computer networks; cryptosystem; cryptosystems; data transmission; encoding; multiple communication; security of data", treatment = "P Practical", } @Article{Lengauer:1980:SCP, author = "Thomas Lengauer and Robert E. Tarjan", title = "The space complexity of pebble games on trees", journal = j-INFO-PROC-LETT, volume = "10", number = "4--5", pages = "184--188", day = "5", month = jul, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25 (68E10 90D42)", MRnumber = "82c:68023", MRreviewer = "R. E. Stearns", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C1140E (Game theory)", corpsource = "Computer Sci. Dept., Stanford Univ., Stanford, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "black and white pebble game; black pebble game; directed acyclic graphs; directed graphs; game theory; pebble games; space complexity; trees; trees (mathematics)", treatment = "T Theoretical or Mathematical", } @Article{Farley:1980:LTT, author = "Arthur M. Farley", title = "Levelling Terrain Trees: a Transshipment Problem", journal = j-INFO-PROC-LETT, volume = "10", number = "4--5", pages = "189--192", day = "5", month = jul, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "90B10 (68C25)", MRnumber = "81i:90072", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "406; 723; 912; C1160 (Combinatorial mathematics); C1290H (Systems theory applications in transportation)", corpsource = "Dept. of Computer and Information Sci., Univ. of Oregon, Eugene, OR, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "civil engineers; computer programming --- Subroutines; discrete mathematics; graph theory; level road bed; levelling; mathematical techniques --- Graph Theory; mountainous terrain; operations research; road networks; roads and streets; terrain trees; transportation; transshipment problem; truck loads", treatment = "T Theoretical or Mathematical", } @Article{Broy:1980:PDE, author = "M. Broy and M. Wirsing", title = "Program development: from enumeration to backtracking", journal = j-INFO-PROC-LETT, volume = "10", number = "4--5", pages = "193--197", day = "5", month = jul, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6110 (Systems analysis and programming)", corpsource = "Inst. f{\"u}r Informatik, Tech. Univ. Munchen, Munchen, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "backtracking; enumeration; program development; programming techniques; programming theory; schematic rules; software engineering", treatment = "P Practical", } @Article{Burton:1980:RVI, author = "F. W. Burton and G. N. Lewis", title = "A robust variation of interpolation search", journal = j-INFO-PROC-LETT, volume = "10", number = "4--5", pages = "198--201", day = "5", month = jul, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation)", corpsource = "School of Computing Studies, Univ. of East Anglia, Norwich, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "binary search; common data; computational costs; data accesses; file organisation; interpolation search; memory access costs; sorted list; synchronization; table lookup; waiting costs", treatment = "P Practical", } @Article{Savage:1980:MMT, author = "Carla Savage", title = "Maximum matchings and trees", journal = j-INFO-PROC-LETT, volume = "10", number = "4--5", pages = "202--205", day = "5", month = jul, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E10 (68C25)", MRnumber = "82a:68129", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Computer Sci. Dept., North Carolina State Univ., Raleigh, NC, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "computational complexity; maximum matchings; search spanning tree; trees; trees (mathematics)", treatment = "T Theoretical or Mathematical", } @Article{Doran:1980:VSS, author = "R. W. Doran and L. K. Thomas", title = "Variants of the software solution to mutual exclusion", journal = j-INFO-PROC-LETT, volume = "10", number = "4--5", pages = "206--208", day = "5", month = jul, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68B20", MRnumber = "82a:68042", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Amdahl Corp., Sunnyvale, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "critical section; indefinite blocking; mutual exclusion; programming theory; sequential processes; task", treatment = "T Theoretical or Mathematical", } @Article{Overmars:1980:FCB, author = "Mark H. Overmars and Jan {van Leeuwen}", title = "Further comments on {A. Bykat}'s convex hull algorithm: {``Convex hull of a finite set of points in two dimensions'' [Inform. Process. Lett. {\bf 7} (1978), no. 6, 296--298; MR 80b:68041]}", journal = j-INFO-PROC-LETT, volume = "10", number = "4--5", pages = "209--212", day = "5", month = jul, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25 (52-04)", MRnumber = "82a:68080", MRreviewer = "D. T. Lee", bibdate = "Sun May 02 08:27:35 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See \cite{Bykat:1978:CHF,Fournier:1979:CCH,Devai:1979:CCH}.", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics)", corpsource = "Dept. of Computer Sci., Univ. of Utrecht, Utrecht, Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "Bykat's convex hull algorithm; topology", treatment = "T Theoretical or Mathematical", } @Article{Meijer:1980:DAN, author = "Henk Meijer and Selim G. Akl", title = "The Design and Analysis of a New Hybrid Sorting Algorithm", journal = j-INFO-PROC-LETT, volume = "10", number = "4--5", pages = "213--218", day = "5", month = jul, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E05", MRnumber = "81h:68052", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory); C6130 (Data handling techniques)", corpsource = "Dept. of Math. and Statistics, Queen's Univ., Kingston, Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm theory; computer systems programming; Distributive Partitioning; Hybrid sort; hybrid sorting algorithm; probability distributions; sorting; uniformly distributed inputs", treatment = "P Practical", } @Article{Nakamura:1980:RTD, author = "Akira Nakamura and Katsushi Inoue", title = "A remark on two-dimensional finite automata: {``Some properties of two-dimensional on-line tessellation acceptors'' [Inform. Sci. {\bf 13} (1977), no. 2, 95--121; MR 80e:68143]}", journal = j-INFO-PROC-LETT, volume = "10", number = "4--5", pages = "219--222", day = "5", month = jul, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68D20", MRnumber = "81i:68082", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory)", corpsource = "Dept. of Appl. Math., Hiroshima Univ., Hiroshima, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "finite automata; input arrays; square array inputs; square array languages; two dimensional finite automata", treatment = "T Theoretical or Mathematical", } @Article{Ehrenfeucht:1980:EIT, author = "A. Ehrenfeucht and G. Rozenberg", title = "On the emptiness of the intersection of two {D0S} languages problem", journal = j-INFO-PROC-LETT, volume = "10", number = "4--5", pages = "223--225", day = "5", month = jul, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68F05 (03D35)", MRnumber = "81h:68066", bibdate = "Tue Nov 17 18:00:27 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Computer Sci., Univ. of Colorado, Boulder, CO, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "D0S languages; emptiness; formal languages; intersection; lindenmeyer systems; transition mapping", treatment = "P Practical", } @Article{Chung:1980:NPA, author = "K. M. Chung and F. Luccio and C. K. Wong", title = "A new permutation algorithm for bubble memories", journal = j-INFO-PROC-LETT, volume = "10", number = "4--5", pages = "226--230", day = "5", month = jul, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68B15 (68C25)", MRnumber = "82a:68029", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C5210 (Logic design methods)", corpsource = "Dept. of Computer Sci., Univ. of Illinois, Urbana, IL, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "logic design; magnetic bubble devices; magnetic bubble memory; permutation algorithm", treatment = "N New Development; P Practical", } @Article{Bohm:1980:CBE, author = "Corrado B{\"o}hm and Antonio Mach{\`i} and Giovanna Sontacchi", title = "Complexity bounds for equivalence and isomorphism of {Latin} squares", journal = j-INFO-PROC-LETT, volume = "10", number = "4--5", pages = "231--233", day = "5", month = jul, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25 (05B15)", MRnumber = "82a:68066", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics)", corpsource = "Istituto Matematico `G. Castelnuovo', Univ. di Roma, Roma, Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "complexity bound; equivalence; graph theory; isomorphism; latin squares; polynomial complexity; worst case", treatment = "T Theoretical or Mathematical", } @Article{Czaja:1980:DFP, author = "Ludwik Czaja", title = "Deadlock and Fairness in Parallel Schemas: a Set-Theoretic Characterization and Decision Problems", journal = j-INFO-PROC-LETT, volume = "10", number = "4--5", pages = "234--239", day = "5", month = jul, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68B20", MRnumber = "82e:68027", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "722; 723; C1160 (Combinatorial mathematics); C4290 (Other computer theory)", corpsource = "Inst. Informatyki, Univ. Warszawskiego, Warszawa, Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer systems, digital; deadlock; decision problems; fairness; parallel processing; parallel schemas; potential computation histories; priority queue scheduling; queueing theory; scheduling; set theory; uninterpreted parallel system schemas", treatment = "T Theoretical or Mathematical", } @Article{Booth:1980:LLC, author = "Kellogg S. Booth", title = "Lexicographically least circular substrings", journal = j-INFO-PROC-LETT, volume = "10", number = "4--5", pages = "240--242", day = "5", month = jul, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E99", MRnumber = "81g:68100", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Dept. of Computer Sci., Univ. of Waterloo, Waterloo, Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "algorithm theory; canonical form; graph isomorphism algorithms; Knuth Morris Pratt algorithm; least circular substrings; lexicographically least circular shift; linear time pattern matching algorithm", treatment = "T Theoretical or Mathematical", } @Article{Buneman:1980:THP, author = "Peter Buneman and Leon Levy", title = "The {Towers} of {Hanoi} problem", journal = j-INFO-PROC-LETT, volume = "10", number = "4--5", pages = "243--244", day = "5", month = jul, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C05 (05A99)", MRnumber = "81j:68043", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Dept. of Computer and Information Sci., Univ. of Pennsylvania, Philadelphia, PA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "algorithm; algorithm theory; towers of Hanoi problem", treatment = "T Theoretical or Mathematical", } @Article{Inoue:1980:NDP, author = "Katsushi Inoue and Itsuo Takanami", title = "A note on decision problems for three-way two-dimensional finite automata", journal = j-INFO-PROC-LETT, volume = "10", number = "4--5", pages = "245--248", day = "5", month = jul, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68D05 (03D05)", MRnumber = "81h:68036", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory)", corpsource = "Dept. of Electronics, Yamaguchi Univ., Ube, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "decision problems; finite automata; three way two dimensional finite automata", treatment = "T Theoretical or Mathematical", } @Article{Dijkstra:1980:TDD, author = "Edsger W. Dijkstra and C. S. Scholten", title = "Termination detection for diffusing computations", journal = j-INFO-PROC-LETT, volume = "11", number = "1", pages = "1--4", day = "29", month = aug, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68B05", MRnumber = "81h:68006", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4290 (Other computer theory)", corpsource = "Burroughs, Nuenen, Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "computation theory; computer metatheory; diffusing computations; graph; graph theory; messages; node; signalling scheme; termination detection", treatment = "T Theoretical or Mathematical", } @Article{Dobosiewicz:1980:EVB, author = "W{\l}odzimierz Dobosiewicz", title = "An Efficient Variation of Bubble Sort", journal = j-INFO-PROC-LETT, volume = "11", number = "1", pages = "5--6", day = "29", month = aug, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6120 (File organisation)", corpsource = "Inst. of Informatics, Warsaw Univ., Warszawa, Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "algorithms; bubble sort; sorting", treatment = "P Practical", } @Article{Allison:1980:SDP, author = "D. C. S. Allison and M. T. Noga", title = "Selection by distributive partitioning", journal = j-INFO-PROC-LETT, volume = "11", number = "1", pages = "7--8", day = "29", month = aug, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68P10", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Dept. of Computer Sci., Virginia Polytech. Inst. and State Univ., Blacksburg, VA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "distributive partitioning; programming theory; selection methods; time complexity; uniform distributions", treatment = "T Theoretical or Mathematical", } @Article{Krawczyk:1980:ECM, author = "Tomasz Krawczyk", title = "Error correction by mutational grammars", journal = j-INFO-PROC-LETT, volume = "11", number = "1", pages = "9--15", day = "29", month = aug, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68B10 (68F25)", MRnumber = "81g:68021", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C6150C (Compilers, interpreters and other processors)", corpsource = "MERA-Inst. of Mathematical Machines, Warsaw, Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "error correction; fault tolerant computing; grammars; mutational grammars; parser; program compilers", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Bhat:1980:CTG, author = "Kabekode V. S. Bhat", title = "On the complexity of testing a graph for $n$-cube", journal = j-INFO-PROC-LETT, volume = "11", number = "1", pages = "16--19", day = "29", month = aug, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25 (68E10)", MRnumber = "82a:68064", MRreviewer = "M. C. Golumbic", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Dept. of Computer and Information Sci., Ohio State Univ., Columbus, OH, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "complexity; computational complexity; distance matrix; graph; graph theory; n-cube", treatment = "T Theoretical or Mathematical", } @Article{Grabowski:1980:DPV, author = "Jan Grabowski", title = "The decidability of persistence for vector addition systems", journal = j-INFO-PROC-LETT, volume = "11", number = "1", pages = "20--23", day = "29", month = aug, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68D90", MRnumber = "82c:68035", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Sektion Math., Humboldt-Univ. Berlin, Berlin, East Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "computability and decidability; decision problem; persistence; Petri net; vector addition systems", treatment = "T Theoretical or Mathematical", } @Article{Loui:1980:NPG, author = "Michael C. Loui", title = "A note on the pebble game", journal = j-INFO-PROC-LETT, volume = "11", number = "1", pages = "24--26", day = "29", month = aug, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25 (68E10 90D42)", MRnumber = "82c:68024", MRreviewer = "R. E. Stearns", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory)", corpsource = "Lab. for Computer Sci., MIT, Cambridge, MA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "arithmetic expression evaluation; automata theory; directed graphs; pebble game; Turing machine simulation", treatment = "T Theoretical or Mathematical", } @Article{Day:1980:ISR, author = "J. D. Day", title = "On the internal {$S$}-stability of {Rosenbrock} methods", journal = j-INFO-PROC-LETT, volume = "11", number = "1", pages = "27--30", day = "29", month = aug, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "65L20", MRnumber = "81k:65100", MRreviewer = "F. Odeh", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "B0290P (Differential equations); C4170 (Differential equations)", corpsource = "Div. of Engng., Gippsland Inst. of Advanced Education, Churchill, Vic., Australia", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "convergence of numerical methods; differential equations; internal S stability; Rosenbrock methods; Runge Kutta methods; stiff differential equations", treatment = "T Theoretical or Mathematical", } @Article{Day:1980:CSM, author = "J. D. Day", title = "Comments on: {``On an {$L$}-stable method for stiff differential equations'' [Inform. Process. Lett. {\bf 6} (1977), no. 5, 158--161; {MR \bf 56} \#10015] by T. D. Bui}", journal = j-INFO-PROC-LETT, volume = "11", number = "1", pages = "31--32", day = "29", month = aug, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "65L05", MRnumber = "82h:65052", MRreviewer = "Richard Brown", bibdate = "Sun May 02 08:27:00 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See \cite{Bui:1977:SMS,Bui:1979:ESM}.", acknowledgement = ack-nhfb, classification = "B0290P (Differential equations); C4170 (Differential equations)", corpsource = "Div. of Engng., Gippsland Inst. of Advanced Education, Churchill, Vic., Australia", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "convergence of numerical methods; differential equations; l stability; Rosenbrook methods; Runge Kutta methods; stiff differential equations", treatment = "T Theoretical or Mathematical", } @Article{Loizou:1980:CFA, author = "G. Loizou", title = "On a cycle finding algorithm", journal = j-INFO-PROC-LETT, volume = "11", number = "1", pages = "33--36", day = "29", month = aug, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Dept. of Computer Sci., Birkbeck Coll., Univ. of London, London, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "algorithm theory; cycle finding algorithm; Syslo's algorithm; time complexity", treatment = "T Theoretical or Mathematical", } @Article{Brown:1980:IBL, author = "Donna J. Brown", title = "An improved {BL} lower bound", journal = j-INFO-PROC-LETT, volume = "11", number = "1", pages = "37--39", day = "29", month = aug, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "90B05 (05B40 68B20)", MRnumber = "82a:90044", MRreviewer = "V. Yu. Me{\u{\i}}tus", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C1290 (Applications of systems theory)", corpsource = "Coordinated Sci. Lab., Univ. of Illinois, Urbana, IL, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "bin packing; operations research", treatment = "T Theoretical or Mathematical", } @Article{Peterson:1980:NCP, author = "J. L. Peterson", title = "A note on colored {Petri} nets", journal = j-INFO-PROC-LETT, volume = "11", number = "1", pages = "40--43", day = "29", month = aug, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6130 (Data handling techniques)", corpsource = "Dept. of Computer Sci., Univ. of Texas, Austin, TX, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "coloured Petri net; computation theory; disk drive OS; graph theory; operating systems (computers); Turing machines", treatment = "P Practical", } @Article{Valiant:1980:CMP, author = "L. G. Valiant", title = "Computing multivariate polynomials in parallel", journal = j-INFO-PROC-LETT, volume = "11", number = "1", pages = "44--45", day = "29", month = aug, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25 (12-04 68B20)", MRnumber = "81k:68038", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "B0290H (Linear algebra); C4140 (Linear algebra)", corpsource = "Computer Sci. Dept., Edinburgh Univ., Edinburgh, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "multivariate polynomials; parallel processing; polynomials", treatment = "T Theoretical or Mathematical", } @Article{Brent:1980:ABT, author = "R. P. Brent", title = "On the area of binary tree layouts", journal = j-INFO-PROC-LETT, volume = "11", number = "1", pages = "46--48", day = "29", month = aug, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C5210 (Logic design methods)", corpsource = "Dept. of Computer Sci., Australian Nat. Univ., Canberra, ACT, Australia", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "binary tree layouts; boundary; chip; convex curve; convexity; leaves; logic design; packaging; trees (mathematics); wires", treatment = "T Theoretical or Mathematical", } @Article{Dyer:1980:FPA, author = "Charles R. Dyer", title = "A fast parallel algorithm for the closest pair problem", journal = j-INFO-PROC-LETT, volume = "11", number = "1", pages = "49--52", day = "29", month = aug, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68G10 (68C25 68D20)", MRnumber = "82b:68075", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory)", corpsource = "Computer Sci. Center, Univ. of Maryland, College Park, MD, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "bounded cellular array automaton; closest pair problem; fast parallel algorithm; finite automata; parallel processing; pyramid cellular automation", treatment = "T Theoretical or Mathematical", } @Article{Devroye:1980:NFC, author = "Luc Devroye", title = "A note on finding convex hulls via maximal vectors", journal = j-INFO-PROC-LETT, volume = "11", number = "1", pages = "53--56", day = "29", month = aug, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25 (52-04 52A20)", MRnumber = "82a:68070", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "School of Computer Sci., McGill Univ., Montreal, Que., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "algorithm theory; convex hulls; distribution; maximal vectors; topology", treatment = "T Theoretical or Mathematical", } @Article{Lloyd:1980:ELS, author = "E. L. Lloyd", title = "Errata: {``List scheduling bounds for {UET} systems with resources'' [Inform. Process. Lett. {\bf 10} (1980), no. 1, 28--31; MR 81a:68042]}", journal = j-INFO-PROC-LETT, volume = "11", number = "1", pages = "57--57", day = "29", month = aug, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C15", MRnumber = "82a:68062", bibdate = "Sat Apr 11 12:24:20 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See \cite{Lloyd:1980:LSB}.", acknowledgement = ack-nhfb, fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", } @Article{vanLeeuwen:1980:ELS, author = "J. {van Leeuwen} and D. Wood", title = "Errata: {``List scheduling bounds for {UET} systems with resources'' [Inform. Process. Lett. {\bf 10} (1980), no. 1, 28--31; MR 81a:68042]}", journal = j-INFO-PROC-LETT, volume = "11", number = "1", pages = "57--57", day = "29", month = aug, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E05", MRnumber = "81i:68091b", bibdate = "Sat Apr 11 12:24:20 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See \cite{Lloyd:1980:LSB}.", acknowledgement = ack-nhfb, fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", } @Article{Banachowski:1980:CTR, author = "Lech Banachowski", title = "A complement to {Tarjan}'s result about the lower bound on the complexity of the set union problem", journal = j-INFO-PROC-LETT, volume = "11", number = "2", pages = "59--65", day = "??", month = oct, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C05 (68C25)", MRnumber = "82c:68017", MRreviewer = "O. D'Antona", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Inst. of Informatics, Warsaw Univ., Warsaw, Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "computational complexity; lemmas; nonlinear lower bound; set theory; set union problem; time complexity", treatment = "T Theoretical or Mathematical", } @Article{Urbanek:1980:ACE, author = "Friedrich J. Urbanek", title = "An {$O(\log n)$} algorithm for computing the $n$th element of the solution of a difference equation", journal = j-INFO-PROC-LETT, volume = "11", number = "2", pages = "66--67", day = "??", month = oct, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C05 (10-04 10A35 10A40)", MRnumber = "82g:68034a", MRreviewer = "Yuri Breitbart", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "B0290M (Numerical integration and differentiation); C4160 (Numerical integration and differentiation)", corpsource = "Inst. f{\"u}r Math. Logik und Formale Sprachen, Tech. Univ. Wien, Wien, Austria", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "algorithm; binary sequences; difference equations; linear homogeneous difference equations; nth element", treatment = "T Theoretical or Mathematical", } @Article{Gries:1980:CFN, author = "David Gries and Gary Levin", title = "Computing {Fibonacci} numbers (and similarly defined functions) in log time", journal = j-INFO-PROC-LETT, volume = "11", number = "2", pages = "68--69", day = "??", month = oct, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C05 (10-04 10A35 10A40)", MRnumber = "82g:68034b", MRreviewer = "Yuri Breitbart", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "B0290M (Numerical integration and differentiation); C4160 (Numerical integration and differentiation)", corpsource = "Computer Sci. Dept., Cornell Univ., Ithaca, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "computational complexity; difference equations; Fibonacci numbers; linear homogeneous difference equation; series (mathematics); time bound", treatment = "T Theoretical or Mathematical", } @Article{Ebert:1980:NOE, author = "J{\"u}rgen Ebert", title = "A note on odd and even factors of undirected graphs", journal = j-INFO-PROC-LETT, volume = "11", number = "2", pages = "70--72", day = "??", month = oct, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E10 (68C25)", MRnumber = "81j:68078", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics)", corpsource = "Fachbereich Naturwissenschaften, Univ. Osnabruck, Osnabruck, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "depth first search algorithm; even order graphs; graph theory; maximal even factor; maximal odd factor; undirected graphs", treatment = "T Theoretical or Mathematical", } @Article{Liu:1980:ATL, author = "Lishing Liu and Alan Demers", title = "An algorithm for testing lossless join property in relational databases", journal = j-INFO-PROC-LETT, volume = "11", number = "2", pages = "73--76", day = "??", month = oct, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68B15 (68C25)", MRnumber = "82a:68033", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C6160D (Relational databases)", corpsource = "MITRE Corp., Bedford, MA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "algorithm; database management systems; lossless join property testing; relational databases", treatment = "T Theoretical or Mathematical", } @Article{Preparata:1980:AOV, author = "Franco P. Preparata and Jean E. Vuillemin", title = "Area-Time Optimal {VLSI} Networks for Multiplying Matrices", journal = j-INFO-PROC-LETT, volume = "11", number = "2", pages = "77--80", day = "??", month = oct, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "713; 721; 723; B0210 (Algebra); B1265B (Logic circuits); C1110 (Algebra); C5120 (Logic and switching circuits)", corpsource = "Coordinated Sci. Lab., Univ. of Illinois, Urbana, IL, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "area/time optimal networks; digital integrated circuits; integrated circuits --- Very Large Scale Integration; large scale integration; logic design; matrix algebra; multiplying circuits; pipeline processing; pipelining; recursively defined matrix multiplier; VLSI networks", treatment = "P Practical", } @Article{Chung:1980:MNS, author = "K. M. Chung and F. Luccio and C. K. Wong", title = "Minimum number of steps for permutation in a bubble memory", journal = j-INFO-PROC-LETT, volume = "11", number = "2", pages = "81--83", day = "??", month = oct, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68H05 (68C25)", MRnumber = "82a:68178", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "B3120L (Magnetic bubble domain devices); C5320E (Storage on stationary magnetic media)", corpsource = "Wang Labs., Lowell, MA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "bubble memory; computational complexity; lower bound; magnetic bubble memories; optimal algorithm; permutation", treatment = "T Theoretical or Mathematical", } @Article{Yao:1980:NAE, author = "Andrew C. Yao", title = "A Note on the Analysis of Extendible Hashing", journal = j-INFO-PROC-LETT, volume = "11", number = "2", pages = "84--86", day = "??", month = oct, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68H05", MRnumber = "82a:68180", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation)", corpsource = "Computer Sci. Dept., Stanford Univ., Stanford, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "average depth; average number of entries; bounds; data access; extendible hashing; file organisation; hash tables", treatment = "T Theoretical or Mathematical", } @Article{Broy:1980:TSC, author = "M. Broy", title = "Transformational Semantics for Concurrent Programs", journal = j-INFO-PROC-LETT, volume = "11", number = "2", pages = "87--91", day = "??", month = oct, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68B10", MRnumber = "81i:68022", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Inst. f{\"u}r Informatik Tech. Univ. Munchen, Munchen, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "axiomatic transformation rules; computer programming; concurrent programs; formal languages; language of guarded commands; multiprogramming; semantics; sequential program", treatment = "T Theoretical or Mathematical", } @Article{Johnson:1980:CVA, author = "Robert B. {Johnson, Jr.}", title = "The complexity of a {VLSI} adder", journal = j-INFO-PROC-LETT, volume = "11", number = "2", pages = "92--93", day = "??", month = oct, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "94C99 (68C25)", MRnumber = "81i:94047", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "B1265B (Logic circuits); C5120 (Logic and switching circuits)", corpsource = "Dept. of Maths., Univ. of Illinois, Urbana, IL, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "adders; area/time complexity; binary addition; computational complexity; digital integrated circuits; large scale integration; lower bound; VLSI adder", treatment = "T Theoretical or Mathematical", } @Article{Calmet:1980:IRP, author = "J. Calmet and R. Loos", title = "An improvement of {Rabin}'s probabilistic algorithm for generating irreducible polynomials over {GF($p$)}", journal = j-INFO-PROC-LETT, volume = "11", number = "2", pages = "94--95", day = "??", month = oct, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "B0290F (Interpolation and function approximation); C4130 (Interpolation and function approximation)", corpsource = "Inst. f{\"u}r Informatik I, Univ. Karlsruhe, Karlsruhe, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "computational complexity; factorization algorithm; irreducible polynomials over GF(p); polynomials; probabilistic algorithm; probabilistic logic; SIAM J. Comput", treatment = "T Theoretical or Mathematical", } @Article{Colbourn:1980:CCP, author = "Charles J. Colbourn and Brendan D. McKay", title = "A correction to {Colbourn}'s paper on the complexity of matrix symmetrizability: {``The complexity of symmetrizing matrices'' [Inform. Process. Lett. {\bf 9} (1979), no. 3, 108--109; MR 81a:68045]}", journal = j-INFO-PROC-LETT, volume = "11", number = "2", pages = "96--97", day = "??", month = oct, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25 (65F30)", MRnumber = "82a:68069", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See \cite{Colbourn:1979:CSM}.", acknowledgement = ack-nhfb, classification = "B0210 (Algebra); C1110 (Algebra)", corpsource = "Dept. of Computer Sci., Univ. of Toronto, Toronto, Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "complexity; computational complexity; matrix algebra; matrix symmetrizability problem; NP completeness", treatment = "T Theoretical or Mathematical", } @Article{Kanellakis:1980:CCC, author = "Paris C. Kanellakis", title = "On the computational complexity of cardinality constraints in relational databases", journal = j-INFO-PROC-LETT, volume = "11", number = "2", pages = "98--101", day = "??", month = oct, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68B15 (03D15 68C25)", MRnumber = "82m:68041", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C6160D (Relational databases)", corpsource = "MIT, Cambridge, MA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "cardinality constraints; computational complexity; database management systems; dependencies; lossless join problem; NP completeness; relational databases", treatment = "T Theoretical or Mathematical", } @Article{Luque:1980:TAM, author = "E. Luque and A. Ripoll", title = "Tuning Architecture via Microprogramming", journal = j-INFO-PROC-LETT, volume = "11", number = "2", pages = "102--109", day = "??", month = oct, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "722; 723; C5220 (Computer architecture)", corpsource = "Dept. de Electricidad y Electronica, Facultad de Ciencias, Univ. Autonoma de Barcelona, Barcelona, Spain", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer architecture; computer architecture tuning; control memory; microprogrammable computer; microprogramming; tuning", treatment = "P Practical", } @Article{Leiss:1980:NSS, author = "E. Leiss", title = "A note on a signature system based on probabilistic logic", journal = j-INFO-PROC-LETT, volume = "11", number = "2", pages = "110--113", day = "??", month = oct, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C6130 (Data handling techniques)", corpsource = "Dept. of Computer Sci., Univ. of Houston, Houston, TX, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "data privacy; digitalised signature system; probabilistic logic; requirements", treatment = "A Application", } @Article{Leung:1980:NPS, author = "Joseph Y.-T. Leung and M. L. Merrill", title = "A note on preemptive scheduling of periodic, real-time tasks", journal = j-INFO-PROC-LETT, volume = "11", number = "3", pages = "115--118", day = "18", month = nov, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C15", MRnumber = "82d:68029", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C6150J (Operating systems)", corpsource = "Dept. of Electrical Engng. and Computer Sci., Northwestern Univ., Evanston, IL, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "multiprogramming; periodic real-time tasks; preemptive scheduling; scheduling", treatment = "A Application; T Theoretical or Mathematical", } @Article{Robson:1980:SAN, author = "J. M. Robson", title = "Storage allocation is {NP}-hard", journal = j-INFO-PROC-LETT, volume = "11", number = "3", pages = "119--125", day = "18", month = nov, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25 (68B15 90B05 90C10)", MRnumber = "82b:68038", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C6150J (Operating systems)", corpsource = "Dept. of Computer Sci., Australian Nat. Univ., Canberra, ACT, Australia", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer operating systems; NP-hard; request/freeing sequences; storage allocation", treatment = "A Application; T Theoretical or Mathematical", } @Article{Avis:1980:CLB, author = "David Avis", title = "Comments on a lower bound for convex hull determination: {``On the $\Omega(n\log n)$ lower bound for convex hull and maximal vector determination'' by van Emde Boas} {[Inform. Process. Lett. {\bf 10}(3), 18 April 1980, pp. 132--136]}", journal = j-INFO-PROC-LETT, volume = "11", number = "3", pages = "126--126", day = "18", month = nov, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25 (52-04 52A10 90C25)", MRnumber = "83e:68034b", MRreviewer = "Selim G. Akl", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See \cite{vanEmdeBoas:1980:LBC}.", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "McGill Univ., Montreal, Que., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "computational complexity; convex hull; linear decision trees; lower bound; trees (mathematics)", treatment = "G General Review", } @Article{Moura:1980:NGC, author = "Arnaldo Moura", title = "A note on grammatical covers", journal = j-INFO-PROC-LETT, volume = "11", number = "3", pages = "127--129", day = "18", month = nov, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68F05", MRnumber = "82d:68047", MRreviewer = "A. V. An\={\i}s\={\i}mov", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Electrical Engng. and Computer Sci., Univ. of California, Berkeley, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "context-free grammars; grammatical covers; Greibach normal form; null string", treatment = "T Theoretical or Mathematical", } @Article{Bailey:1980:FSS, author = "T. A. Bailey and R. G. Dromey", title = "Fast string searching by finding subkeys in subtext", journal = j-INFO-PROC-LETT, volume = "11", number = "3", pages = "130--133", day = "18", month = nov, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C6130 (Data handling techniques)", corpsource = "Dept. of Computing Sci., Univ. of Wollongong, Wollongong, NSW, Australia", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "characters; data handling; sequences; string search; subkeys; subtext", treatment = "A Application; T Theoretical or Mathematical", } @Article{Romani:1980:SPP, author = "Francesco Romani", title = "Shortest-path problem is not harder than matrix multiplication", journal = j-INFO-PROC-LETT, volume = "11", number = "3", pages = "134--136", day = "18", month = nov, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25 (90B10)", MRnumber = "81k:68036", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See also note \cite{Moran:1981:NSP}.", acknowledgement = ack-nhfb, classification = "C1110 (Algebra); C1160 (Combinatorial mathematics)", corpsource = "Istituto di Elaborazione dell'Informazione, Pisa, Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "all-pairs shortest-path problem; complexity; graph theory; matrix algebra; matrix multiplication", treatment = "T Theoretical or Mathematical", } @Article{Erkio:1980:IMS, author = "H. Erkio", title = "Internal merge sorting with delayed selection", journal = j-INFO-PROC-LETT, volume = "11", number = "3", pages = "137--140", day = "18", month = nov, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C6130 (Data handling techniques)", corpsource = "Dept. of Computer Sci., Univ. of Helsinki, Helsinki, Finland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "delayed selection; essential logic; internal sorting; key comparisons; merge sorting; merging; sorting", treatment = "A Application; T Theoretical or Mathematical", } @Article{Dershowitz:1980:SMA, author = "N. Dershowitz", title = "The {Schorr--Waite} marking algorithm revisited", journal = j-INFO-PROC-LETT, volume = "11", number = "3", pages = "141--143", day = "18", month = nov, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Computer Sci., Univ. of Illinois, Urbana, IL, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "correctness; correctness proving; directed graph; directed graphs; nodes; programming theory; Schorr--Waite marking algorithm", treatment = "A Application; T Theoretical or Mathematical", } @Article{Kinber:1980:IPD, author = "E. B. Kinber", title = "On inclusion problem for deterministic multitape automata", journal = j-INFO-PROC-LETT, volume = "11", number = "3", pages = "144--146", day = "18", month = nov, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68D05 (03D05 68F10)", MRnumber = "82f:68055", MRreviewer = "Michael Anshel", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4220 (Automata theory)", corpsource = "Computing Center, Latvian State Univ., Riga, Latvian SSR, USSR", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "computability and decidability; decidable inclusion; deterministic automata; deterministic multitape automata; inclusion problem; n-tape automata", treatment = "T Theoretical or Mathematical", } @Article{Laut:1980:SPI, author = "A. Laut", title = "Safe procedural implementations of algebraic types", journal = j-INFO-PROC-LETT, volume = "11", number = "4--5", pages = "147--151", day = "12", month = dec, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation)", corpsource = "Inst. f{\"u}r Informatik., Tech. Univ. Munchen, Munchen, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "abstract data types; algebraic types; data structures; program specification; programming", treatment = "P Practical", } @Article{Paredaens:1980:GLA, author = "J. Paredaens and F. Ponsaert", title = "Grant levels in an authorization mechanism", journal = j-INFO-PROC-LETT, volume = "11", number = "4--5", pages = "152--155", day = "12", month = dec, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C6160 (Database management systems (DBMS)); C7100 (Business and administration)", corpsource = "Dept. of Math., Univ. Instelling Antwerpen, Wilrijk, Belgium", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "authorization mechanism; database management systems; database systems; grants; hierarchical structure; management information systems; MIS; security of data", treatment = "P Practical", } @Article{Frederickson:1980:PAS, author = "Greg N. Frederickson", title = "Probabilistic analysis for simple one- and two-dimensional bin packing algorithms", journal = j-INFO-PROC-LETT, volume = "11", number = "4--5", pages = "156--161", day = "12", month = dec, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C05 (52-04 52A45 60C05)", MRnumber = "82i:68019", MRreviewer = "R. Subramanian", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Dept. of Computer Sci., Pennsylvania State Univ., University Park, PA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "algorithm theory; bin packing algorithms; computer science; expected performance; NP-complete; probabilistic analysis", treatment = "P Practical", } @Article{Ibarra:1980:NPC, author = "Oscar H. Ibarra and Shlomo Moran and Louis E. Rosier", title = "A note on the parallel complexity of computing the rank of order $n$ matrices", journal = j-INFO-PROC-LETT, volume = "11", number = "4--5", pages = "162--162", day = "12", month = dec, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25", MRnumber = "82d:68033", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4140 (Linear algebra); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Computer Sci., Univ. of Minnesota, Minneapolis, MN, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "computational complexity; matrix algebra; order n matrices; parallel complexity; rank", treatment = "T Theoretical or Mathematical", } @Article{Hanson:1980:CIL, author = "D. R. Hanson", title = "Code improvement via lazy evaluation", journal = j-INFO-PROC-LETT, volume = "11", number = "4--5", pages = "163--167", day = "12", month = dec, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C6110 (Systems analysis and programming)", corpsource = "Dept. of Computer Sci., Univ. of Arizona, Tucson, AZ, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "code generation; lazy evaluation; peephole optimisation; programming", treatment = "P Practical", } @Article{terBekke:1980:CD, author = "J. H. {ter Bekke}", title = "Convertibility in databases", journal = j-INFO-PROC-LETT, volume = "11", number = "4--5", pages = "168--171", day = "12", month = dec, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C6160D (Relational databases)", corpsource = "Dept. of Math., Delft Univ. of Technol., Delft, Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "convertibility; data semantics; database management systems; DBMS; normalized relations; relational databases", treatment = "T Theoretical or Mathematical", } @Article{Pettorossi:1980:DAC, author = "Alberto Pettorossi", title = "Derivation of an {$O(k^2\,\log n)$} algorithm for computing order-$k$ {Fibonacci} numbers from the {$O(k^3\,\log n)$} matrix multiplication method", journal = j-INFO-PROC-LETT, volume = "11", number = "4--5", pages = "172--179", day = "12", month = dec, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25", MRnumber = "82a:68084", MRreviewer = "Henry S. Warren, Jr.", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C7310 (Mathematics computing)", corpsource = "Dept. of Computer Sci., Univ. of Edinburgh, Edinburgh, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "iterative methods; matrix algebra; O(k/sup 2/log n) algorithm; O(k/sup 3/log n) matrix multiplication method; order-k Fibonacci numbers; order-k homogeneous linear recurrence relation", treatment = "T Theoretical or Mathematical", } @Article{Williams:1980:CMC, author = "M. H. Williams", title = "Cubic map configurations", journal = j-INFO-PROC-LETT, volume = "11", number = "4--5", pages = "180--185", day = "12", month = dec, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics)", corpsource = "Dept. of Computer Sci., Rhodes Univ., Grahamstown, South Africa", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "cartography; configurations; cubic maps; graph colouring", treatment = "T Theoretical or Mathematical", } @Article{Williams:1980:BSB, author = "M. H. Williams", title = "Batch sizes for the batching method of colouring planar maps", journal = j-INFO-PROC-LETT, volume = "11", number = "4--5", pages = "186--189", day = "12", month = dec, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics)", corpsource = "Dept. of Computer Sci., Rhodes Univ., Grahamstown, South Africa", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "batching method; cubic maps; five colours; graph colouring; planar maps", treatment = "T Theoretical or Mathematical", } @Article{Majster-Cederbaum:1980:SRB, author = "Mila E. Majster-Cederbaum", title = "A simple relation between relational and predicate transformer semantics for nondeterministic programs", journal = j-INFO-PROC-LETT, volume = "11", number = "4--5", pages = "190--192", day = "12", month = dec, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68B10", MRnumber = "82m:68025", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "inst. f{\"u}r Informatik, Tech. Univ. Munchen, Munchen, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "formal languages; nondeterministic programs; predicate transformer semantics; relational semantics", treatment = "T Theoretical or Mathematical", } @Article{Petreschi:1980:SAS, author = "Rossella Petreschi and Bruno Simeone", title = "A switching algorithm for the solution of quadratic {Boolean} equations", journal = j-INFO-PROC-LETT, volume = "11", number = "4--5", pages = "193--198", day = "12", month = dec, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25 (03G05 90C20 94C10)", MRnumber = "82e:68044a", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See also erratum \cite{Petreschi:1981:ESA}.", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4230 (Switching theory)", corpsource = "Math. Inst., Univ. of L'Aquila, Aquila, Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "Boolean algebra; NP completeness; quadratic Boolean equations; switching algorithm; switching functions; test problems; worst-case complexity", treatment = "T Theoretical or Mathematical", } @Article{Arora:1980:HAP, author = "R. K. Arora and S. P. Rana", title = "Heuristic algorithms for process assignment in distributed computing systems", journal = j-INFO-PROC-LETT, volume = "11", number = "4--5", pages = "199--203", day = "12", month = dec, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C6150J (Operating systems)", corpsource = "Computer Centre, Indian Inst. of Technol., New Delhi, India", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "distributed computing systems; distributed operating systems; distributed processing; heuristic algorithms; operating systems (computers); process assignment", treatment = "P Practical", } @Article{Kawai:1980:FSP, author = "Hiroya Kawai", title = "A formal system for parallel programs in discrete time and space", journal = j-INFO-PROC-LETT, volume = "11", number = "4--5", pages = "204--210", day = "12", month = dec, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68B10 (03B45 68B20)", MRnumber = "82d:68009", MRreviewer = "R{\"u}diger Valk", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Computation Center of Osaka Univ., Osaka, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "Barcan formula; correctness; discrete time; formal logic; formal system; natural number theory; natural semantics; parallel processing; parallel programs; programming theory; temporal system", treatment = "T Theoretical or Mathematical", } @Article{tenHoopen:1980:CRR, author = "J. {ten Hoopen}", title = "Consecutive retrieval with redundancy: an optimal linear and an optimal cyclic arrangement and their storage space requirements", journal = j-INFO-PROC-LETT, volume = "11", number = "4--5", pages = "211--217", day = "12", month = dec, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68H05", MRnumber = "82g:68092", MRreviewer = "H. P. Kriegel", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation); C7250L (Non-bibliographic retrieval systems)", corpsource = "Subdept. of Appl. Math., Technol. Univ. Twente, Enschede, Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "consecutive retrieval; cyclic arrangement; file organisation; finite set; information retrieval; redundancy; repetitions; storage space requirements", treatment = "P Practical", } @Article{Kandzia:1980:CBC, author = "Peter Kandzia and Margret Mangelmann", title = "On covering {Boyce-Codd} normal forms", journal = j-INFO-PROC-LETT, volume = "11", number = "4--5", pages = "218--223", day = "12", month = dec, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68B15", MRnumber = "82e:68023", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C6160D (Relational databases)", corpsource = "Inst. f{\"u}r Informatik und Praktische Math., Christian-Albrechts-Univ.Kiel, Kiel, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "Boyce-Codd normal forms; database management systems; DBMS; functional dependences; relational database", treatment = "P Practical", } @Article{Pajunen:1980:TTL, author = "Seppo Pajunen", title = "On two theorems of {Lenstra}", journal = j-INFO-PROC-LETT, volume = "11", number = "4--5", pages = "224--228", day = "12", month = dec, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "10A25 (10-04)", MRnumber = "82d:10015", MRreviewer = "D. H. Lehmer", bibdate = "Sat Apr 11 12:24:20 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", } @Article{Jammel:1980:ECD, author = "Alfons J. Jammel and Helmut G. Stiegler", title = "On expected costs of deadlock detection", journal = j-INFO-PROC-LETT, volume = "11", number = "4--5", pages = "229--231", day = "12", month = dec, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E10 (68C25)", MRnumber = "82f:68067", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Inst. f{\"u}r Informatik und Praktische Math. Kiel, Christian-Albrechts-Univ., Kiel, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "acyclic graphs; computational complexity; deadlock detection; directed graph; edges; system recovery", treatment = "T Theoretical or Mathematical", } @Article{Mauceri:1981:FCC, author = "S. Mauceri and A. Restivo", title = "A family of codes commutatively equivalent to prefix codes", journal = j-INFO-PROC-LETT, volume = "12", number = "1", pages = "1--4", day = "13", month = feb, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "94B45", MRnumber = "82j:94021", MRreviewer = "Aldo De Luca", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See letter to the editor \cite{Krichevsky:1982:LEF}.", acknowledgement = ack-nhfb, classification = "B6120B (Codes)", corpsource = "Istituto di Matematica, Univ. di Palermo, Palermo, Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "encoding; information theory; prefix codes", treatment = "T Theoretical or Mathematical", } @Article{Dudzinski:1981:SMS, author = "Krzysztof Dudzi{\'n}ski and Andrzej Dydek", title = "On a Stable Minimum Storage Merging Algorithm", journal = j-INFO-PROC-LETT, volume = "12", number = "1", pages = "5--8", day = "13", month = feb, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E05", MRnumber = "82a:68115", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C6130 (Data handling techniques)", corpsource = "Inst. of Informatics, Warsaw Univ., Warsaw, Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer systems programming; merging vectors; sorting; stable algorithm; stable minimum storage merging algorithm", treatment = "T Theoretical or Mathematical", } @Article{Lawler:1981:SPO, author = "Eugene L. Lawler and Charles U. Martel", title = "Scheduling Periodically Occurring Tasks on Multiple Processors", journal = j-INFO-PROC-LETT, volume = "12", number = "1", pages = "9--12", day = "13", month = feb, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "90B35 (68B20 68C15)", MRnumber = "82k:90064", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "722; 723; C6150J (Operating systems)", corpsource = "Computer Sci. Div., Univ. of California, Berkeley, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer systems, digital; feasible schedule; linear programming; LP; multiple processors; nonperiodic scheduling; parallel processing; parallel processors; scheduling", treatment = "P Practical", } @Article{Choffrut:1981:CPD, author = "C. Choffrut", title = "A closure property of deterministic context-free languages", journal = j-INFO-PROC-LETT, volume = "12", number = "1", pages = "13--16", day = "13", month = feb, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68F05", MRnumber = "82a:68139", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "UER de Math., Univ. Paris VII, Paris, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "closure property; context-free languages; deterministic context-free languages; free monoid; longest common prefix", treatment = "T Theoretical or Mathematical", } @Article{Tsao:1981:NIB, author = "Nai Kuan Tsao", title = "The numerical instability of {Bini}'s algorithm", journal = j-INFO-PROC-LETT, volume = "12", number = "1", pages = "17--19", day = "13", month = feb, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "65F30", MRnumber = "82i:65029", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See reply \cite{Bini:1982:RPN}.", acknowledgement = ack-nhfb, classification = "723; 921; B0290H (Linear algebra); C4140 (Linear algebra)", corpsource = "Dept. of Computer Sci., Wayne State Univ., Detroit, MI, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "approximate matrix multiplication; Bini's algorithm; complexity algorithm; computer programming --- Subroutines; convergence of numerical methods; mathematical techniques; matrix algebra; matrix multiplication; numerical instability", treatment = "T Theoretical or Mathematical", } @Article{Gabow:1981:LTR, author = "Harold N. Gabow", title = "A linear-time recognition algorithm for interval dags", journal = j-INFO-PROC-LETT, volume = "12", number = "1", pages = "20--22", day = "13", month = feb, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C15", MRnumber = "82b:68030", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C1290 (Applications of systems theory)", corpsource = "Dept. of Computer Sci., Univ. of Colorado, Boulder, CO, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "directed graphs; interval dags; interval orders; linear-time recognition algorithm; partial orders; scheduling; unit-execution-time scheduling problem", treatment = "T Theoretical or Mathematical", } @Article{Denning:1981:MKG, author = "Dorothy E. Denning and Fred B. Schneider", title = "Master keys for group sharing", journal = j-INFO-PROC-LETT, volume = "12", number = "1", pages = "23--25", day = "13", month = feb, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "94B99", MRnumber = "82d:94046", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See also note \cite{Brouwer:1982:NMK}.", acknowledgement = ack-nhfb, classification = "B6120B (Codes)", corpsource = "Computer Sci. Dept., Purdue Univ., W. Lafayette, IN, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "Diffie and Hellman's public-key distribution scheme; encoding; group sharing; master key; Shamir's threshold scheme", treatment = "T Theoretical or Mathematical", } @Article{Hehner:1981:BTS, author = "Eric C. R. Hehner", title = "Bunch theory: a simple set theory for computer science", journal = j-INFO-PROC-LETT, volume = "12", number = "1", pages = "26--30", day = "13", month = feb, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68B05 (03E20 68E99)", MRnumber = "82d:68007", MRreviewer = "P. {\v{S}}t{\v{e}}p{\'a}nek", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic)", corpsource = "Computer Systems Res. Group, Univ. of Toronto, Toronto, Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "computer science; formal languages; set theory; simple set theory", treatment = "T Theoretical or Mathematical", } @Article{Whitesides:1981:AFC, author = "S. H. Whitesides", title = "An algorithm for finding clique cut-sets", journal = j-INFO-PROC-LETT, volume = "12", number = "1", pages = "31--32", day = "13", month = feb, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E10 (05C40)", MRnumber = "82a:68133", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C1160 (Combinatorial mathematics)", corpsource = "Math. Dept., Dartmouth Coll., Hanover, NH, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "clique cut-sets; computer programming; graph theory", treatment = "T Theoretical or Mathematical", } @Article{Hell:1981:GMP, author = "P. Hell and D. G. Kirkpatrick", title = "On generalized matching problems", journal = j-INFO-PROC-LETT, volume = "12", number = "1", pages = "33--35", day = "13", month = feb, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "05C70 (68C25 90C10)", MRnumber = "83i:05059", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics)", corpsource = "Dept. of Math., Rutgers Univ., New Brunswick, NJ, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "augmenting path techniques; duality theorems; generalized matching problems; graph theory; NP-complete; polynomial algorithms", treatment = "T Theoretical or Mathematical", } @Article{Bruynooghe:1981:SCS, author = "M. Bruynooghe", title = "Solving combinatorial search problems by intelligent backtracking", journal = j-INFO-PROC-LETT, volume = "12", number = "1", pages = "36--39", day = "13", month = feb, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C1180 (Optimisation techniques)", corpsource = "Katholieke Univ. Leuven, Heverlee, Belgium", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "AT; combinatorial mathematics; combinatorial problems; combinatorial search problems; intelligent backtracking; optimisation", treatment = "T Theoretical or Mathematical", } @Article{Lloyd:1981:CGS, author = "Errol L. Lloyd", title = "{Coffman--Graham} scheduling of {UET} task systems with $0$-$1$ resources", journal = j-INFO-PROC-LETT, volume = "12", number = "1", pages = "40--45", day = "13", month = feb, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "90B35 (68C25)", MRnumber = "83k:90056", MRreviewer = "M. M. Sys{\l}o", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C1290 (Applications of systems theory)", corpsource = "Lab. for Computer Sci., MIT, Cambridge, MA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "Coffman--Graham scheduling; minimal length nonpreemptive schedules; scheduling; UET task systems", treatment = "T Theoretical or Mathematical", } @Article{Ceri:1981:UBN, author = "S. Ceri and G. Pelagatti", title = "An upper bound on the number of execution nodes for a distributed join", journal = j-INFO-PROC-LETT, volume = "12", number = "1", pages = "46--48", day = "13", month = feb, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation); C6160B (Distributed databases)", corpsource = "Istituto di Elettrotecnica ed Elettronica, Politecnico di Milano, Milano, Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "database management systems; DBMS; distributed databases; distributed join; distributed processing; execution nodes; file organisation", treatment = "T Theoretical or Mathematical", } @Article{Overmars:1981:SPD, author = "Mark H. Overmars and Jan {van Leeuwen}", title = "Some principles for dynamizing decomposable searching problems", journal = j-INFO-PROC-LETT, volume = "12", number = "1", pages = "49--53 (or 49--54??)", day = "13", month = feb, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E05 (90B40)", MRnumber = "82e:68063", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C1180 (Optimisation techniques)", corpsource = "Dept. of Computer Sci., Univ. of Utrecht, Utrecht, Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "dynamization methods; dynamizing decomposable searching problems; number systems; optimisation; query times", treatment = "T Theoretical or Mathematical", } @Article{Hatzopoulos:1981:OPD, author = "M. Hatzopoulos and J. G. Kollias", title = "Optimal policy for database backup and recovery", journal = j-INFO-PROC-LETT, volume = "12", number = "2", pages = "55--58", day = "13", month = apr, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C6160 (Database management systems (DBMS))", corpsource = "Unit of Appl. Math., Univ. of Athens, Athens, Greece", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "backup cycle; database management systems; DBMS; optimal policy; recovery; renewal theory; system recovery", treatment = "P Practical", } @Article{Harland:1981:CLE, author = "D. M. Harland", title = "Concurrency in a language employing messages", journal = j-INFO-PROC-LETT, volume = "12", number = "2", pages = "59--62", day = "13", month = apr, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation); C6140D (High level languages)", corpsource = "Dept. of Computational Sci., Univ. of St. Andrews, St. Andrews, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "concurrency; data structures; data types; dynamic execution; dynamic parallelism; high level languages; language; messages; parallel processing; process; static definitions", treatment = "P Practical", } @Article{Ingemarsson:1981:UAS, author = "Ingemar Ingemarsson and C. K. Wong", title = "A user authentication scheme for shared data based on a trap-door one-way function", journal = j-INFO-PROC-LETT, volume = "12", number = "2", pages = "63--67", day = "13", month = apr, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C6130 (Data handling techniques); C6160 (Database management systems (DBMS))", corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "accessible region; data base systems; database management systems; DBMS; security of data; shared data; trap-door one-way function; user authentication scheme", treatment = "P Practical", xxtitle = "Use Authentication Scheme for Shared Data Based on a Trap-Door One-Way Function", } @Article{Pansiot:1981:MSI, author = "J. J. Pansiot", title = "The {Morse} sequence and iterated morphisms", journal = j-INFO-PROC-LETT, volume = "12", number = "2", pages = "68--70", day = "13", month = apr, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E99 (10K10 28D15 54H20)", MRnumber = "83d:68070", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Centre de Calcul de l'Esplanade, Strasbourg, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "alphabet; binary representation; binary sequences; deletions; formal logic; infinite sequence; insertions; iterated morphisms; mapping; morphisms; Morse sequence", treatment = "T Theoretical or Mathematical", } @Article{Borodin:1981:ESU, author = "A. Borodin and L. J. Guibas and N. A. Lynch and A. C. Yao", title = "Efficient searching using partial ordering", journal = j-INFO-PROC-LETT, volume = "12", number = "2", pages = "71--75", day = "13", month = apr, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E05", MRnumber = "82j:68043", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation)", corpsource = "Univ. of Toronto, Toronto, Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "Dilworth's theorem; information retrieval; membership query; pairwise comparisons; partial ordering; preprocessing cost; query; search cost; sorting", treatment = "P Practical", } @Article{Schnorr:1981:HMP, author = "C. P. Schnorr", title = "How many polynomials can be approximated faster than they can be evaluated?", journal = j-INFO-PROC-LETT, volume = "12", number = "2", pages = "76--78", day = "13", month = apr, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "12-04 (68C25)", MRnumber = "82g:12002", MRreviewer = "Maurice Mignotte", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4120 (Functional analysis); C4130 (Interpolation and function approximation); C4240 (Programming and algorithm theory)", corpsource = "Fachbereich Math., Univ. Frankfurt, Frankfurt, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "algebraic complexity; canonical computation; computational complexity; function evaluation; polynomials; universal sets; Zariski closed fields", treatment = "T Theoretical or Mathematical", } @Article{Jaffar:1981:PAA, author = "Joxan Jaffar", title = "Presburger arithmetic with array segments", journal = j-INFO-PROC-LETT, volume = "12", number = "2", pages = "79--82", day = "13", month = apr, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C30", MRnumber = "83g:68072", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Computer Sci., Univ. of Melbourne, Parkville, Vic., Australia", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "array indices; array segments; computability and decidability; decision procedures; formal languages; merging; Presburger arithmetic", treatment = "T Theoretical or Mathematical", } @Article{Steinberg:1981:LSE, author = "David Steinberg and Michael Rodeh", title = "A layout for the shuffle-exchange network with {$\Theta(N^2\log N)$} area", journal = j-INFO-PROC-LETT, volume = "12", number = "2", pages = "83--88", day = "13", month = apr, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68B20", MRnumber = "82d:68020", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "B1130 (General circuit analysis and synthesis methods); B1265 (Digital electronics)", corpsource = "Dept. of Appl. Math., Weizmann Inst., Rehovot, Israel", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "bisection; circuit layout; interconnection networks; large scale integration; network synthesis; permutation networks; shuffle-exchange network; VLSI", treatment = "P Practical", } @Article{Shiloach:1981:ALD, author = "Yossi Shiloach", title = "Another look at the degree constrained subgraph problem", journal = j-INFO-PROC-LETT, volume = "12", number = "2", pages = "89--92", day = "13", month = apr, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "05C70 (05C35)", MRnumber = "82e:05109", MRreviewer = "Charles H. C. Little", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics)", corpsource = "IBM Israel Sci. Center, Haifa, Israel", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "alternating path technique; combinatorial approach; degree constrained subgraph problem; edge-coloring problems; edge-partitioning problem; graph theory; linear programming; regular maximum matching problem", treatment = "T Theoretical or Mathematical", } @Article{Mehlhorn:1981:ODD, author = "Kurt Mehlhorn and Mark H. Overmars", title = "Optimal dynamization of decomposable searching problems", journal = j-INFO-PROC-LETT, volume = "12", number = "2", pages = "93--98", day = "13", month = apr, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E05", MRnumber = "82d:68043", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation); C6160 (Database management systems (DBMS))", corpsource = "Univ. des Saarlandes, Saarbrucken, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "data structures; database management systems; DBMS; decomposable searching problems; information retrieval; optimal dynamization", treatment = "P Practical", } @Article{Overmars:1981:GMA, author = "Mark H. Overmars", title = "General methods for ``all elements'' and ``all pairs'' problems", journal = j-INFO-PROC-LETT, volume = "12", number = "2", pages = "99--102", day = "13", month = apr, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E05", MRnumber = "82d:68044", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation); C6160 (Database management systems (DBMS))", corpsource = "Dept. of Computer Sci., Univ. of Utrecht, Utrecht, Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "all elements problem; all pairs problem; data structures; database management systems; DBMS; information retrieval; searching problems", treatment = "P Practical", } @Article{Micali:1981:TWD, author = "Silvio Micali", title = "Two-way deterministic finite automata are exponentially more succinct than sweeping automata", journal = j-INFO-PROC-LETT, volume = "12", number = "2", pages = "103--105", day = "13", month = apr, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25 (03D05 68C40)", MRnumber = "82d:68034", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4220 (Automata theory)", corpsource = "Univ. of California, Berkeley, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "complexity; finite automata; formal languages; head motion; input tape; nondeterminism; size of description; sweeping automata; two way deterministic finite automata", treatment = "T Theoretical or Mathematical", } @Article{Tompa:1981:EST, author = "Martin Tompa", title = "An extension of {Savitch}'s theorem to small space bounds", journal = j-INFO-PROC-LETT, volume = "12", number = "2", pages = "106--108", day = "13", month = apr, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25 (03D15 68C40)", MRnumber = "82d:68035", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory)", corpsource = "Dept. of Computer Sci., Univ. of Washington, Seattle, WA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "alternating Turing machines; nondeterministic space bounds; Savitch's theorem; small space bounds; Turing machines", } @Article{Petreschi:1981:ESA, author = "R. Petreschi and B. Simeone", title = "Erratum: {``A switching algorithm for the solution of quadratic {Boolean} equations''}", journal = j-INFO-PROC-LETT, volume = "12", number = "2", pages = "109--109", day = "13", month = apr, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25 (03G05 90C20 94C10)", MRnumber = "82e:68044b", bibdate = "Sat Apr 11 12:24:20 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See \cite{Petreschi:1980:SAS}.", acknowledgement = ack-nhfb, fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", } @Article{Courcelle:1981:SAT, author = "Bruno Courcelle", title = "The simultaneous accessibility of two configurations of two equivalent {DPDAs}", journal = j-INFO-PROC-LETT, volume = "12", number = "3", pages = "111--114", day = "13", month = jun, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68D15 (68F10)", MRnumber = "82i:68034", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "721; C4220 (Automata theory)", corpsource = "UER de Math. et d'Informatique, Univ. de Bordeaux I, Talence, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "alternate stacking methods; automata theory; deterministic automata; deterministic pushdown automata; equivalence; simultaneous accessibility", treatment = "T Theoretical or Mathematical", } @Article{Peterson:1981:MAM, author = "G. L. Peterson", title = "Myths about the mutual exclusion problem", journal = j-INFO-PROC-LETT, volume = "12", number = "3", pages = "115--116", day = "13", month = jun, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4290 (Other computer theory)", corpsource = "Dept. of Computer Sci., Univ. of Rochester, Rochester, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "busy-waiting; deadlock; mutual exclusion problem; parallelism; protocols; queueing theory", treatment = "T Theoretical or Mathematical", } @Article{Leland:1981:HDG, author = "W. Leland and R. Finkel and Li Qiao and M. Solomon and L. Uhr", title = "High density graphs for processor interconnection", journal = j-INFO-PROC-LETT, volume = "12", number = "3", pages = "117--120", day = "13", month = jun, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C5620 (Computer networks and techniques)", corpsource = "Computer Sci. Dept., Univ. of Wisconsin, Madison, WI, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "computer networks; full duplex; graph theory; high density graphs; interconnection graph; processor interconnection; vertex", treatment = "T Theoretical or Mathematical", } @Article{Book:1981:UWP, author = "Ronald V. Book", title = "The undecidability of a word problem: on a conjecture of {Strong}, {Maggiolo-Schettini} and {Rosen}", journal = j-INFO-PROC-LETT, volume = "12", number = "3", pages = "121--122", day = "13", month = jun, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "03D03 (03D40 68C25)", MRnumber = "82h:03035", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Math., Univ. of California, Santa Barbara, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "computability and decidability; DOS systems; formal languages; programs; recursion structure; recursive procedure calls; restricted finite Thue systems; substitutions; undecidability; word problem", treatment = "T Theoretical or Mathematical", } @Article{Lischke:1981:TTP, author = "Gerhard Lischke", title = "Two types of properties for complexity measures", journal = j-INFO-PROC-LETT, volume = "12", number = "3", pages = "123--126", day = "13", month = jun, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25 (03D15 68C30)", MRnumber = "82f:68050", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Sektion Math., Friedrich-Schiller-Univ. Jena, Jena, East Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "complexity measures; computational complexity; Godel numbering; partial recursive functions; step counting functions", treatment = "T Theoretical or Mathematical", } @Article{Wilhelm:1981:MTT, author = "Reinhard Wilhelm", title = "A modified tree-to-tree correction problem", journal = j-INFO-PROC-LETT, volume = "12", number = "3", pages = "127--132", day = "13", month = jun, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25 (68C05)", MRnumber = "83a:68060", MRreviewer = "Henry S. Warren, Jr.", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic)", corpsource = "Univ. des Saarlandes, Saarbrucken, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "complexity; formal languages; labels; minimum cost tree mapping; tree-to-tree correction problem; trees (mathematics)", treatment = "T Theoretical or Mathematical", } @Article{Fowler:1981:OPC, author = "Robert J. Fowler and Michael S. Paterson and Steven L. Tanimoto", title = "Optimal packing and covering in the plane are {NP}-complete", journal = j-INFO-PROC-LETT, volume = "12", number = "3", pages = "133--137", day = "13", month = jun, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "05C99 (05B40 52-04 52A45 68C25 68G10)", MRnumber = "82e:05112", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "713; 714; 723; 913; C1160 (Combinatorial mathematics); C4290 (Other computer theory); C6160 (Database management systems (DBMS))", corpsource = "Dept. of Computer Sci., Univ. of Washington, Seattle, WA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "combinatorial problems; computation theory; computer graphics; computer metatheory; covering; database management systems; databases; fixed-size rectangles; graph theory; image processing; integrated circuits --- Computer Aided Design; intersection graph; NP completeness; packing; scheduling; silicon chip", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Jaromczyk:1981:LDT, author = "Jerzy W. Jaromczyk", title = "Linear decision trees are too weak for convex hull problem", journal = j-INFO-PROC-LETT, volume = "12", number = "3", pages = "138--141", day = "13", month = jun, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "52-04 (52A99 68C25)", MRnumber = "82j:52001", MRreviewer = "Klaus Lommatzsch", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4290 (Other computer theory)", corpsource = "Inst. of Informatics, Warsaw Univ., Warsaw, Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "computational geometry; convex hull problem; convexity property; linear decision-tree model; trees (mathematics)", treatment = "T Theoretical or Mathematical", } @Article{Bertoni:1981:ECC, author = "Alberto Bertoni and Giancarlo Mauri", title = "On Efficient Computation of the Coefficients of Some Polynomials with Applications to Some Enumeration Problems", journal = j-INFO-PROC-LETT, volume = "12", number = "3", pages = "142--145", day = "13", month = jun, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25 (03D05 05A15)", MRnumber = "82i:68026", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "921; C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "Istituto di Cibernetica, Univ. di Milano, Milano, Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "abstract data types; complexity; computational complexity; data structures; efficient computation; enumeration problems; mathematical techniques; polynomials; Turing machine; Turing machines", treatment = "T Theoretical or Mathematical", } @Article{Erni:1981:TTC, author = "W. Erni and R. Lapsien", title = "On the time and tape complexity of weak unification", journal = j-INFO-PROC-LETT, volume = "12", number = "3", pages = "146--150", day = "13", month = jun, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25 (03B35 03D15 68G15)", MRnumber = "82f:68047", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C1230 (Artificial intelligence); C4220 (Automata theory)", corpsource = "Inst. f{\"u}r Angewandte Math., Univ. Heidelberg, Heidelberg, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "algorithm analysis; automata theory; computational complexity; deterministic automata; deterministic Turing machine; deterministic two-way push-down automaton; finite tree; formal languages; random access machine; single input head; tape complexity; theorem proving; time complexity; trees (mathematics); Turing machines; weak unification", treatment = "T Theoretical or Mathematical", } @Article{Ancilotti:1981:ISS, author = "P. Ancilotti and M. Boari", title = "Information Streams Sharing a Finite Buffer: Protection Problems", journal = j-INFO-PROC-LETT, volume = "12", number = "3", pages = "151--159", day = "13", month = jun, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "712; 723; B6210L (Computer communications); C5610 (Computer interfaces)", corpsource = "Istituto per l'Elaborazione dell'Informazione, CNR, Pisa, Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "access control mechanism; computer interfaces; computer systems, digital; finite buffer; information streams; mutual exclusion; parallelism; protection problems; protocols; reliability problem; structure", treatment = "T Theoretical or Mathematical", } @Article{Preparata:1981:TSP, author = "Franco P. Preparata and Kenneth J. Supowit", title = "Testing a simple polygon for monotonicity", journal = j-INFO-PROC-LETT, volume = "12", number = "4", pages = "161--164", day = "13", month = aug, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C05 (51M20)", MRnumber = "83d:68028", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Coordinated Sci. Lab., Univ. of Illinois, Urbana, IL, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "algorithm theory; analysis of algorithms; computational geometry; geometry; monotonicity; polygon; time solution", treatment = "T Theoretical or Mathematical", } @Article{Eastman:1981:OBS, author = "C. M. Eastman", title = "Optimal bucket size for nearest neighbor searching in $k$-$d$ trees", journal = j-INFO-PROC-LETT, volume = "12", number = "4", pages = "165--167", day = "13", month = aug, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68B15 (05-04 05C05 68C25)", MRnumber = "83a:68021", MRreviewer = "Selim G. Akl", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory); C6120 (File organisation); C6160 (Database management systems (DBMS))", corpsource = "Dept. of Math. and Computer Sci., Florida State Univ., Tallahassee, FL, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "$k$-$d$ trees; data management; database management systems; file organisation; file processing; multikey searching; nearest neighbor searching; optimal bucket size; programming theory; trees (mathematics)", treatment = "T Theoretical or Mathematical", } @Article{Overmars:1981:WOI, author = "M. H. Overmars and J. {van Leeuwen}", title = "Worst-case optimal insertion and deletion methods for decomposable searching problems", journal = j-INFO-PROC-LETT, volume = "12", number = "4", pages = "168--173", day = "13", month = aug, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6120 (File organisation)", corpsource = "Dept. of Computer Sci., Univ. of Utrecht, Utrecht, Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "data structures; decomposable searching problems; deletion methods; dynamic solutions; dynamizations; nearest neighbor searching; programming theory; range querying; worst case optimal insertion", treatment = "P Practical", } @Article{Frougny:1981:SDN, author = "C. Frougny", title = "Simple deterministic {NTS} languages", journal = j-INFO-PROC-LETT, volume = "12", number = "4", pages = "174--178", day = "13", month = aug, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Univ. de Picardie, Amiens, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "Alg; context free languages; context-free languages; deterministic NTS languages; expansive language; IRS", treatment = "T Theoretical or Mathematical", } @Article{Meijer:1981:NCM, author = "H. Meijer", title = "A note on {``A cryptosystem for multiple communication''} {[Inform. Process. Lett. {\bf 10}(4--5), 5 July 1980, pp. 180--183]}", journal = j-INFO-PROC-LETT, volume = "12", number = "4", pages = "179--181", day = "13", month = aug, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See \cite{Luccio:1980:CMC,Hellman:1981:ACA}.", acknowledgement = ack-nhfb, classification = "B6120B (Codes)", corpsource = "Dept. of Math. and Statistics, Queen's Univ., Kingston, Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "cryptography; cryptosystem; cyphertext; data communication systems; multiple communication; node; plain-text attack; secret messages; security", treatment = "T Theoretical or Mathematical", } @Article{Hellman:1981:ACA, author = "M. E. Hellman", title = "Another cryptanalytic attack on {``A cryptosystem for multiple communication''} {[Inform. Process. Lett. {\bf 10}(4--5), 5 July 1980, pp. 180--183]}", journal = j-INFO-PROC-LETT, volume = "12", number = "4", pages = "182--183", day = "13", month = aug, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See \cite{Luccio:1980:CMC,Meijer:1981:NCM}.", acknowledgement = ack-nhfb, classification = "B6120B (Codes)", corpsource = "Dept. of Electrical Engng., Stanford Univ., Stanford, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "authentification; cryptography; cryptosystem; data communication systems; multiple communication; plain text attack; security; text attack", treatment = "T Theoretical or Mathematical", } @Article{Ottmann:1981:SGF, author = "T. Ottmann and A. Salomaa and D. Wood", title = "Sub-regular grammar forms", journal = j-INFO-PROC-LETT, volume = "12", number = "4", pages = "184--187", day = "13", month = aug, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Inst. f{\"u}r Angewandte Informatik und Formale Beschreibungsverfahren, Univ. Karlsruhe, Karlsruhe, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "closure operations; computability and decidability; decidable; form equivalence; grammars; grammatical family; regular set; sub regular grammatical families; unambiguous grammar form", treatment = "T Theoretical or Mathematical", } @Article{Semba:1981:GAB, author = "Ichir\=o Semba", title = "Generation of all the balanced parenthesis strings in lexicographical order", journal = j-INFO-PROC-LETT, volume = "12", number = "4", pages = "188--192", day = "13", month = aug, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "05A05 (68C05)", MRnumber = "83e:05008", MRreviewer = "E. Rodney Canfield", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic)", corpsource = "Dept. of Pure and Appl. Sci., Coll. of General Education, Univ. of Tokyo, Tokyo, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "balanced parenthesis strings; combinatorial mathematics; computational linguistics; lexicographical order", treatment = "T Theoretical or Mathematical", } @Article{deLuca:1981:CPF, author = "Aldo {de Luca}", title = "A combinatorial property of the {Fibonacci} words", journal = j-INFO-PROC-LETT, volume = "12", number = "4", pages = "193--195", day = "??", month = "????", year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "05A99 (20M05)", MRnumber = "84i:05023", bibdate = "Sat Apr 11 12:24:20 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", } @Article{Hehner:1981:IPV, author = "E. C. R. Hehner and R. K. Shyamasundar", title = "An implementation of {$P$} and {$V$}", journal = j-INFO-PROC-LETT, volume = "12", number = "4", pages = "196--198", day = "13", month = aug, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Computer Systems Res. Group, Univ. of Toronto, Toronto, Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "concurrent processes; multiprocessing systems; mutual exclusion; programming theory; protocols; semaphore operations; synchronization", treatment = "T Theoretical or Mathematical", } @Article{Maier:1981:HB, author = "D. Maier and S. C. Salveter", title = "Hysterical {$B$}-trees", journal = j-INFO-PROC-LETT, volume = "12", number = "4", pages = "199--202", day = "13", month = aug, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic); C6120 (File organisation)", corpsource = "Computer Sci. Dept., State Univ. of New York, Stony Brook, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "algorithm complexity; data structures; deletes; hysterical B trees; indexing; inserts; merges; splits; trees (mathematics)", treatment = "T Theoretical or Mathematical", } @Article{Papadimitriou:1981:MEG, author = "Christos H. Papadimitriou and Mihalis Yannakakis", title = "On minimal {Eulerian} graphs", journal = j-INFO-PROC-LETT, volume = "12", number = "4", pages = "203--205", day = "13", month = aug, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "90C08 (05C35 05C45)", MRnumber = "83a:90103", MRreviewer = "Claude Benzaken", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C1180 (Optimisation techniques); C1290 (Applications of systems theory)", corpsource = "Lab. for Computer Sci., MIT, Cambridge, MA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "graph theory; mathematical programming; minimal Eulerian graphs; minimisation; NP completion; operations research; travelling salesman problem", treatment = "T Theoretical or Mathematical", } @Article{Iri:1981:LTA, author = "Masao Iri and Kazuo Murota and Shouichi Matsui", title = "Linear-Time Approximation Algorithms for Finding the Minimum-Weight Perfect Matching on a Plane", journal = j-INFO-PROC-LETT, volume = "12", number = "4", pages = "206--209", day = "13", month = aug, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25 (05C70 68C05 90C10)", MRnumber = "83e:68035", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C1160 (Combinatorial mathematics); C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Math. Engng. and Instrumentation Phys., Univ. of Tokyo, Hongo, Bunkyo-ku, Tokyo, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "approximation algorithms; computational complexity; computer programming; graph theory; graphics; matched points; minimum-weight perfect matching; Monte Carlo methods; plane", treatment = "T Theoretical or Mathematical", } @Article{Mauney:1981:IIE, author = "J. Mauney and C. N. Fischer", title = "An improvement to immediate error detection in {Strong LL(1)} parsers", journal = j-INFO-PROC-LETT, volume = "12", number = "5", pages = "211--212", day = "13", month = oct, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "721; C4210 (Formal logic)", corpsource = "Univ. of Wisconsin-Madison, Madison, WI, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; error detection; grammars; LL(1) parsers; parsing; Strong LL(1) grammars", treatment = "T Theoretical or Mathematical", } @Article{Konneker:1981:NHD, author = "Lloyd K. Konneker and Yaakov L. Varol", title = "A note on heuristics for dynamic organization of data structures", journal = j-INFO-PROC-LETT, volume = "12", number = "5", pages = "213--216", day = "13", month = oct, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C6120 (File organisation)", corpsource = "Dept. of Computer Sci., Southern Illinois Univ., Carbondale, IL, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "access; data processing; data structures; dependence; dynamic organization; heuristics; search algorithm; self organising structures; simulation results", treatment = "P Practical", } @Article{Snir:1981:CSQ, author = "M. Snir", title = "On the complexity of simplifying quadratic forms", journal = j-INFO-PROC-LETT, volume = "12", number = "5", pages = "217--220", day = "13", month = oct, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25 (15A63)", MRnumber = "83d:68045", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Dept. of Computer Sci., New York Univ., New York, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "Boolean functions; complexity; computational complexity; evaluation; minimal number; multiplications; NP-hard; polynomials; positive coefficients; quadratic forms", treatment = "T Theoretical or Mathematical", } @Article{Harland:1981:FIC, author = "David M. Harland", title = "On Facilities for Interprocess Communication", journal = j-INFO-PROC-LETT, volume = "12", number = "5", pages = "221--226", day = "13", month = oct, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "722; 723; C6150J (Operating systems)", corpsource = "Dept. of Computational Sci., Univ. of St. Andrews, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "communication facilities; computer systems, digital; computers, digital --- Data Communication Systems; computing system; deadlock; interprocess communication; message passing mechanism; operating systems (computers); OS; parallel processing; parallelism", treatment = "P Practical", } @Article{Ibarra:1981:PAS, author = "Oscar H. Ibarra and Shlomo Moran and Louis E. Rosier", title = "Probabilistic Algorithms and Straight-Line Programs for Some Rank Decision Problems", journal = j-INFO-PROC-LETT, volume = "12", number = "5", pages = "227--232", day = "13", month = oct, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C05 (15A54 90C20)", MRnumber = "82m:68068", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; 922; B0290H (Linear algebra); C4140 (Linear algebra)", corpsource = "Computer Sci. Dept., Inst. of Technol., Univ. of Minnesota, Minneapolis, MN, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "addition; arithmetic expressions; computer programming --- Subroutines; decision theory and analysis; exponentiation; mathematical techniques --- Matrix Algebra; matrices; matrix algebra; multiplication; parenthesization; polynomial entries; polynomials; positive integer constants; probabilistic algorithms; rank decision problems; straight-line programs; subtraction", treatment = "T Theoretical or Mathematical", } @Article{Pansiot:1981:NPC, author = "J.-J. Pansiot", title = "A note on {Post}'s correspondence problem", journal = j-INFO-PROC-LETT, volume = "12", number = "5", pages = "233--233", day = "13", month = oct, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "03D03 (03D40 68C30)", MRnumber = "83h:03054", MRreviewer = "Michael Anshel", bibdate = "Sat Apr 11 12:24:20 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", } @Article{Huang:1981:AIP, author = "Bing Chao Huang", title = "An algorithm for inverting a permutation", journal = j-INFO-PROC-LETT, volume = "12", number = "5", pages = "237--238", day = "13", month = oct, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; B0290H (Linear algebra); C4140 (Linear algebra)", corpsource = "Dept. of Computer Sci., Jilin Univ., Changchun, China", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer programming; inverse; matrix algebra; permutation; permutations", treatment = "T Theoretical or Mathematical", } @Article{Winkowski:1981:PAO, author = "Jozef Winkowski", title = "Protocols of Accessing Overlapping Sets of Resources", journal = j-INFO-PROC-LETT, volume = "12", number = "5", pages = "239--243", day = "13", month = oct, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "722; 723; C6150J (Operating systems)", corpsource = "Inst. Podstaw Informatyki, PAN, Warszawa, Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer systems, digital; deadlock; fairness; indivisible operations; local communication; operating systems (computers); overlapping sets; protocols; resource accessing; resources; sequential processes", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Crochemore:1981:OAC, author = "Max Crochemore", title = "An optimal algorithm for computing the repetitions in a word", journal = j-INFO-PROC-LETT, volume = "12", number = "5", pages = "244--250", day = "13", month = oct, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C05 (05A05)", MRnumber = "83j:68035", MRreviewer = "Eugene Levner", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Lab. d'Informatique, Univ. de Haute-Normandie, Mont-Saint-Aignan, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "formal languages; optimal algorithm; primitive factors; repetitions; word", treatment = "T Theoretical or Mathematical", } @Article{Vardi:1981:DPD, author = "M. Y. Vardi", title = "The decision problem for database dependencies", journal = j-INFO-PROC-LETT, volume = "12", number = "5", pages = "251--254", day = "13", month = oct, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "03D35 (68H05)", MRnumber = "84a:03047", MRreviewer = "George Tourlakis", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C4210 (Formal logic); C6160 (Database management systems (DBMS))", corpsource = "Dept. of Appl. Math., Weizmann Inst. of Sci., Rehovot, Israel", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "data base systems; database dependencies; database management systems; DBMS; decision problem; formal logic; sentence", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Ebert:1981:STC, author = "J{\"u}rgen Ebert", title = "A sensitive transitive closure algorithm", journal = j-INFO-PROC-LETT, volume = "12", number = "5", pages = "255--258", day = "13", month = oct, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C05 (05C20 68E10)", MRnumber = "83e:68023", MRreviewer = "M. C. Golumbic", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics)", corpsource = "Univ. Osnabruck, Osnabruck, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer programming; directed graph; directed graphs; non-null path; reachability; sensitive transitive closure algorithm; transitive closure problem", treatment = "T Theoretical or Mathematical", } @Article{Watanabe:1981:FAF, author = "Osamu Watanabe", title = "A fast algorithm for finding all shortest paths", journal = j-INFO-PROC-LETT, volume = "13", number = "1", pages = "1--3", day = "??", month = oct, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E10 (05C38 90B10 90C35)", MRnumber = "83c:68084", bibdate = "Sat Apr 11 12:24:20 MDT 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; 921", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer programming; mathematical techniques --- Graph Theory", } @Article{Lewis:1981:ECF, author = "Gilbert N. Lewis and Nancy J. Boynton and F. Warren Burton", title = "Expected Complexity of Fast Search with Uniformly Distributed Data", journal = j-INFO-PROC-LETT, volume = "13", number = "1", pages = "4--7", day = "27", month = oct, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E05 (68C25)", MRnumber = "83c:68068", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C4100 (Numerical analysis); C4240 (Programming and algorithm theory)", corpsource = "Dept. of math. and Computer Sci., Michigan Technol. Univ., Houghton, MI, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "complexity; computational complexity; computer programming; fast search; interpolation; probability; uniform distribution; uniformly distributed data", treatment = "T Theoretical or Mathematical", } @Article{Storer:1981:CFS, author = "James A. Storer", title = "Constructing Full Spanning Trees for Cubic Graphs", journal = j-INFO-PROC-LETT, volume = "13", number = "1", pages = "8--11", day = "27", month = oct, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E10 (05C05)", MRnumber = "83d:68068", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; 921; B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics); C4210 (Formal logic)", corpsource = "Bell Labs., Murray Hill, NJ, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "circuit layout; communications networks; computer programming; cubic graphs; full spanning trees; graph theoretic problems; graph theory; internal nodes; leaves; mathematical techniques --- Graph Theory; trees (mathematics)", treatment = "T Theoretical or Mathematical", } @Article{Ibarra:1981:DPA, author = "Oscar H. Ibarra and Shlomo Moran", title = "Deterministic and probabilistic algorithms for maximum bipartite matching via fast matrix multiplication", journal = j-INFO-PROC-LETT, volume = "13", number = "1", pages = "12--15", day = "27", month = oct, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E10 (05-04 05C70 68C25)", MRnumber = "83c:68075", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "B0240Z (Other topics in statistics); B0250 (Combinatorial mathematics); B0290H (Linear algebra); C1140Z (Other topics in statistics); C1160 (Combinatorial mathematics); C4140 (Linear algebra); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Computer Sci., Univ.of Minnesota, Minneapolis, MN, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "complexity; computational complexity; deterministic algorithms; fast matrix multiplication; graph theory; matrix algebra; maximum bipartite matching; nonsingular square submatrix; probabilistic algorithms; probability", treatment = "T Theoretical or Mathematical", } @Article{Korsh:1981:GBS, author = "James F. Korsh", title = "Greedy Binary Search Trees are Nearly Optimal", journal = j-INFO-PROC-LETT, volume = "13", number = "1", pages = "16--19", day = "27", month = oct, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E05 (05C05 68C05)", MRnumber = "83e:68080", MRreviewer = "Eberhard L{\"u}dde", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C4210 (Formal logic)", corpsource = "School of Business Administration, Temple Univ., Philadelphia, PA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "binary search trees; computer programming; greedy search tree; probability; trees (mathematics)", treatment = "T Theoretical or Mathematical", } @Article{Agrawala:1981:OSR, author = "A. K. Agrawala and S. K. Tripathi", title = "On the optimality of semidynamic routing schemes", journal = j-INFO-PROC-LETT, volume = "13", number = "1", pages = "20--22", day = "27", month = oct, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C1140Z (Other topics in statistics); C1180 (Optimisation techniques); C1290F (Systems theory applications in industry)", corpsource = "Dept. of Computer Sci., Univ. of Maryland, College Park, MD, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "deterministic techniques; operations research; optimality; optimisation; queueing theory; resource allocation; semidynamic routing schemes; stochastic processes; stochastic rules", treatment = "T Theoretical or Mathematical", } @Article{Ramamohanarao:1981:HAT, author = "K. Ramamohanarao and R. Sacks-Davis", title = "Hardware Address Translation for Machines with a Large Virtual Memory", journal = j-INFO-PROC-LETT, volume = "13", number = "1", pages = "23--29", day = "27", month = oct, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation)", corpsource = "Dept. of Computer Sci., Univ. of Melbourne, Parkville, Vic., Australia", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "address translation; computer systems programming; file organisation; hardware address translation; indexing; machines; virtual memory; virtual storage", treatment = "A Application", } @Article{Senizergues:1981:NCC, author = "G. Senizergues", title = "A new class of {C.F.L.} for which the equivalence is decidable", journal = j-INFO-PROC-LETT, volume = "13", number = "1", pages = "30--34", day = "27", month = oct, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68F05", MRnumber = "83j:68090", MRreviewer = "S. A. Greibach", bibdate = "Sat Apr 11 12:24:20 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", } @Article{Gunn:1981:DCP, author = "Hamish I. E. Gunn and David M. Harland", title = "Degrees of Constancy in Programming Languages", journal = j-INFO-PROC-LETT, volume = "13", number = "1", pages = "35--38", day = "27", month = oct, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C6140D (High level languages)", corpsource = "Dept. of Computational Sci., Univ. of St.Andrews, Fife, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer programming languages; constancy; dynamic type checking; high level languages; programming languages; static checking", treatment = "A Application", } @Article{Stoyan:1981:APR, author = "Yu. G. Stoyan and S. V. Smelyakov", title = "An approach to the problems of routing optimization in the regions of intricate shape", journal = j-INFO-PROC-LETT, volume = "13", number = "1", pages = "39--43", day = "27", month = oct, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "B0260 (Optimisation techniques); C1180 (Optimisation techniques); C4240 (Programming and algorithm theory)", corpsource = "Inst. of Machine-Building Problems, Acad. of Sci., Kharkov, Ukrainian SSR, USSR", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "computational complexity; computer-oriented model; intricate shape; optimisation; optimization; routing", treatment = "A Application; T Theoretical or Mathematical", } @Article{Clerbout:1981:IDM, author = "Mireille Clerbout and Michel Latteux", title = "The inclusion of {D0L} in {MULTI-RESET}", journal = j-INFO-PROC-LETT, volume = "13", number = "2", pages = "45--47", day = "13", month = nov, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68D22", MRnumber = "83a:68069", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Univ. des Sci. et Tech. de Lille, Villeneuve d'Ascq, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "context sensitive languages; D0L; formal languages; L-systems; multi-reset", treatment = "P Practical", } @Article{Makarov:1981:UDS, author = "O. M. Makarov", title = "Using duality for the synthesis of an optimal algorithm involving matrix multiplication", journal = j-INFO-PROC-LETT, volume = "13", number = "2", pages = "48--49", day = "13", month = nov, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25 (65F30)", MRnumber = "83h:68061", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4140 (Linear algebra); C4240 (Programming and algorithm theory)", corpsource = "Inst. of Biology of the South Seas, Sevastopol, Ukrainian SSR, USSR", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "bilinear forms; computational complexity; duality; duality (mathematics); matrix algebra; matrix multiplication; multiplicative complexity; noncommutative ring; optimal algorithm", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Hood:1981:RQO, author = "R. Hood and R. Melville", title = "Real-time queue operations in {Pure LISP}", journal = j-INFO-PROC-LETT, volume = "13", number = "2", pages = "50--54", day = "13", month = nov, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C6140D (High level languages)", corpsource = "Dept. of Computer Sci., Cornell Univ., Ithaca, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "Delete; Insert; LISP; list; Pure LISP; Query; queue operations; queueing theory; recopying", treatment = "P Practical", } @Article{Atallah:1981:ABL, author = "Mikhail J. Atallah and S. Rao Kosaraju", title = "An adversary-based lower bound for sorting", journal = j-INFO-PROC-LETT, volume = "13", number = "2", pages = "55--57", day = "13", month = nov, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E05", MRnumber = "83a:68077", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6130 (Data handling techniques)", corpsource = "Dept. of Electrical Engng., Johns Hopkins Univ., Baltimore, MD, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "adversary-based lower bound; Omega(n log n) lower bound; programming theory; sorting", treatment = "P Practical", } @Article{Rytter:1981:DSR, author = "Wojciech Rytter", title = "The dynamic simulation of recursive and stack manipulating programs", journal = j-INFO-PROC-LETT, volume = "13", number = "2", pages = "58--63", day = "13", month = nov, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Inst. of Informatics, Warsaw Univ., Warsaw, Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computational complexity; computer programming; dynamic simulation; program transformation; programming theory; recursive programs; stack; stack manipulating programs; time complexity", treatment = "P Practical", } @Article{Regnier:1981:AHT, author = "Mireille Regnier", title = "On the Average Height of Trees in Digital Search and Dynamic Hashing", journal = j-INFO-PROC-LETT, volume = "13", number = "2", pages = "64--66", day = "13", month = nov, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E05", MRnumber = "83a:68078", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", abstract = "Keys over a binary alphabet can be organized in digital search trees, also called tries, permitting fast retrieval and updating of information. A result is proved relative to digital search trees in which profiles of size at most b are stored sequentially in a single leaf.", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6120 (File organisation)", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm analysis; average height; computer programming; data management; digital search; dynamic hashing; file organisation; programming theory; subfiles; trees; trees (mathematics)", treatment = "P Practical", } @Article{SilvaFilho:1981:OCD, author = "Ysmar V. {Silva Filho}", title = "Optimal Choice of Discriminators in a Balanced $k$-$d$ Binary Search Tree", journal = j-INFO-PROC-LETT, volume = "13", number = "2", pages = "67--70", day = "13", month = nov, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E05 (05C05 68B15)", MRnumber = "83b:68074", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory); C6160 (Database management systems (DBMS))", corpsource = "Nucleo de Computacao Eletronica, Univ. Federal do Rio de Janeiro, Rio de Janeiro, Brazil", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer programming; cycling; data base systems; database management systems; DBMS; discriminators; K-D binary search tree; leaf-blocks; programming theory; trees (mathematics)", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Pan:1981:LBA, author = "V. Ya. Pan", title = "The lower bounds on the additive complexity of bilinear problems in terms of some algebraic quantities", journal = j-INFO-PROC-LETT, volume = "13", number = "2", pages = "71--72", day = "13", month = nov, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25 (12-04 68C20)", MRnumber = "83g:68066", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Inst. of Advanced Study, Princeton, NJ, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "additive complexity; algebraic computational complexity; algebraic quantities; bilinear problems; computational complexity; tensor rank", treatment = "T Theoretical or Mathematical", } @Article{Book:1981:NGC, author = "Ronald V. Book", title = "{NTS} grammars and {Church--Rosser} systems", journal = j-INFO-PROC-LETT, volume = "13", number = "2", pages = "73--76", day = "13", month = nov, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68F05 (03D03 03D05)", MRnumber = "83d:68071", MRreviewer = "Lutz Priese", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Math., Univ. of California, Santa Barbara, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "Church--Rosser systems; congruence classes; finite Thue systems; finite union; grammars; NTS grammars", treatment = "T Theoretical or Mathematical", } @Article{Vitter:1981:SMS, author = "J. S. Vitter", title = "A Shared-Memory Scheme for Coalesced Hashing", journal = j-INFO-PROC-LETT, volume = "13", number = "2", pages = "77--79", day = "13", month = nov, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Mon Jan 22 17:13:14 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", } @Article{Nakamura:1981:SRO, author = "Akira Nakamura", title = "Some Remarks on One-Pebble Rectangular Array Acceptors", journal = j-INFO-PROC-LETT, volume = "13", number = "2", pages = "80--84", day = "13", month = nov, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68D35", MRnumber = "83g:68084", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C4220 (Automata theory)", corpsource = "Dept. of Appl. Math., Hiroshima Univ., Hiroshima, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "array languages; automata theory; formal models; one-pebble rectangular array acceptors; pattern recognition systems; picture recognition; two dimensional automata", treatment = "P Practical", } @Article{Moran:1981:NSP, author = "Shlomo Moran", title = "A note on: {``Shortest-path problem is not harder than matrix multiplication'' [Inform. Process. Lett. {\bf 11} (1980), no. 3, 134--136; MR 81k:68036] by F. Romani. With a reply by Romani}", journal = j-INFO-PROC-LETT, volume = "13", number = "2", pages = "85--86", day = "13", month = nov, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25", MRnumber = "83k:68036", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See \cite{Romani:1980:SPP}.", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4140 (Linear algebra); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Computer Sci., Technion, Haifa, Israel", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "algorithm theory; graph theory; matrix algebra; matrix multiplication; shortest path problem", treatment = "T Theoretical or Mathematical", } @Article{Ibarra:1981:DED, author = "Oscar H. Ibarra and Louis E. Rosier", title = "On the Decidability of Equivalence for Deterministic Pushdown Transducers", journal = j-INFO-PROC-LETT, volume = "13", number = "3", pages = "89--93", day = "13", month = dec, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68F10 (03B25 03D05)", MRnumber = "84j:68052", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "721; C4220 (Automata theory)", corpsource = "Dept. of Computer Sci., Univ. of Minnesota, Minneapolis, MN, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "alternate stacking; automata theory; computability and decidability; decidability; deterministic automata; deterministic pushdown transducers; equivalence; formal language", treatment = "T Theoretical or Mathematical", } @Article{Yamasaki:1981:WPP, author = "Hideki Yamasaki", title = "On Weak Persistency of {Petri} Nets", journal = j-INFO-PROC-LETT, volume = "13", number = "3", pages = "94--97", day = "13", month = dec, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68D90", MRnumber = "83g:68087", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C4220 (Automata theory)", corpsource = "Dept. of Information Sci., Tokyo Inst. of Technol., Oh-Okayama, Meguroku, Tokyo, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; automatic theory; computability and decidability; computer metatheory; decidable; Petri nets; projective images; reachability set; semi-linear sets; set theory; weak persistency", treatment = "T Theoretical or Mathematical", } @Article{Chan:1981:DFP, author = "Tat Hung Chan", title = "Deciding Freeness for Program Schemes with a Single Unary Function", journal = j-INFO-PROC-LETT, volume = "13", number = "3", pages = "98--102", day = "13", month = dec, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68D05 (03B25 03D05 68C30)", MRnumber = "83h:68067", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Computer Sci., Univ. of Minnesota, Minneapolis, MN, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "arities; complexity; computability and decidability; computational complexity; computer metatheory; counter reversals; decidable; finite automata; finite-reversal multicounter machines; freeness; predicates; program schemes; programming theory; single unary function", treatment = "T Theoretical or Mathematical", } @Article{Barlow:1981:PMA, author = "R. H. Barlow and D. J. Evans and J. Shanehichi", title = "A parallel merging algorithm", journal = j-INFO-PROC-LETT, volume = "13", number = "3", pages = "103--106", day = "13", month = dec, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E05 (68C05)", MRnumber = "83h:68092", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C6130 (Data handling techniques)", corpsource = "Dept. of Computer Studies, Loughborough Univ. of Technol., Loughborough, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer systems programming; four processor asynchronous parallel computer; merging; parallel merging algorithm; parallel processing", treatment = "P Practical", } @Article{Hassin:1981:MFP, author = "Refael Hassin", title = "Maximum flow in $(s,\,t)$ planar networks", journal = j-INFO-PROC-LETT, volume = "13", number = "3", pages = "107--107", day = "13", month = dec, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "90B10", MRnumber = "83g:90053", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "B0250 (Combinatorial mathematics); B0260 (Optimisation techniques); C1160 (Combinatorial mathematics); C1180 (Optimisation techniques)", corpsource = "Dept. of Statistics, Tel-Aviv Univ., Tel-Aviv, Israel", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "dual network; flow function; graph theory; minimum cut; optimisation; planar networks; shortest paths", treatment = "T Theoretical or Mathematical", } @Article{Ehrenfeucht:1981:SCD, author = "A. Ehrenfeucht and G. Rozenberg", title = "On the subword complexity of {D0L} languages with a constant distribution", journal = j-INFO-PROC-LETT, volume = "13", number = "3", pages = "108--113", day = "13", month = dec, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68F05", MRnumber = "83i:68105", MRreviewer = "Matti Linna", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Computer Sci., Univ. of Colorado, Boulder, CO, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "alphabet; computational complexity; constant distribution; D0L languages; formal languages; linear function; subword complexity", treatment = "T Theoretical or Mathematical", } @Article{Bird:1981:JP, author = "R. S. Bird", title = "The jogger's problem", journal = j-INFO-PROC-LETT, volume = "13", number = "3", pages = "114--117", day = "13", month = dec, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E10 (05C38)", MRnumber = "83f:68067", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C1290 (Applications of systems theory)", corpsource = "Dept. of Computer Sci., Univ. of Reading, Reading, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "combinatorial problems; finding cycles; graph theory; jogger's problem; network of roads; operations research; undesirability", treatment = "T Theoretical or Mathematical", } @Article{Atkinson:1981:CTH, author = "M. D. Atkinson", title = "The cyclic {Towers of Hanoi}", journal = j-INFO-PROC-LETT, volume = "13", number = "3", pages = "118--119", day = "13", month = dec, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68B05 (05A05)", MRnumber = "83f:68004", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Dept. of Math. and Statistics, Carleton Univ., Ottawa, Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "cyclic towers of Hanoi; inelastic method; interactive systems; PASCAL; programming theory; recursive programming", treatment = "T Theoretical or Mathematical", } @Article{Tolle:1981:CVC, author = "Donald MacDavid Tolle and William E. Siddall", title = "On the Complexity of Vector Computations in Binary Tree Machines", journal = j-INFO-PROC-LETT, volume = "13", number = "3", pages = "120--124", day = "13", month = dec, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25 (68B20)", MRnumber = "83h:68065", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "Univ. of North Carolina, Chapel Hill, NC, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm theory; automata theory; binary tree machines; complexity; computational complexity; computer metatheory; memory; parallel processing; processor; space-time tradeoffs; trees (mathematics); vector computations", treatment = "T Theoretical or Mathematical", } @Article{Denning:1981:MMK, author = "D. E. Denning and H. Meijer and F. B. Schneider", title = "More on master keys for group sharing", journal = j-INFO-PROC-LETT, volume = "13", number = "3", pages = "125--126", day = "13", month = dec, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "B6120B (Codes); C0230 (Economic, social and political aspects of computing); C6130 (Data handling techniques)", corpsource = "Computer Sci. Dept., Purdue Univ., West Lafayette, IN, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "cryptography; encryption; group sharing; master keys", treatment = "P Practical", } @Article{vandeSnepscheut:1981:SCB, author = "J. L. A. {Van De Snepscheut}", title = "Synchronous Communication Between Asynchronous Components", journal = j-INFO-PROC-LETT, volume = "13", number = "3", pages = "127--130", day = "13", month = dec, year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C4230 (Switching theory); C5220 (Computer architecture)", corpsource = "Dept. of Math., Eindhoven Univ. of Technol., Eindhoven, Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "asynchronous components; communicating processes; complex systems; complexity; components; computers, digital; designing programs; hierarchical systems; parallel processing; switching theory; synchronous communication; tree; trees (mathematics)", treatment = "T Theoretical or Mathematical", } @Article{Papadimitriou:1981:CPP, author = "Christos H. Papadimitriou and Mihalis Yannakakis", title = "The clique problem for planar graphs", journal = j-INFO-PROC-LETT, volume = "13", number = "4--5", pages = "131--133", day = "??", month = "End", year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E10 (05C10 05C35)", MRnumber = "83e:68090", MRreviewer = "Peter Eades", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, annote = "This issue was labelled End 1981, instead of Day Month 1981.", classification = "723; 921; B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics)", corpsource = "Lab. for Computer Sci., MIT, Cambridge, MA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "clique problem; computer programming; graph theory; linear time; mathematical techniques --- Graph Theory; planar graphs", treatment = "T Theoretical or Mathematical", } @Article{Barth:1981:AIK, author = "Gerhard 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", DOI = "https://doi.org/10.1016/0020-0190(81)90042-9", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, annote = "This issue was labelled End 1981, instead of Day Month 1981.", classification = "C6120 (File organisation); C7250L (Non-bibliographic retrieval systems)", corpsource = "Computer Sci. Dept., Pennsylvania State Univ., University Park, PA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "information retrieval; Knuth-Morris-Pratt algorithm; PASCAL; string matching", treatment = "P Practical", } @Article{Davis:1981:DCL, author = "R. H. Davis and C. Rinaldi and C. J. Trebilcock", title = "Data Compression in Limited Capacity Microcomputer Systems", journal = j-INFO-PROC-LETT, volume = "13", number = "4--5", pages = "138--141", day = "??", month = "End", year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, annote = "This issue was labelled End 1981, instead of Day Month 1981.", classification = "723; 731; C6120 (File organisation); C6130 (Data handling techniques); C7250L (Non-bibliographic retrieval systems)", corpsource = "Dept. of Computer Sci., Heriot-Watt Univ., Edinburgh, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computers, microprocessor; data base systems; data compression; data reduction; data reduction and analysis; database; information retrieval; information theory --- Data Compression; microcomputer systems; storage capacity", treatment = "P Practical", } @Article{Rytter:1981:TCL, author = "Wojciech Rytter", title = "Time complexity of languages recognized by one-way multihead pushdown automata", journal = j-INFO-PROC-LETT, volume = "13", number = "4--5", pages = "142--144", day = "??", month = "End", year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68F10", MRnumber = "83b:68088", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, annote = "This issue was labelled End 1981, instead of Day Month 1981.", classification = "C4210 (Formal logic); C4220 (Automata theory)", corpsource = "Inst. of Informatics, Warsaw Univ., Warzawa, Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "complexity; context-free languages; finite automata; input heads; one-way multihead pushdown automata", treatment = "T Theoretical or Mathematical", } @Article{Rytter:1981:HLR, author = "Wojciech Rytter", title = "A hardest language recognized by two-way nondeterministic pushdown automata", journal = j-INFO-PROC-LETT, volume = "13", number = "4--5", pages = "145--146", day = "??", month = "End", year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68F10", MRnumber = "83b:68089", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, annote = "This issue was labelled End 1981, instead of Day Month 1981.", classification = "C4220 (Automata theory)", corpsource = "Inst. of Informatics, Warsaw Univ., Warszawa, Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "2NPDA; finite automata; formal languages; hardest language; reading head; two-way nondeterministic pushdown automata", treatment = "T Theoretical or Mathematical", } @Article{Sabelfeld:1981:TEL, author = "V. K. Sabel{\cprime}fel{\cprime}d", title = "Tree equivalence of linear recursive schemata is polynomial-time decidable", journal = j-INFO-PROC-LETT, volume = "13", number = "4--5", pages = "147--153", day = "??", month = "End", year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25 (03D05 05C05 68E10)", MRnumber = "83e:68044", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, annote = "This issue was labelled End 1981, instead of Day Month 1981.", classification = "C4220 (Automata theory)", corpsource = "Computing Center, Novosibirsk, USSR", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "finite automata; function call; linear recursive schemata; marking algorithm; polynomial-time decidable; pushdown automata; tree equivalence; trees (mathematics)", treatment = "T Theoretical or Mathematical", } @Article{Bertossi:1981:EHP, author = "Alan A. Bertossi", title = "The edge {Hamiltonian} path problem is {NP}-complete", journal = j-INFO-PROC-LETT, volume = "13", number = "4--5", pages = "157--159", day = "??", month = "End", year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "05C45 (68C25 68E10)", MRnumber = "83i:05054", MRreviewer = "Narsingh Deo", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, annote = "This issue was labelled End 1981, instead of Day Month 1981.", classification = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Italsiel SpA, Roma, Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "computational complexity; edge Hamiltonian problem; graph theory; graphs; NP-complete; undirected graph", treatment = "T Theoretical or Mathematical", } @Article{Siklossy:1981:EQE, author = "L. Sikl\'{o}ssy", key = "Sikl\'{o}ssy", title = "Efficient query evaluation in relational data bases with missing values", journal = j-INFO-PROC-LETT, volume = "13", number = "4--5", pages = "160--163", day = "??", month = "End", year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", abstract = "do not have article QA 76 I47", acknowledgement = ack-nhfb, annote = "This issue was labelled End 1981, instead of Day Month 1981.", classification = "723; C6120 (File organisation); C6160D (Relational databases); C7250L (Non-bibliographic retrieval systems)", corpsource = "Bell Labs., Naperville, IL, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "data base systems; data structures; database management systems; DBMS; information retrieval; missing values; query retrieval; relational data bases", owner = "curtis", treatment = "P Practical", } @Article{Blum:1981:CTW, author = "M. Blum and R. M. Karp and O. Vornberger and C. H. Papadimitriou and M. Yannakakis", title = "The complexity of testing whether a graph is a superconcentrator", journal = j-INFO-PROC-LETT, volume = "13", number = "4--5", pages = "164--167", day = "??", month = "End", year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25 (05C20 68E10)", MRnumber = "84f:68031", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, annote = "This issue was labelled End 1981, instead of Day Month 1981.", classification = "921; B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics)", corpsource = "Univ. of California, Berkeley, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "complexity; coNP-complete; graph; graph theory; input node; mathematical techniques; output node; superconcentrator", treatment = "T Theoretical or Mathematical", } @Article{Schwartz:1981:FMD, author = "Jacob T. Schwartz", title = "Finding the minimum distance between two convex polygons", journal = j-INFO-PROC-LETT, volume = "13", number = "4--5", pages = "168--170", day = "??", month = "End", year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "52-04 (68C25 90D26)", MRnumber = "84a:52004", bibdate = "Sat Apr 11 12:24:20 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, annote = "This issue was labelled End 1981, instead of Day Month 1981.", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", } @Article{Ancona:1981:NMI, author = "M. Ancona and V. Gianuzzi", title = "A new method for implementing {${\rm LR}(k)$} tables", journal = j-INFO-PROC-LETT, volume = "13", number = "4--5", pages = "171--176", day = "??", month = "End", year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68F25 (03D05)", MRnumber = "83b:68090", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, annote = "This issue was labelled End 1981, instead of Day Month 1981.", classification = "C4210 (Formal logic)", corpsource = "Inst. per la Matematica Applicata, CNR, Genova, Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "grammars; lookahead strings; LR(k) tables; programming languages; RTs; syntactic analysis", treatment = "T Theoretical or Mathematical", } @Article{Edelsbrunner:1981:IOO, author = "H. Edelsbrunner and H. A. Maurer", title = "On the intersection of orthogonal objects", journal = j-INFO-PROC-LETT, volume = "13", number = "4--5", pages = "177--181", day = "??", month = "End", year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E05 (68G10)", MRnumber = "83c:68066", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, annote = "This issue was labelled End 1981, instead of Day Month 1981.", classification = "C6120 (File organisation)", corpsource = "Inst. f{\"u}r Informationsverarbeitung, Tech. Univ. of Graz, Graz, Austria", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "data structures; geometrical objects; intersection; interval tree; multidimensional algorithms; orthogonal objects; query; range searching; range tree; rectangle intersection; segment tree; time segment intersections", treatment = "P Practical", } @Article{Nakamura:1981:AIP, author = "Akira Nakamura and Kunio Aizawa", title = "Acceptors for isometric parallel context-free array languages", journal = j-INFO-PROC-LETT, volume = "13", number = "4--5", pages = "182--186", day = "??", month = "End", year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68F05", MRnumber = "83e:68114", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, annote = "This issue was labelled End 1981, instead of Day Month 1981.", classification = "C4210 (Formal logic)", corpsource = "Dept. of Appl. Math., Hiroshima Univ., Hiroshima, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "array acceptor; context-free languages; isometric parallel context-free array languages; sequential writing traversal array acceptor", treatment = "T Theoretical or Mathematical", } @Article{Williams:1981:STE, author = "M. H. Williams", title = "A systematic test for extended operator precedence", journal = j-INFO-PROC-LETT, volume = "13", number = "4--5", pages = "187--190", day = "??", month = "End", year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68F25", MRnumber = "83b:68092", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, annote = "This issue was labelled End 1981, instead of Day Month 1981.", classification = "C4210 (Formal logic); C6150C (Compilers, interpreters and other processors)", corpsource = "Dept. of Computer Sci., Heriot-Watt Univ., Edinburgh, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "compilers; extended operator precedence; grammar; grammars; parsing; program compilers; syntax analysis; systematic test", treatment = "P Practical", } @Article{Yasuura:1981:WDC, author = "Hiroto Yasuura", title = "Width and Depth of Combinational Logic Circuits", journal = j-INFO-PROC-LETT, volume = "13", number = "4--5", pages = "191--194", day = "??", month = "End", year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, annote = "This issue was labelled End 1981, instead of Day Month 1981.", classification = "721; C4240 (Programming and algorithm theory); C5210 (Logic design methods)", corpsource = "Dept. of Information Sci., Kyoto Univ., Kyoto, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata; Boolean function; Boolean functions; combinational logic circuits; complexity measure; complexity theory; computational complexity; depth circuit; logic circuits, combinatorial; logic design; parallelism", treatment = "T Theoretical or Mathematical", } @Article{Freivalds:1981:PLR, author = "R\=usi{\lfhook{n}}{\v{s}} Freivalds", title = "Projections of languages recognizable by probabilistic and alternating finite multitape automata", journal = j-INFO-PROC-LETT, volume = "13", number = "4--5", pages = "195--198", day = "??", month = "End", year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68F10", MRnumber = "83b:68086", bibdate = "Sat Apr 11 12:24:20 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, annote = "This issue was labelled End 1981, instead of Day Month 1981.", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", } @Article{Arora:1981:GPD, author = "R. K. Arora and N. K. Sharma", title = "Guarded Procedure: a Distributed Programming Concept", journal = j-INFO-PROC-LETT, volume = "13", number = "4--5", pages = "199--203", day = "??", month = "End", year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, annote = "This issue was labelled End 1981, instead of Day Month 1981.", classification = "723; C6150J (Operating systems)", corpsource = "Computer Centre, Indian Inst. of Technol., New Delhi, India", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer programming; distributed processing; distributed programming; processes; software components", treatment = "P Practical", } @Article{Guida:1981:MKR, author = "G. Guida and M. Somalvico", title = "Multi-problem-solving: knowledge representation and system architecture", journal = j-INFO-PROC-LETT, volume = "13", number = "4--5", pages = "204--214", day = "??", month = "????", year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, annote = "This issue was labelled End 1981, instead of Day Month 1981.", classification = "C1230 (Artificial intelligence)", corpsource = "Istituto di Elettrotecnica ed Elettronica, Politecnico di Milano, Milano, Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "artificial intelligence; knowledge representation; learning; multi-problem-solving; searching; system architecture", treatment = "T Theoretical or Mathematical", } @Article{Troya:1981:AAR, author = "J. M. Troya and A. Vaquero", title = "An approximation algorithm for reducing expected head movement in linear storage devices", journal = j-INFO-PROC-LETT, volume = "13", number = "4--5", pages = "218--220", day = "??", month = "End", year = "1981", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, annote = "This issue was labelled End 1981, instead of Day Month 1981.", classification = "723; C5320C (Storage on moving magnetic media)", corpsource = "Dept. of Informatica y Automatica, Univ. Complutense, Madrid, Spain", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "approximation algorithm; computer programming; data storage, magnetic --- Storage Devices; expected head movement; linear storage devices; magnetic disc and drum storage; magnetic disc storage; magnetic tape storage; Markov chain; records; time complexity; weighted graph", treatment = "T Theoretical or Mathematical", } @Article{Schmitt:1982:CPF, author = "Alfred Schmitt", title = "On the computational power of the floor function", journal = j-INFO-PROC-LETT, volume = "14", number = "1", pages = "1--3", day = "27", month = mar, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C01 (68E05)", MRnumber = "83c:68032", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation)", corpsource = "Fakultat f{\"u}r Informatik, Univ. Karlsruhe, Karlsruhe, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "computational power; file organisation; floor function; hashing techniques; relational operations; running time", treatment = "P Practical", } @Article{Chor:1982:AFF, author = "Ben-Zion Chor", title = "Arithmetic of finite fields", journal = j-INFO-PROC-LETT, volume = "14", number = "1", pages = "4--6", day = "27", month = mar, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "12C05 (12-04 68C25)", MRnumber = "83h:12028", MRreviewer = "Thomas Beth", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "B0290F (Interpolation and function approximation); C4130 (Interpolation and function approximation)", corpsource = "Dept. of Math., Hebrew Univ. of Jerusalem, Jerusalem, Israel", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "arithmetic; factorization; finite fields; integers; irreducible polynomial; polynomials", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Nath:1982:PAC, author = "Dhruva Nath and S. N. Maheshwari", title = "Parallel Algorithms for the Connected Components and Minimal Spanning Tree Problems", journal = j-INFO-PROC-LETT, volume = "14", number = "1", pages = "7--11", day = "27", month = mar, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E10 (05C05)", MRnumber = "83c:68080", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; 921; C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Electrical Engng., Indian Inst. of Technol., New Delhi, India", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computational complexity; computer programming; connected components; integers; interconnected processors; mathematical techniques --- Graph Theory; minimal spanning tree problems; parallel algorithms; parallel processing; read; standard arithmetic operations; time bound algorithms; trees (mathematics); write", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Brouwer:1982:NMK, author = "Andries E. Brouwer and Peter {van Emde Boas}", title = "A note on: {``Master keys for group sharing'' [Inform. Process. Lett. {\bf 12} (1981), no. 1, 23--25; MR 82d:94046] by D. E. Denning and F. B. Schneider}", journal = j-INFO-PROC-LETT, volume = "14", number = "1", pages = "12--14", day = "27", month = mar, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "94B99", MRnumber = "83h:94019", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See \cite{Denning:1981:MKG}.", acknowledgement = ack-nhfb, classification = "C6130 (Data handling techniques)", corpsource = "Dept. of Pure Math., Math. Centre, Amsterdam, Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "cryptography; group keys; group sharing; master keys", treatment = "P Practical", } @Article{Backhouse:1982:WNS, author = "Ronald Backhouse", title = "Writing a number as the sum of two squares: a new solution", journal = j-INFO-PROC-LETT, volume = "14", number = "1", pages = "15--17", day = "27", month = mar, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "10-04 (10J05 68B10)", MRnumber = "83d:10003", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Dept. of Computer Sci., Heriot-Watt Univ., Edinburgh, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "number; programming theory; squares; sum", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Gelenbe:1982:SP, author = "E. Gelenbe and D. Gardy", title = "On the size of projections", journal = j-INFO-PROC-LETT, volume = "14", number = "1", pages = "18--21", day = "27", month = mar, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C6160 (Database management systems (DBMS))", corpsource = "LRI Univ. de Paris-Sud, Orsay, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "census data; data collection; database management systems; DBMS; matrix; physics experiments; projections; vectors", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Gunn:1982:CTT, author = "Hamish I. E. Gunn", title = "Compile Time Type Checking of Structure Field Accessing", journal = j-INFO-PROC-LETT, volume = "14", number = "1", pages = "22--25", day = "27", month = mar, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C6110 (Systems analysis and programming); C6140D (High level languages)", corpsource = "Dept. of Computational Sci., Univ. of St. Andrews, St. Andrews, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algol-like language; compile time; computer programming; h; high level languages; programming; structure classes; structure field accessing; type checking", treatment = "P Practical", } @Article{Tarjan:1982:HCA, author = "R. Endre Tarjan", title = "A hierarchical clustering algorithm using strong components", journal = j-INFO-PROC-LETT, volume = "14", number = "1", pages = "26--29", day = "27", month = mar, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; 921; B0250 (Combinatorial mathematics); B6140C (Optical information, image and video signal processing); C1160 (Combinatorial mathematics); C1250 (Pattern recognition)", corpsource = "Bell Labs., Murray Hill, NJ, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer programming; edges; graph; graph theory; hierarchical clustering algorithm; mathematical techniques --- Graph Theory; pattern recognition; rooted tree; strong components; vertex partitions", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Tarjan:1982:SAM, author = "Robert Endre Tarjan", title = "Sensitivity analysis of minimum spanning trees and shortest path trees", journal = j-INFO-PROC-LETT, volume = "14", number = "1", pages = "30--33", day = "27", month = mar, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E10 (05C05)", MRnumber = "83c:68083", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See corrigendum \cite{Tarjan:1986:SAM}.", acknowledgement = ack-nhfb, classification = "B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics); C1310 (Control system analysis and synthesis methods)", corpsource = "Bell Labs., Murray Hill, NJ, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "edges; graph theory; minimality; minimum spanning trees; network optimization; robustness; sensitivity analysis; shortest path trees; subgraph; trees (mathematics); undirected graph; vertices", treatment = "P Practical; T Theoretical or Mathematical", } @Article{vanLeeuwen:1982:ERR, author = "Jan {van Leeuwen} and Maurice Nivat", title = "Efficient recognition of rational relations", journal = j-INFO-PROC-LETT, volume = "14", number = "1", pages = "34--38", day = "27", month = mar, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E10", MRnumber = "83c:68078", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory)", corpsource = "Dept. of Computer Sci., Univ. of Utrecht, Utrecht, Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "automata theory; complexity; deterministic computing device; efficient recognition; inputs; nondeterministic finite-state acceptor; rational relations; tuples", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Ko:1982:SOP, author = "Ker-I Ko", title = "Some observations on the probabilistic algorithms and {NP}-hard problems", journal = j-INFO-PROC-LETT, volume = "14", number = "1", pages = "39--43", day = "27", month = mar, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25", MRnumber = "83c:68047", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "B0240Z (Other topics in statistics); B0260 (Optimisation techniques); C1140Z (Other topics in statistics); C1180 (Optimisation techniques); C4130 (Interpolation and function approximation); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Computer Sci., Univ. of Houston, Houston, TX, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "circuit complexity; complexity classes; computational complexity; nondeterministic computations; NP-complete problem; NP-hard problems; optimisation; polynomial time hierarchy; polynomials; probabilistic algorithms; probability; Rabin-type algorithms", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Zaks:1982:GRA, author = "Shmuel Zaks", title = "Generation and ranking of {$K$}-ary trees", journal = j-INFO-PROC-LETT, volume = "14", number = "1", pages = "44--48", day = "27", month = mar, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E10 (05C05)", MRnumber = "83c:68088", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Computer Sci. Dept., Technion-Israel Inst. of Technol., Haifa, Israel", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "generation; internal nodes; K-ary trees; lexicographic order; ranking; trees; trees (mathematics); unranking", treatment = "T Theoretical or Mathematical", } @Article{FarinasDelCerro:1982:SDM, author = "L. {Fari{\~n}as Del Cerro}", title = "A simple deduction method for modal logic", journal = j-INFO-PROC-LETT, volume = "14", number = "2", pages = "49--51", day = "20", month = apr, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "03B35 (03B45)", MRnumber = "83k:03019", MRreviewer = "Steve Kuhn", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Univ. Toulouse Le Mirail, Toulouse, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "deduction method; formal logic; knowledge representation; modal logic; programming theory; theorem proving", treatment = "P Practical", } @Article{Slisenko:1982:CFG, author = "A. O. Slisenko", title = "Context-free grammars as a tool for describing polynomial-time subclasses of hard problems", journal = j-INFO-PROC-LETT, volume = "14", number = "2", pages = "52--56", day = "20", month = apr, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25 (03D15 68F05)", MRnumber = "83h:68064", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "LOMI, Leningrad, USSR", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "computational complexity; context-free grammars; context-free graph grammar; graph theory; graphs; Hamiltonian circuit; hard problems; polynomial-time", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Graham:1982:SER, author = "M. H. Graham and A. O. Mendelzon", title = "Strong equivalence of relational expressions under dependencies", journal = j-INFO-PROC-LETT, volume = "14", number = "2", pages = "57--62", day = "20", month = apr, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C6160D (Relational databases)", corpsource = "Computer Systems Res. Group, Univ. of Toronto, Toronto, Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "database management systems; dependencies; query equivalence; relational database; relational expressions", treatment = "P Practical", } @Article{Lagarias:1982:MSR, author = "J. C. Lagarias and D. E. Swartwout", title = "Minimal storage representations for binary relations", journal = j-INFO-PROC-LETT, volume = "14", number = "2", pages = "63--66", day = "20", month = apr, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68B15", MRnumber = "83h:68033", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory); C6120 (File organisation)", corpsource = "Bell Labs., Murray Hill, NJ, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "binary relations; data encoding; data structures; discrete mathematics; graph theory; graph-theoretic terms; guest graphs; host graphs; logical data structure; pointers; programming theory; sequential movements; storage representations", treatment = "T Theoretical or Mathematical", } @Article{Gini:1982:ASI, author = "Guiseppina Gini", title = "The automatic synthesis of iterative programs", journal = j-INFO-PROC-LETT, volume = "14", number = "2", pages = "67--73", day = "20", month = apr, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C1230 (Artificial intelligence); C6110 (Systems analysis and programming)", corpsource = "Istituto di Elettrotecnica ed Elettronica, Politecnico di Milano, Milano, Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "artificial intelligence; automatic programming; automatic synthesis; compiler; computer programming; computer programs; FORTRAN; high-level descriptions; iterative programs; PROSIT; synthesizer; target programming language; transformation rules", treatment = "P Practical", } @Article{Edelsbrunner:1982:PIS, author = "H. Edelsbrunner and H. A. Maurer and D. G. Kirkpatrick", title = "Polygonal intersection searching", journal = j-INFO-PROC-LETT, volume = "14", number = "2", pages = "74--79", day = "20", month = apr, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E05 (51-04)", MRnumber = "83h:68093", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C6160 (Database management systems (DBMS)); C7250L (Non-bibliographic retrieval systems)", corpsource = "Inst. f{\"u}r Informationsverarbeitung, Tech. Univ. of Graz, Graz, Austria", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "concrete complexity; database management systems; DBMS; edges; geometric searching; geometric transforms; information retrieval; multidimensional searching; polygon intersection; polygon intersection searching; query polygon; simple plane polygons; triangular range search", treatment = "P Practical", } @Article{Bergstra:1982:STL, author = "J. A. Bergstra and J.-J. Ch. Meyer", title = "A simple transfer lemma for algebraic specifications", journal = j-INFO-PROC-LETT, volume = "14", number = "2", pages = "80--85", day = "20", month = apr, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation)", corpsource = "Dept. of Computer Sci., Univ. of Leiden, Leiden, Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "algebraic specifications; algebraic structures; data structures; data types; domains; initial algebra semantics; signatures; specifications; transfer lemma", treatment = "P Practical", } @Article{Upfal:1982:FCP, author = "Eliezer Upfal", title = "Formal correctness proofs of a nondeterministic program", journal = j-INFO-PROC-LETT, volume = "14", number = "2", pages = "86--92", day = "20", month = apr, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68B10", MRnumber = "83g:68028", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Dept. of Appl. Math., Weizmann Inst. of Sci., Rehovot, Israel", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "nondeterministic program; programming theory; total correctness", treatment = "T Theoretical or Mathematical", } @Article{Kucera:1982:PCC, author = "Lud{\v{e}}k Ku{\v{c}}era", title = "Parallel computation and conflicts in memory access", journal = j-INFO-PROC-LETT, volume = "14", number = "2", pages = "93--96", day = "20", month = apr, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68B20 (05C50 68C25)", MRnumber = "83g:68038", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See also erratum and addendum \cite{Kucera:1983:EAP}.", acknowledgement = ack-nhfb, classification = "C6150J (Operating systems)", corpsource = "Charles Univ., Prague, Czechoslovakia", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "conflicts; graph algorithms; intensive interprocessor communication; memory access; operating systems (computers); OS; parallel computation; parallel processing", treatment = "P Practical", } @Article{Yokomori:1982:TRN, author = "Takashi Yokomori and Derick Wood and Klaus-J{\"o}rn Lange", title = "A three-restricted normal form theorem for {ETOL} languages", journal = j-INFO-PROC-LETT, volume = "14", number = "3", pages = "97--100", day = "16", month = may, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68F05", MRnumber = "83g:68115", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See also erratum \cite{Yokomori:1985:ETR}.", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Unit for Computer Sci., McMaster Univ., Hamilton, Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "1-restricted ETOL systems; ETOL languages; formal languages; recursively enumerable sets; three-restricted normal form", treatment = "P Practical", } @Article{Tarhio:1982:LPS, author = "Jorma Tarhio", title = "{LR} Parsing of Some Ambiguous Grammars", journal = j-INFO-PROC-LETT, volume = "14", number = "3", pages = "101--103", day = "16", month = may, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68F25", MRnumber = "83h:68140", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C4210 (Formal logic)", corpsource = "Dept. of Computer Sci., Univ. of Helsinki, Helsinki, Finland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "ambiguous grammars; computer programming languages; context information; context-sensitive grammars; input buffer; LR parsing", treatment = "P Practical", } @Article{Watjen:1982:AVE, author = "Dietmar W{\"a}tjen and Werner Struckmann", title = "An algorithm for verifying equations of morphisms in a category", journal = j-INFO-PROC-LETT, volume = "14", number = "3", pages = "104--108", day = "16", month = may, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C05 (18A23)", MRnumber = "83g:68049", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Lehrstuhl f{\"u}r Informatik, Tech. Univ. Braunschweig, Braunschweig, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "algorithm theory; category theory; morphisms; natural transformations; verification", treatment = "T Theoretical or Mathematical", } @Article{King:1982:OAS, author = "K. N. King and Barbara Smith-Thomas", title = "An optimal algorithm for sink-finding", journal = j-INFO-PROC-LETT, volume = "14", number = "3", pages = "109--111", day = "16", month = may, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25 (68E10)", MRnumber = "83h:68058", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4140 (Linear algebra)", corpsource = "School of Information and Computer Sci., Georgia Inst. of Technol., Atlanta, GA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "adjacency matrix; directed graph; graph theory; incoming edge; matrix algebra; optimal algorithm; outgoing edges; sink-finding", treatment = "T Theoretical or Mathematical", } @Article{Lassez:1982:FPT, author = "J.-L. Lassez and V. L. Nguyen and E. A. Sonenberg", title = "Fixed point theorems and semantics: a folk tale", journal = j-INFO-PROC-LETT, volume = "14", number = "3", pages = "112--116", day = "16", month = may, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68B10 (03D20)", MRnumber = "83f:68008", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Dept., of Computer Sci., Univ. of Melbourne, Parkville, Melbourne, Vic., Australia", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "algorithm theory; fixed point theory; recursion; semantics", treatment = "T Theoretical or Mathematical", } @Article{Barlow:1982:PMD, author = "R. H. Barlow and D. J. Evans and J. Shanehchi", title = "Parallel multisection for the determination of the eigenvalues of symmetric quindiagonal matrices", journal = j-INFO-PROC-LETT, volume = "14", number = "3", pages = "117--118", day = "16", month = may, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C1110 (Algebra); C4140 (Linear algebra)", corpsource = "Dept. of Computer Studies, Loughborough Univ. of Technol., Loughborough, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "bisection point; eigenvalues; eigenvalues and eigenfunctions; intervals; known non-empty intervals; matrix algebra; parallel multisection; sequential solutions; symmetric quindiagonal matrices; symmetric tridiagonal systems", treatment = "P Practical", } @Article{Rohrich:1982:HQW, author = "Johannes R{\"o}hrich", title = "A hybrid of {Quicksort} with {$O(n \log n)$} worst case complexity", journal = j-INFO-PROC-LETT, volume = "14", number = "3", pages = "119--123", day = "16", month = may, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E05", MRnumber = "83g:68093", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Inst. f{\"u}r Informatik II, Univ. Karlsruhe, Karlsruhe, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "average time; computational complexity; computer programming; Quicksort; worst case complexity", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Edelsbrunner:1982:ESR, author = "Herbert Edelsbrunner and Mark H. Overmars", title = "On the equivalence of some rectangle problems", journal = j-INFO-PROC-LETT, volume = "14", number = "3", pages = "124--127", day = "16", month = may, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E05 (52-04 68K05)", MRnumber = "83f:68063", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Inst. f{\"u}r Informationsverarbeitung, Tech. Univ. of Graz, Graz, Austria", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "computational complexity; counting variant; dominance searching; equivalence; rectangle problems", treatment = "T Theoretical or Mathematical", } @Article{Elgot:1982:SSA, author = "Calvin C. Elgot and Alan J. Perlis and Lawrence Snyder", title = "A syntax-free semantics for the {APL} operators", journal = j-INFO-PROC-LETT, volume = "14", number = "3", pages = "128--131", day = "16", month = may, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Math. Sci. Dept., IBM TJ Watson Res. Center, Yorktown Heights, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "APL operators; computer programming languages; index; membership; programming theory; reduction; scalar product; scan; structural transformations; syntax-free semantics", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Ridjanovic:1982:DDD, author = "Dzenan Ridjanovic and Michael L. Brodie", title = "Defining Database Dynamics with Attribute Grammars", journal = j-INFO-PROC-LETT, volume = "14", number = "3", pages = "132--138", day = "16", month = may, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C4210 (Formal logic)", corpsource = "Dept. of Computer Sci., Univ. of Maryland, College Park, MD, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "attribute grammars; data base systems; database dynamics; database integrity constraints; grammars; programming language; semantics; syntax", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Korsh:1982:GNO, author = "J. F. Korsh", title = "Growing nearly optimal binary search trees", journal = j-INFO-PROC-LETT, volume = "14", number = "3", pages = "139--143", day = "16", month = may, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Computer Sci., Temple Univ., Philadelphia, PA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "binary search trees; nearly optimal trees; probability distributions; trees (mathematics)", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Bini:1982:RPN, author = "Dario Bini", title = "Reply to the paper: {``The numerical instability of Bini's algorithm'' [Inform. Process. Lett. {\bf 12} (1981), no. 1, 17--19; MR 82i:65029] by N. K. Tsao}", journal = j-INFO-PROC-LETT, volume = "14", number = "3", pages = "144--145", day = "16", month = may, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "65F30 (68C05)", MRnumber = "83h:65054", bibdate = "Sat Apr 11 12:24:20 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See \cite{Tsao:1981:NIB}.", acknowledgement = ack-nhfb, fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", } @Article{Jakobsson:1982:EHB, author = "M. Jakobsson", title = "Evaluation of a hierarchical bit-vector compression technique", journal = j-INFO-PROC-LETT, volume = "14", number = "4", pages = "147--149", day = "13", month = jun, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation)", corpsource = "Univ. of Vaasa, Vaasa, Finland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "file organisation; hierarchical bit-vector compression technique; indexes; inverted files", treatment = "P Practical", } @Article{Orenstein:1982:MTU, author = "Jack A. Orenstein", title = "Multidimensional Tries Used for Associative Searching", journal = j-INFO-PROC-LETT, volume = "14", number = "4", pages = "150--157", day = "13", month = jun, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C6120 (File organisation); C7250L (Non-bibliographic retrieval systems)", corpsource = "School of Computer Sci., McGill Univ., Montreal, Que., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "associative searching; data processing; data structure; data structures; information retrieval; kd tree; kd trie; updating", treatment = "P Practical", } @Article{Umeo:1982:DOW, author = "Hiroshi Umeo and Kenichi Morita and Kazuhiro Sugata", title = "Deterministic One-Way Simulation of Two-Way Real-Time Cellular Automata and its Related Problems", journal = j-INFO-PROC-LETT, volume = "14", number = "4", pages = "158--161", day = "13", month = jun, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68D20 (03D05 03D15)", MRnumber = "83h:68077", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "721; C4220 (Automata theory)", corpsource = "Junior Coll. Div., Osaka Electro-Communication Univ., Neyagawa-shi, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; circular cellular automata; computational complexity; deterministic one-way cellular automation; finite automata; parallel processing; two-way real-time cellular automata", treatment = "P Practical", } @Article{Beretta:1982:MCE, author = "G. Beretta", title = "{Monte Carlo} estimation of numerical stability in fast algorithms for systems of bilinear forms", journal = j-INFO-PROC-LETT, volume = "14", number = "4", pages = "162--167", day = "13", month = jun, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4190 (Other numerical methods)", corpsource = "ETH, Zurich, Switzerland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "bilinear forms; complex numbers; convergence of numerical methods; fast algorithms; matrices; Monte Carlo estimation; Monte Carlo methods; numerical stability; quaternions; roundoff error; Strassen algorithm", treatment = "T Theoretical or Mathematical", } @Article{Franchi-Zannettacci:1982:ETS, author = "Paul Franchi-Zannettacci", title = "An extension to trees of the {Sardinas} and {Patterson} algorithm", journal = j-INFO-PROC-LETT, volume = "14", number = "4", pages = "168--173", day = "13", month = jun, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "94B45 (68E10)", MRnumber = "84a:94019", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; B6120B (Codes)", corpsource = "UER de Math. et Informatique, Univ. de Bordeaux I, Talence, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "codes, symbolic; computer programming; encoding; homomorphism; Sardinas and Patterson algorithm; trees; trees (mathematics); variable length codes theory", treatment = "T Theoretical or Mathematical", } @Article{Demolombe:1982:GDR, author = "R. Demolombe", title = "Generalized division for relational algebraic language", journal = j-INFO-PROC-LETT, volume = "14", number = "4", pages = "174--178", day = "13", month = jun, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68H05", MRnumber = "83h:68154", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C6160D (Relational databases)", corpsource = "ONERA-CERT, Toulouse, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "algebraic operators; database management systems; DBMS; generalized division operator; relational algebraic language; tuples", treatment = "P Practical", } @Article{Doberkat:1982:AEH, author = "Ernst-E. E. Doberkat", title = "Asymptotic estimates for the higher moments of the expected behavior of straight insertion sort", journal = j-INFO-PROC-LETT, volume = "14", number = "4", pages = "179--182", day = "13", month = jun, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E05", MRnumber = "83g:68091", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6130 (Data handling techniques)", corpsource = "Dept. of Math. and Computer Sci., Clarkson Coll. of Technol., Potsdam, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "Bernoulli numbers; expected behavior; higher moments; programming theory; sorting; straight insertion sort", treatment = "T Theoretical or Mathematical", } @Article{Fischer:1982:LBT, author = "Michael J. Fischer and Nancy A. Lynch", title = "A lower bound for the time to assure interactive consistency", journal = j-INFO-PROC-LETT, volume = "14", number = "4", pages = "183--186", day = "13", month = jun, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68B20", MRnumber = "83g:68037", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4290 (Other computer theory); C5600 (Data communication equipment and techniques)", corpsource = "Lab. for Computer Sci., MIT, Cambridge, MA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "communication; computation theory; computer metatheory; distributed processing; faulty processors; interactive consistency", treatment = "T Theoretical or Mathematical", } @Article{Jou:1982:CRR, author = "Jiann H. Jou and Patrick C. Fischer", title = "The complexity of recognizing {$3{\rm NF}$} relation schemes", journal = j-INFO-PROC-LETT, volume = "14", number = "4", pages = "187--190", day = "13", month = jun, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25 (68H05)", MRnumber = "83h:68057", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6160D (Relational databases)", corpsource = "Univ. of Texas, Dallas, TX, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "3NF relation schemes; Boyce-Codd normal form; complexity; database management systems; DBMS; decision problem; NP-complete; polynomial time; programming theory; relational database scheme; third normal form", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Minker:1982:ELR, author = "Jack Minker and Guy Zanon", title = "An extension to linear resolution with selection function", journal = j-INFO-PROC-LETT, volume = "14", number = "4", pages = "191--194", day = "13", month = jun, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68G15 (03B35)", MRnumber = "83i:68141", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C1230 (Artificial intelligence); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Computer Sci., Univ. of Maryland, College Park, MD, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "interference system; linear resolution; LUST-resolution; programming theory; selection function; theorem proving", treatment = "T Theoretical or Mathematical", } @Article{Aspvall:1982:ELT, author = "Bengt Aspvall and Michael F. Plass and Robert Endre Tarjan", title = "Erratum: {``A linear-time algorithm for testing the truth of certain quantified {Boolean} formulas'' [Inform. Process. Lett. {\bf 8} (1979), no. 3, 121--123; MR 80b:68050]}", journal = j-INFO-PROC-LETT, volume = "14", number = "4", pages = "195--195", day = "13", month = jun, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25", MRnumber = "83g:68058", bibdate = "Sat Apr 11 12:24:20 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See \cite{Aspvall:1979:LTA}.", acknowledgement = ack-nhfb, fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", } @Article{DeFelice:1982:TC, author = "Clelia {De Felice}", title = "On the triangle conjecture", journal = j-INFO-PROC-LETT, volume = "14", number = "5", pages = "197--200", day = "23", month = jul, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "94B45 (20M35 68E99)", MRnumber = "84b:94025", MRreviewer = "Jean-Eric Pin", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "B6110 (Information theory); C1260 (Information theory)", corpsource = "Istituto di Matematica, Univ. di Napoli, Napoli, Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "codes; free monoids; information theory; triangle conjecture", treatment = "T Theoretical or Mathematical", } @Article{Burton:1982:LST, author = "F. Warren Burton", title = "A linear space translation of functional programs to {Turner} combinators", journal = j-INFO-PROC-LETT, volume = "14", number = "5", pages = "201--204", day = "23", month = jul, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "03B40 (68B10)", MRnumber = "84b:03027", MRreviewer = "M. Coppo", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "School of Computing Studies and Accountancy, Univ. of East Anglia, Norwich, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "distributed evaluation; functional programs; lambda calculus; linear space translation; programming theory; Turner combinators", treatment = "T Theoretical or Mathematical", } @Article{Burton:1982:EFI, author = "F. Warren Burton", title = "An efficient functional implementation of {FIFO} queues", journal = j-INFO-PROC-LETT, volume = "14", number = "5", pages = "205--206", day = "23", month = jul, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "922; C1140C (Queueing theory); C4240 (Programming and algorithm theory)", corpsource = "School of Computing Studies and Accountancy, Univ. of East Anglia, Norwich, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "argument; data structures; efficient functional implementation; FIFO queues; probability; programming theory; queueing theory", treatment = "T Theoretical or Mathematical", } @Article{Nijholt:1982:NSS, author = "Anton Nijholt", title = "A note on the sufficiency of {Soko{\l}owski}'s criterion for context-free languages", journal = j-INFO-PROC-LETT, volume = "14", number = "5", pages = "207--207", day = "23", month = jul, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68F05", MRnumber = "83k:68075", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Informatics, Nijmegen Univ., Nijmegen, Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "context-free languages; context-free-ness; pumping lemmas; Sokolowski's criterion; sufficiency", treatment = "P Practical", } @Article{Reddy:1982:MCC, author = "P. G. Reddy and Subhash Bhalla and B. E. Prasad", title = "A model of concurrency control in distributed database systems", journal = j-INFO-PROC-LETT, volume = "14", number = "5", pages = "208--213", day = "23", month = jul, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C6160B (Distributed databases)", corpsource = "Computer Centre, Indian Inst. of Technol., Delhi, New Delhi, India", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "concurrency control; data base systems; database management systems; distributed database systems; distributed processing; pure birth process; seizing locks; update algorithm", treatment = "P Practical", } @Article{Shanthikumar:1982:RAG, author = "J. G. Shanthikumar", title = "A recursive algorithm to generate joint probability distribution of arrivals from exponential sources during a random time interval", journal = j-INFO-PROC-LETT, volume = "14", number = "5", pages = "214--217", day = "23", month = jul, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "65U05 (60K25)", MRnumber = "84a:65111", MRreviewer = "Lennart R\.ade", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "722; 723; 922; C1140C (Queueing theory); C7310 (Mathematics computing)", corpsource = "Dept. of Industrial Engng. and Operations Res., Syracuse Univ., Syracuse, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "arrivals; computational analysis; computer systems, digital; customer arrivals; exponential sources; joint probability distribution; probability --- Queueing; probability distribution; queueing systems; queueing theory; random time interval; recursive algorithm; reliability", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Hart:1982:PIM, author = "Johnson M. Hart", title = "Permutation Inversions and Multidimensional Cumulative Distribution Functions", journal = j-INFO-PROC-LETT, volume = "14", number = "5", pages = "218--222", day = "23", month = jul, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C05", MRnumber = "83m:68059", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "722; 723; C4240 (Programming and algorithm theory)", corpsource = "Modicon Div., Gould Inc., Andover, MA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer systems, digital; empirical cumulative distribution function; multidimensional cumulative distribution functions; parallel processing; parallel processors; permutation inversions; programming theory; recursive multidimensional divide-and-conquer; sorting", treatment = "T Theoretical or Mathematical", } @Article{Carlson:1982:ETS, author = "David A. Carlson and John E. Savage", title = "Extreme time-space tradeoffs for graphs with small space requirements", journal = j-INFO-PROC-LETT, volume = "14", number = "5", pages = "223--227", day = "23", month = jul, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25 (05C20 05C70 68E10)", MRnumber = "83m:68072", MRreviewer = "T. R. S. Walsh", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C1140E (Game theory); C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Computer Sci., Brown Univ., Providence, RI, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "computational complexity; directed acyclic graph; game theory; graph theory; graphs; pebble game; small space requirements", treatment = "T Theoretical or Mathematical", } @Article{Bar-Yehuda:1982:CFP, author = "Reuven Bar-Yehuda and Uzi Vishkin", title = "Complexity of finding $k$-path-free dominating sets in graphs", journal = j-INFO-PROC-LETT, volume = "14", number = "5", pages = "228--232", day = "23", month = jul, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25 (05C20 68E10)", MRnumber = "84m:68032", MRreviewer = "P. Ramanan", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Computer Sci. Dept., Israel Inst. of Technol., Haifa, Israel", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "computational complexity; dominating vertex set; enumeration; graph theory; graphs; k-path-free dominating sets; NP-complete", treatment = "T Theoretical or Mathematical", } @Article{Savage:1982:DFS, author = "Carla Savage", title = "Depth-First Search and the Vertex Cover Problem", journal = j-INFO-PROC-LETT, volume = "14", number = "5", pages = "233--235", day = "23", month = jul, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E10 (05C35)", MRnumber = "83m:68126", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Computer Sci. Dept., North Carolina State Univ., Raleigh, NC, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "approximation algorithms; combinatorial algorithms; computational complexity; computer programming; depth first search; graph theory; minimum cover; nonleaf vertices; NP-complete; undirected graph; vertex cover problem", treatment = "T Theoretical or Mathematical", } @Article{Zemanek:1982:OVM, author = "Heinz Zemanek", title = "Obituary: {Victor Mikha{\u{\i}}lovich Glushkov} (1923--1982)", journal = j-INFO-PROC-LETT, volume = "14", number = "5", pages = "236--237", day = "23", month = jul, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "01A70", MRnumber = "84h:01093", bibdate = "Sat Apr 11 12:24:20 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", subject = "A.0 General Literature, GENERAL, Biographies/Autobiographies \\ K.2 Computing Milieux, HISTORY OF COMPUTING, People", } @Article{Krichevsky:1982:LEF, author = "R. E. Krichevsky", title = "Letter to the editor: {``A family of codes commutatively equivalent to prefix codes'' [Inform. Process. Lett. {\bf 12} (1981), no. 1, 1--4; MR 82j:94021] by S. Mauceri and A. Restivo}", journal = j-INFO-PROC-LETT, volume = "14", number = "5", pages = "238--238", day = "23", month = jul, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "94B45", MRnumber = "83m:94021", bibdate = "Sat Apr 11 12:24:20 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See \cite{Mauceri:1981:FCC}.", acknowledgement = ack-nhfb, fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", } @Article{Luccio:1982:LAD, author = "F. Luccio and L. Pagli", title = "A linear algorithm to determine minimal spanning forests in chain graphs", journal = j-INFO-PROC-LETT, volume = "15", number = "1", pages = "1--4", day = "19", month = aug, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E10 (05C70)", MRnumber = "83m:68122", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics)", corpsource = "Istituto di Sci. dell'Informazione, Univ. of Pisa, Pisa, Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "chain graphs; edges; graph theory; linear algorithm; minimal spanning forests; stars; subgraph", treatment = "T Theoretical or Mathematical", } @Article{Rytter:1982:NTW, author = "Wojciech Rytter", title = "A note on two-way nondeterministic pushdown automata", journal = j-INFO-PROC-LETT, volume = "15", number = "1", pages = "5--9", day = "19", month = aug, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68D05 (03D05)", MRnumber = "83m:68098", MRreviewer = "Akira Nakamura", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory)", corpsource = "Inst. of Informatics, Warsaw Univ., Warszawa, Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "finite automata; input heads; matrices; random access machine; time complexity; two-way nondeterministic pushdown automata", treatment = "T Theoretical or Mathematical", } @Article{Bermond:1982:TLG, author = "J.-C. Bermond and C. Delorme and J.-J. Quisquater", title = "Tables of large graphs with given degree and diameter", journal = j-INFO-PROC-LETT, volume = "15", number = "1", pages = "10--13", day = "19", month = aug, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "05C30 (68E10 94C15)", MRnumber = "84a:05038", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C5620 (Computer networks and techniques)", corpsource = "Univ. de Paris-Sud, Orsay, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "computer networks; edge set; graph theory; interconnection networks; large graphs; network architecture; undirected graph; vertex set", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Stockmeyer:1982:NCS, author = "Larry J. Stockmeyer and Vijay V. Vazirani", title = "{NP}-completeness of some generalizations of the maximum matching problem", journal = j-INFO-PROC-LETT, volume = "15", number = "1", pages = "14--19", day = "19", month = aug, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25 (03D15 05C35)", MRnumber = "84b:68049", MRreviewer = "Bernard M. E. Moret", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Math. Sci. Dept., IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "communication network testing; computational complexity; decision problem; graph theory; maximum matching problem; NP-completeness", treatment = "T Theoretical or Mathematical", } @Article{Bron:1982:MMU, author = "C. Bron and E. J. Dijkstra and S. D. Swierstra", title = "A memory management unit for the optimal exploitation of a small address space", journal = j-INFO-PROC-LETT, volume = "15", number = "1", pages = "20--22", day = "19", month = aug, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation); C6150J (Operating systems)", corpsource = "Dept. of Appl. Maths., Twente Univ. of Technol., Enschede, Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "address mapping; memory management unit; optimal exploitation; OS; segmentation; shared address space; small address space; storage management; storage management and garbage collection; virtual memory", treatment = "P Practical", } @Article{Leung:1982:ODR, author = "C. H. C. Leung", title = "Optimal database reorganisation: some practical difficulties", journal = j-INFO-PROC-LETT, volume = "15", number = "1", pages = "23--27", day = "19", month = aug, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C6160 (Database management systems (DBMS))", corpsource = "Dept. of Computer Sci., Univ. of Reading, Reading, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "database management systems; database reorganisation; DBMS; file structure; performance measurement; simulation", treatment = "P Practical", } @Article{Syslo:1982:LAR, author = "Maciej M. Sys{\l}o", title = "A labeling algorithm to recognize a line digraph and output its root graph", journal = j-INFO-PROC-LETT, volume = "15", number = "1", pages = "28--30", day = "19", month = aug, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E10 (05C20 68C25)", MRnumber = "83k:68066", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics)", corpsource = "Computer Sci. Dept., Washington State Univ., Pullman, WA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "graph theory; labeling algorithm; line digraph; root graph", treatment = "T Theoretical or Mathematical", } @Article{Greenberg:1982:EPA, author = "Albert C. Greenberg and Richard E. Ladner and Michael S. Paterson and Zvi Galil", title = "Efficient Parallel Algorithms for Linear Recurrence Computation", journal = j-INFO-PROC-LETT, volume = "15", number = "1", pages = "31--35", day = "19", month = aug, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C05 (03D15)", MRnumber = "84i:68045", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4190 (Other numerical methods)", corpsource = "Dept. of Computer Sci., Univ. of Washington, Seattle, WA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "arithmetic circuit; field; linear recurrence computation; matrix multiplication; numerical analysis; parallel algorithms; parallel processing; semiring", treatment = "T Theoretical or Mathematical", } @Article{Winkler:1982:CMD, author = "Peter M. Winkler", title = "On computability of the mean deviation", journal = j-INFO-PROC-LETT, volume = "15", number = "1", pages = "36--38", day = "19", month = aug, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C30", MRnumber = "84a:68043", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Dept. of Maths., Emory Univ., Atlanta, GA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "computability; computability and decidability; computational complexity; mean deviation; statistical analysis", treatment = "T Theoretical or Mathematical", } @Article{Culik:1982:NST, author = "Karel {Culik, II} and Derick Wood", title = "A note on some tree similarity measures", journal = j-INFO-PROC-LETT, volume = "15", number = "1", pages = "39--42", day = "19", month = aug, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E10 (05C05)", MRnumber = "83k:68059", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics)", corpsource = "Dept. of Computer Sci., Univ. of Waterloo, Waterloo, Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "dendrograms; distance measure; parsers; search trees; string-to-string correction problem; syntax-error repairing; tree similarity measures; trees (mathematics); unlabelled trees", treatment = "T Theoretical or Mathematical", } @Article{Levy:1982:ILS, author = "Leon S. Levy", title = "An improved list-searching algorithm", journal = j-INFO-PROC-LETT, volume = "15", number = "1", pages = "43--45", day = "19", month = aug, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E05 (68C05)", MRnumber = "83k:68055", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C6130 (Data handling techniques)", corpsource = "Bell Labs., Whippany, NJ, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "detecting cycles; linear list; list processing; list-searching algorithm", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Manacher:1982:SFA, author = "G. K. Manacher", title = "Steady-paced-output and fractional-on-line algorithms on a {RAM}", journal = j-INFO-PROC-LETT, volume = "15", number = "2", pages = "47--52", day = "6", month = sep, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Dept. of Math., Statistics and Computer Sci., Univ. of Illinois, Chicago, IL, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "algorithm theory; fractional-on-line algorithms; real-time algorithm; steady-paced", treatment = "T Theoretical or Mathematical", } @Article{Eastman:1982:PSN, author = "C. M. Eastman and M. Zemankova", title = "Partially Specified Nearest Neighbor Searches Using $k$-$d$ Trees", journal = j-INFO-PROC-LETT, volume = "15", number = "2", pages = "53--56", day = "6", month = sep, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E05 (05C05 68H05)", MRnumber = "83k:68053", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory); C6160 (Database management systems (DBMS))", corpsource = "Dept. of Maths. and Computer Sci., Florida State Univ., Tallahassee, FL, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "$k$-$d$ trees; computational complexity; computer programming; database management systems; nearest neighbor query; nearest neighbor searches; partially specified; searching; time complexity; trees (mathematics)", notes = "nicht weiter spannend and Unterscheidung: best match - nearest neighbour and nicht f{\"u}r Text-Retrieval", treatment = "T Theoretical or Mathematical", } @Article{Jouannaud:1982:MO, author = "Jean Pierre Jouannaud and Pierre Lescanne", title = "On Multiset Orderings", journal = j-INFO-PROC-LETT, volume = "15", number = "2", pages = "57--63", day = "6", month = sep, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68B10 (06A10)", MRnumber = "83m:68019", MRreviewer = "Henner Kr{\"o}ger", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "721; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Centre de Recherche en Informatique de Nancy, Nancy, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; Dershowitz-Manna ordering; monotonicity; multiset orderings; programming theory; set theory; well-founded orderings", treatment = "T Theoretical or Mathematical", } @Article{Walsh:1982:THR, author = "T. R. Walsh", title = "The {Towers of Hanoi} revisited: moving the rings by counting the moves", journal = j-INFO-PROC-LETT, volume = "15", number = "2", pages = "64--67", day = "6", month = sep, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C05", MRnumber = "83j:68039", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C7310 (Mathematics computing)", corpsource = "Dept. of Computer Sci., Univ. of Western Ontario, London, Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "artificial intelligence; iterative methods; n-ring Towers of Hanoi; non-recursive algorithm; Towers of Hanoi", treatment = "P Practical", } @Article{Main:1982:PCF, author = "Michael G. Main", title = "Permutations are not context-free: an application of the {Interchange Lemma}", journal = j-INFO-PROC-LETT, volume = "15", number = "2", pages = "68--71", day = "6", month = sep, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68F05", MRnumber = "83m:68139", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Computer Sci., Washington State Univ., Pullman, WA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "context-free languages; Interchange Lemma; nonempty string; permutation; permutation-containing strings", treatment = "T Theoretical or Mathematical", } @Article{Goldberg:1982:ATA, author = "Allen Goldberg and Paul Purdom and Cynthia Brown", title = "Average Time Analyses of Simplified {Davis--Putnam} Procedures", journal = j-INFO-PROC-LETT, volume = "15", number = "2", pages = "72--75", day = "6", month = sep, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25 (03B05 03B35 03D15)", MRnumber = "84d:68038a", MRreviewer = "Gh. Grigora{\cedla{s}}", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See also corrigendum \cite{Goldberg:1983:CAT}.", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Computer Sci. Dept., Indiana Univ., Bloomington, IN, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer metatheory --- Programming Theory; computer programming; Davis--Putnam procedures; polynomial average behavior; programming theory; pure literal rule; satisfiability problem; time analyses", treatment = "T Theoretical or Mathematical", } @Article{Lukaszewicz:1982:UG, author = "Leon {\L}ukaszewicz", title = "Universal {Grammars}", journal = j-INFO-PROC-LETT, volume = "15", number = "2", pages = "76--80", day = "6", month = sep, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68F05", MRnumber = "83k:68074", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "721; C4210 (Formal logic); C6140 (Programming languages)", corpsource = "Inst. of Computer Sci., Polish Acad. of Sci., Warszawa, Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Attribute Grammars; automata theory; formal specification of syntaxes; grammars; practical applications; Production Systems; programming languages; semantics of programming languages; Transformational Grammars; UGs; Universal Grammars; Van Wijngaarden Grammars; Vienna Definition Language", treatment = "A Application; T Theoretical or Mathematical", } @Article{Wegener:1982:BPA, author = "Ingo Wegener", title = "Best possible asymptotic bounds on the depth of monotone functions in multivalued logic", journal = j-INFO-PROC-LETT, volume = "15", number = "2", pages = "81--83", day = "6", month = sep, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "03B50 (03D15 68C20)", MRnumber = "84c:03049", MRreviewer = "V. B. Alekseev", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Johann Wolfgang Goethe-Univ., Frankfurt/Main, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "asymptotic bounds; m-valued logic; many-valued logics; monotone functions; multivalued logic", treatment = "T Theoretical or Mathematical", } @Article{Balcazar:1982:NTL, author = "J. L. Balcazar and J. Diaz", title = "A note on a theorem by {Ladner}", journal = j-INFO-PROC-LETT, volume = "15", number = "2", pages = "84--86", day = "6", month = sep, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25 (03D05 03D15)", MRnumber = "84d:68035", MRreviewer = "Gh. Grigora{\cedla{s}}", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Facultat d'Informatica, Univ. Politecnica de Barcelona, Barcelona, Spain", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "formal languages; Ladner; languages; non-comparable languages; NP; NP-complete; P", treatment = "T Theoretical or Mathematical", } @Article{Schoor:1982:FAS, author = "Amir Schoor", title = "Fast Algorithm for Sparse Matrix Multiplication", journal = j-INFO-PROC-LETT, volume = "15", number = "2", pages = "87--89", day = "6", month = sep, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "65F30", MRnumber = "83k:65031", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; B0290H (Linear algebra); C4140 (Linear algebra); C4240 (Programming and algorithm theory)", corpsource = "School of Maths., Tel Aviv Univ., Tel Aviv, Israel", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computational complexity; computer programming; fast algorithm; matrix algebra; sparse matrices; sparse matrix multiplication; time complexity", treatment = "T Theoretical or Mathematical", } @Article{Spyratos:1982:HTD, author = "Michael Spyratos", title = "A homomorphism theorem for data base mappings", journal = j-INFO-PROC-LETT, volume = "15", number = "3", pages = "91--96", day = "11", month = oct, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68B15", MRnumber = "83m:68046", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C6160 (Database management systems (DBMS))", corpsource = "Dept. of Systems Engng. and Computing Sci., Carleton Univ., Ottawa, Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "data base mappings; data base updates; database management systems; DBMS; equivalence classes; homomorphism theorem; integrity constraints; lossless decompositions; view definition", treatment = "P Practical", } @Article{Nijholt:1982:RBG, author = "Anton Nijholt", title = "On the relationship between the {${\rm LL}(k)$} and {${\rm LR}(k)$} grammars", journal = j-INFO-PROC-LETT, volume = "15", number = "3", pages = "97--101", day = "11", month = oct, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68F05", MRnumber = "83k:68076", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Informatics, Faculty of Sci., Nijmegen Univ., Nigmegen, Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "formal languages; grammars; LL(k) grammars; LR(k) grammars; parsing", treatment = "T Theoretical or Mathematical", } @Article{Rytter:1982:TCU, author = "Wojciech Rytter", title = "Time complexity of unambiguous path systems", journal = j-INFO-PROC-LETT, volume = "15", number = "3", pages = "102--104", day = "11", month = oct, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C05 (68D05 68F05)", MRnumber = "83m:68062", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4220 (Automata theory)", corpsource = "Inst. of Informatics, Warsaw Univ., Warszawa, Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "2dpda's; complexity; context-free languages; finite automata; pushdown automata; schema; unambiguous path systems", treatment = "P Practical", } @Article{Reddy:1982:RCC, author = "P. G. Reddy and S. Bhalla and B. E. Prasad", title = "Robust, centralized certifier based concurrency control for distributed databases", journal = j-INFO-PROC-LETT, volume = "15", number = "3", pages = "105--110", day = "11", month = oct, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C6160B (Distributed databases)", corpsource = "Computer Centre, Indian Inst. of Technol., New Delhi, India", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "certifiers; concurrency control; database management systems; DBMS; distributed databases; distributed processing; read write conflict; restarts; synchronization", treatment = "P Practical", } @Article{Korczynski:1982:CCD, author = "Waldemar Korczy{\'n}ski and J{\'o}zef Winkowski", title = "A communication concept for distributed systems", journal = j-INFO-PROC-LETT, volume = "15", number = "3", pages = "111--114", day = "11", month = oct, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68B20", MRnumber = "83k:68016", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C6150J (Operating systems)", corpsource = "Zaklad Matematyki Wyzsza Szkola Pedagogiczna, Czestochowa, Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "communication concept; distributed processing; distributed systems; indivisibility; local memories; operating systems (computers); OS; protocols", treatment = "P Practical", } @Article{Cheung:1982:SME, author = "To-Yat Cheung", title = "A statistical model for estimating the number of records in a relational database", journal = j-INFO-PROC-LETT, volume = "15", number = "3", pages = "115--118", day = "11", month = oct, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C6160D (Relational databases)", corpsource = "Dept. of Computer Sci., Univ. of Ottawa, Ottawa, Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "cardinality; database management systems; DBMS; join; number of records; projection; query processing; relational database; statistical model; storage costs", treatment = "P Practical", } @Article{Gonzalez:1982:SNL, author = "Teofilo F. Gonzalez and Donald B. Johnson", title = "Sorting numbers in linear expected time and optimal extra space", journal = j-INFO-PROC-LETT, volume = "15", number = "3", pages = "119--124", day = "11", month = oct, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E05", MRnumber = "83k:68054", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C6130 (Data handling techniques)", corpsource = "Math. Sci. Program, Univ. of Texas, Dallas, TX, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "linear expected time; optimal extra space; sorting; sorts", treatment = "P Practical", } @Article{Imai:1982:FCC, author = "Hiroshi Imai", title = "Finding connected components of an intersection graph of squares in the {Euclidean} plane", journal = j-INFO-PROC-LETT, volume = "15", number = "3", pages = "125--128", day = "11", month = oct, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E10 (05C10 68C25)", MRnumber = "83k:68060", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Math. Engng. and Instrumentation Phys., Faculty of Engng., Univ. of Tokyo, Tokyo, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "computational complexity; connected components; Euclidean plane; graph theory; intersection graph; polygons; square problem; squares", treatment = "T Theoretical or Mathematical", } @Article{Dijkstra:1982:ITA, author = "Edsger W. Dijkstra and A. J. M. {van Gasteren}", title = "An Introduction to Three Algorithms for Sorting in Situ", journal = j-INFO-PROC-LETT, volume = "15", number = "3", pages = "129--134", day = "11", month = oct, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E05", MRnumber = "83k:68052", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C6130 (Data handling techniques)", corpsource = "Burroughs Corp., Nuenen, Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "heapsort; insertion sort; Insertion sort, heapsort, smoothsort; smoothsort; sorting", treatment = "P Practical", } @Article{Becker:1982:PAV, author = "M. Becker and W. Degenhardt and J. Doenhardt and S. Hertel and G. Kaninke and W. Keber and K. Mehlhorn and S. N{\"a}her and H. Rohnert and T. Winter", title = "A probabilistic algorithm for vertex connectivity of graphs", journal = j-INFO-PROC-LETT, volume = "15", number = "3", pages = "135--136", day = "11", month = oct, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E10 (05C40)", MRnumber = "83k:68056", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics)", corpsource = "Angewandte Math. und Informatik, Univ. des Saarlandes, Saarbrucken, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "error probability; graph theory; graphs; probabilistic algorithm; undirected graph; vertex connectivity", } @Article{Morris:1982:ACG, author = "F. L. Morris", title = "Another compacting garbage collector", journal = j-INFO-PROC-LETT, volume = "15", number = "4", pages = "139--142", day = "31", month = oct, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C6150J (Operating systems)", corpsource = "School of Computer and Information Sci., Syracuse Univ., Syracuse, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "compacting garbage collector; linear-time solutions; list processing; nodes; pointers; roots; segments; storage management; threading", treatment = "P Practical", } @Article{Bergstra:1982:TTA, author = "J. A. Bergstra and J. V. Tucker", title = "Two Theorems About the Completeness of {Hoare}'s Logic", journal = j-INFO-PROC-LETT, volume = "15", number = "4", pages = "143--149", day = "31", month = oct, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68B10 (03B45)", MRnumber = "84f:68008", MRreviewer = "Stephen L. Bloom", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Dept. of Computer Sci., Univ. of Leiden, Leiden, Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "completeness; completion theorem; computer metatheory --- Programming Theory; computer programming; data type specifications; Hoare's logic; normal form theorem; partial correctness; Peano arithmetic; programming theory; refinements; strongest post condition; while- programs; while-programs", treatment = "T Theoretical or Mathematical", } @Article{Maluszynski:1982:GU, author = "Jan Ma{\l}uszy{\'n}ski and J{\"o}rgen Fischer Nilsson", title = "Grammatical Unification", journal = j-INFO-PROC-LETT, volume = "15", number = "4", pages = "150--158", day = "31", month = oct, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q50 (03B35 18C10)", MRnumber = "85a:68102", MRreviewer = "Bernard M. E. Moret", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "721; 723; C4210 (Formal logic)", corpsource = "Software Systems Res. Center, Linkoping Univ., Linkoping, Sweden", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory --- Context Free Grammars; computer metatheory --- Programming Theory; computer programming; context free grammars; context-free grammars; Horn clause logic programming; logic programming; Prolog systems; resolution logic; symbolic structures; theorem proving; unification", treatment = "T Theoretical or Mathematical", } @Article{Mostowski:1982:DSA, author = "A. W{\l}odzimierz Mostowski", title = "Determinancy of sinking automata on infinite trees and inequalities between various {Rabin}'s pair indices", journal = j-INFO-PROC-LETT, volume = "15", number = "4", pages = "159--163", day = "31", month = oct, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68D05", MRnumber = "83k:68045", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory)", corpsource = "Univ. of Gdansk, Gdynia, Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "automata theory; deterministic automata; inequalities; infinite trees; Rabin's pair indices; sinking automata; trees (mathematics)", treatment = "T Theoretical or Mathematical", } @Article{Inoue:1982:NAL, author = "Katsushi Inoue and Itsuo Takanami and Hiroshi Taniguchi", title = "A note on alternating on-line {Turing} machines", journal = j-INFO-PROC-LETT, volume = "15", number = "4", pages = "164--168", day = "31", month = oct, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C40", MRnumber = "83k:68043", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "721; C4220 (Automata theory)", corpsource = "Dept. of Electronics, Yamaguchi Univ., Ube, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "alternating on-line Turing machines; automata theory; complexity measure; computational complexity; deterministic Turing machines; leaf-size; parallel computation; parallel processing; Turing machines", treatment = "T Theoretical or Mathematical", } @Article{Hoshi:1982:CEM, author = "Mamoru Hoshi and Toshitsugu Yuba", title = "A counter example to a monotonicity property of $k$-$d$ trees", journal = j-INFO-PROC-LETT, volume = "15", number = "4", pages = "169--173", day = "31", month = oct, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E05", MRnumber = "83m:68111", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C6120 (File organisation)", corpsource = "Faculty of Engng., Chiba Univ., Chiba, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "$k$-$d$ trees; computer programming --- Algorithms; data processing; data structures; external nodes; monotonicity property; one-dimensional binary search tree; partition; trees (mathematics)", treatment = "P Practical", } @Article{Ceri:1982:SMN, author = "S. Ceri and G. Pelagatti", title = "A solution method for the non-additive resource allocation problem in distributed system design", journal = j-INFO-PROC-LETT, volume = "15", number = "4", pages = "174--178", day = "31", month = oct, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "722; 723; C6160B (Distributed databases)", corpsource = "Istituto di Elettrotecnica ed Elettronica, Politecnico di Milano, Milano, Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer systems, digital; database management systems; DBMS; distributed database system; distributed processing; distributed system design; files; graph; graph theory; maximum flow-minimum cut; optimization model; resource allocation; resource allocation problem", treatment = "P Practical", } @Article{Goh:1982:RPE, author = "L. Goh and D. Rotem", title = "Recognition of Perfect Elimination Bipartite Graphs", journal = j-INFO-PROC-LETT, volume = "15", number = "4", pages = "179--182", day = "31", month = oct, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E10 (05C70)", MRnumber = "84a:68057", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; 921; B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics)", corpsource = "Dept. of Computer Sci., Univ. of Waterloo, Waterloo, Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "bipartite graphs; computer programming --- Subroutines; Gaussian elimination; graph theory; mathematical techniques; perfect elimination; perfect elimination bipartite graphs; recognition algorithm; sparse matrices", treatment = "T Theoretical or Mathematical", } @Article{Sharir:1982:FCS, author = "Micha Sharir", title = "Fast Composition of Sparse Maps", journal = j-INFO-PROC-LETT, volume = "15", number = "4", pages = "183--185", day = "31", month = oct, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C05 (68B15)", MRnumber = "83k:68021", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory)", corpsource = "School of Math. Sci., Tel Aviv Univ., Tel Aviv, Israel", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm theory; analysis of algorithms; composition; computer programming --- Subroutines; data processing; data structures; sparse maps", treatment = "T Theoretical or Mathematical", } @Article{Slater:1982:LAN, author = "Peter J. Slater", title = "A linear algorithm for the number of degree constrained subforests of a tree", journal = j-INFO-PROC-LETT, volume = "15", number = "4", pages = "186--188", day = "31", month = oct, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E10 (05C05 05C30)", MRnumber = "84a:68065", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Math. Dept., Univ. of Alabama, Huntsville, AL, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "algorithm theory; b-matching; degree constrained subforests; linear algorithm; linear-time algorithm; positive integer-valued function; spanning subforests; tree; trees (mathematics); vertex disjoint paths; vertices", treatment = "T Theoretical or Mathematical", } @Article{Leipala:1982:OMI, author = "Timo Leip{\"a}l{\"a}", title = "On Optimal Multilevel Indexed Sequential Files", journal = j-INFO-PROC-LETT, volume = "15", number = "5", pages = "191--195", day = "10", month = dec, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E05", MRnumber = "83m:68112", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C6120 (File organisation)", corpsource = "Inst. for Appl. Math., Univ. of Turku, Turku, Finland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "block; data processing; file organisation; index searching; indices; jump searching; key value; optimal design; static multilevel indexed sequential files; target key", treatment = "P Practical", } @Article{Highnam:1982:EPC, author = "P. T. Highnam", title = "The ears of a polygon", journal = j-INFO-PROC-LETT, volume = "15", number = "5", pages = "196--198", day = "10", month = dec, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "52-04 (68C05)", MRnumber = "84b:52002", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4290 (Other computer theory)", corpsource = "Dept. of Computer Sci., Carnegie-Mellon Univ., Pittsburgh, PA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "computation theory; computational geometry; computer metatheory; ears; fast algorithm; polygon; triangulation", treatment = "T Theoretical or Mathematical", } @Article{Szepietowski:1982:FPA, author = "Andrzej Szepietowski", title = "A finite $5$-pebble-automaton can search every maze", journal = j-INFO-PROC-LETT, volume = "15", number = "5", pages = "199--204", day = "10", month = dec, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68D20", MRnumber = "84e:68055", MRreviewer = "I. Mezn{\'\i}k", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory)", corpsource = "Inst. of Math., Tech. Univ. of Gdansk, Gdansk, Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "finite 5-pebble-automaton; finite automata; finite automaton; labyrinth; maze", treatment = "T Theoretical or Mathematical", } @Article{Wegner:1982:SLL, author = "Lutz M. Wegner", title = "Sorting a linked list with equal keys", journal = j-INFO-PROC-LETT, volume = "15", number = "5", pages = "205--208", day = "10", month = dec, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E05", MRnumber = "84b:68082", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6130 (Data handling techniques)", corpsource = "Inst. f{\"u}r Angewandte Informatik und Formale Beschreibungsverfahren, Univ. Karlsruhe, Karlsruhe, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "abstract algorithm; algorithm analysis; algorithm theory; equal keys; linked list; Quicksort; sorting; TRISORT", treatment = "P Practical", } @Article{Lueker:1982:DSD, author = "George S. Lueker and Dan E. Willard", title = "A data structure for dynamic range queries", journal = j-INFO-PROC-LETT, volume = "15", number = "5", pages = "209--213", day = "10", month = dec, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68B15", MRnumber = "84b:68015", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation); C6160 (Database management systems (DBMS))", corpsource = "Dept. of Information and Computer Sci., Univ. of California, Irvine, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "balanced trees; data structure; data structures; database management systems; DBMS; deletions; dynamic range queries; file organisation; insertions; retrievals; searching; updates", treatment = "P Practical", } @Article{Motoki:1982:NUB, author = "Tatsuya Motoki", title = "A note on upper bounds for the selection problem", journal = j-INFO-PROC-LETT, volume = "15", number = "5", pages = "214--219", day = "10", month = dec, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E05 (05A05 68C25)", MRnumber = "84c:68049", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6130 (Data handling techniques)", corpsource = "Dept. of Information Sci., Ibaraki Univ., Hitachi, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "comparisons; computational complexity; optimum sorting; selection problem; sorting; upper bounds; worst-case minimum", treatment = "P Practical", } @Article{Lewis:1982:UCC, author = "Harry R. Lewis and Richard Statman", title = "Unifiability is complete for co-{NLogSpace}", journal = j-INFO-PROC-LETT, volume = "15", number = "5", pages = "220--222", day = "10", month = dec, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25 (68E10)", MRnumber = "83m:68081", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6120 (File organisation)", corpsource = "Aiken Computation Lab., Harvard Univ., Cambridge, MA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "co-NLogSpace; computational complexity; data structures; unification algorithm", treatment = "T Theoretical or Mathematical", } @Article{Wang:1982:NHT, author = "Patrick Shen-pei Wang", title = "A new hierarchy of two-dimensional array languages", journal = j-INFO-PROC-LETT, volume = "15", number = "5", pages = "223--226", day = "10", month = dec, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68F05", MRnumber = "83m:68143", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "721; C4210 (Formal logic)", corpsource = "Wang Labs., Lowell, MA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "array patterns; automata theory; Extended Regular Array Languages; formal languages; grammars; Linear Array Languages; two-dimensional array languages", treatment = "T Theoretical or Mathematical", } @Article{Tamminen:1982:EHO, author = "Markku Tamminen", title = "Extendible Hashing with Overflow", journal = j-INFO-PROC-LETT, volume = "15", number = "5", pages = "227--232", day = "10", month = dec, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68B15", MRnumber = "83m:68047", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", abstract = "A strategy of including an overflow capability into extendable hashing (EXHASH) is defined. It is shown that both an O(1) expected access cost and an O(N) expected storage cost are achieved by using this mechanism.", acknowledgement = ack-nhfb, classification = "C6130 (Data handling techniques)", corpsource = "Lab. of Information Processing Sci., Helsinki Univ. of Technol., Espoo, Finland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer programming; data handling; expected access cost; expected storage cost; hashing; overflow; performance analysis; table lookup", treatment = "P Practical", } @Article{Stout:1982:DSL, author = "Quentin F. Stout", title = "Drawing Straight Lines with a Pyramid Cellular Automaton", journal = j-INFO-PROC-LETT, volume = "15", number = "5", pages = "233--237", day = "10", month = dec, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68D20 (68G10)", MRnumber = "84a:68047", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C4220 (Automata theory)", corpsource = "Math. Sci., State Univ. of New York, Binghamton, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; computer programming --- Algorithms; digitized picture; efficient algorithm; exact line problem; finite automata; image processing; picture processing; pyramid cellular automaton; self organising automata; straight line", treatment = "T Theoretical or Mathematical", } @Article{Farley:1982:DMC, author = "Arthur M. Farley and Andrzej Proskurowski", title = "Directed Maximal-Cut Problems", journal = j-INFO-PROC-LETT, volume = "15", number = "5", pages = "238--241", day = "10", month = dec, year = "1982", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E10 (05C20 05C35 68C25)", MRnumber = "83m:68120", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Computer and Information Sci., Univ. of Oregon, Eugene, OR, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "acyclic directed graphs; algorithm theory; computer programming --- Algorithms; directed graphs; directed trees; mathematical techniques; maximal-cut problems; NP-complete", treatment = "T Theoretical or Mathematical", } @Article{MeyeraufderHeide:1983:ICC, author = "Friedhelm {Meyer Auf Der Heide}", title = "Infinite Cube-Connected Cycles", journal = j-INFO-PROC-LETT, volume = "16", number = "1", pages = "1--2", day = "24", month = jan, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68B20", MRnumber = "84e:68024", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C6150J (Operating systems)", corpsource = "Fachbereich Informatik, Johann Wolfgang Goethe-Univ., Frankfurt am Main, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer systems, digital; cube-connected cycles-networks; infinite network; parallel computation; parallel processing", treatment = "P Practical", } @Article{Bertossi:1983:PSP, author = "Alan A. Bertossi and Maurizio A. Bonuccelli", title = "Preemptive Scheduling of Periodic Jobs in Uniform Multiprocessor Systems", journal = j-INFO-PROC-LETT, volume = "16", number = "1", pages = "3--6", day = "24", month = jan, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C15", MRnumber = "84e:68032", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "722; 723; C4290 (Other computer theory); C6150J (Operating systems)", corpsource = "Istituto di Sci. dell'Informazione, Univ. di Pisa, Pisa, Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer systems, digital; job deadline; multiprocessing programs; periodic jobs; preemptive scheduling; release time; scheduling; uniform multiprocessor systems", treatment = "T Theoretical or Mathematical", } @Article{Ehrenfeucht:1983:SCL, author = "A. Ehrenfeucht and G. Rozenberg", title = "On the Subword Complexity of Locally Catenative {DOL} Languages", journal = j-INFO-PROC-LETT, volume = "16", number = "1", pages = "7--9", day = "24", month = jan, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q45", MRnumber = "85d:68043", MRreviewer = "I. Hal Sudborough", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, annote = "This paper throughout has `DOL' (Dee Oh Ell) instead of `D0L' (Dee Zero Ell), but the latter seems to be correct: even the author's next paper \cite{Ehrenfeucht:1983:SCF} uses the latter form.", classification = "721; C4210 (Formal logic)", corpsource = "Dept. of Computer Sci., Univ. of Colorado, Boulder, CO, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; D0L; formal languages; locally catenative D0L languages; positive integers; subword complexity", treatment = "T Theoretical or Mathematical", } @Article{Kantabutra:1983:TSC, author = "Vitit Kantabutra", title = "Traveling salesman cycles are not always subgraphs of {Vorono{\u{\i}}} duals", journal = j-INFO-PROC-LETT, volume = "16", number = "1", pages = "11--12", day = "24", month = jan, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E10 (05C38)", MRnumber = "84e:68073", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4290 (Other computer theory)", corpsource = "Dept. of Electrical Engng., Johns Hopkins Univ., Baltimore, MD, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "computation theory; computational geometry; computer metatheory; Euclidean traveling salesman cycle; graph theory; subgraph; Voronoi duals", treatment = "T Theoretical or Mathematical", } @Article{Fagin:1983:ADF, author = "Ronald Fagin and Moshe Y. Vardi", title = "{Armstrong} Databases for Functional and Inclusion Dependencies", journal = j-INFO-PROC-LETT, volume = "16", number = "1", pages = "13--19", day = "24", month = jan, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68H05 (68B15)", MRnumber = "84c:68086", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C6160 (Database management systems (DBMS))", corpsource = "IBM Res. Lab., San Jose, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Armstrong databases; database management systems; database systems; DBMS; direct product; faithfulness; finite databases; functional dependencies; inclusion dependencies; logic; tuples", treatment = "P Practical", } @Article{Perko:1983:RDS, author = "A. Perko", title = "A representation of disjoint sets with fast initialization", journal = j-INFO-PROC-LETT, volume = "16", number = "1", pages = "21--21", day = "24", month = jan, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C6110 (Systems analysis and programming); C6120 (File organisation)", corpsource = "Inst. for Math., Univ. of Jyvaskyla, Jyvaskyla, Finland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "compilers; data structures; disjoint sets; fast initialization; FORTRAN; programming", treatment = "P Practical", } @Article{Clarkson:1983:MGA, author = "Kenneth L. Clarkson", title = "A modification of the greedy algorithm for vertex cover", journal = j-INFO-PROC-LETT, volume = "16", number = "1", pages = "23--25", day = "24", month = jan, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E10 (05C35)", MRnumber = "84c:68052", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Computer Sci., Stanford Univ., Stanford, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "algorithm theory; combinatorial problems; computational complexity; general weighted graphs; graph theory; greedy algorithm; performance ratio; vertex cover", treatment = "T Theoretical or Mathematical", } @Article{Latteux:1983:LS, author = "Michel Latteux", title = "On a language without star", journal = j-INFO-PROC-LETT, volume = "16", number = "1", pages = "27--30", day = "24", month = jan, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68F05", MRnumber = "84f:68059", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Univ. de Lille 1, Villeneuve d'Ascq, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "AFL; context free languages; context-free languages; formal languages; language; rational cone; star operation", treatment = "P Practical", } @Article{Metivier:1983:ARS, author = "Yves M{\'e}tivier", title = "About the rewriting systems produced by the {Knuth Bendix} completion algorithm", journal = j-INFO-PROC-LETT, volume = "16", number = "1", pages = "31--34", day = "24", month = jan, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C01", MRnumber = "84c:68020", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Univ. de Bordeaux I, Talence, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "algorithm theory; confluent; F algebra; Knuth Bendix completion algorithm; nonetherian; proper; rewriting systems", treatment = "T Theoretical or Mathematical", } @Article{Guting:1983:SOP, author = "Ralf Hartmut G{\"u}ting", title = "Stabbing {$C$}-Oriented Polygons", journal = j-INFO-PROC-LETT, volume = "16", number = "1", pages = "35--40", day = "24", month = jan, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "52-04 (68C25)", MRnumber = "84e:52002", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Lehrstuhl Informatik VI, Univ. Dortmund, Dortmund, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "c-oriented objects; computational complexity; computational geometry; computer programming; polygons; stabbing number; time optimal algorithms", treatment = "T Theoretical or Mathematical", } @Article{Wegener:1983:RMF, author = "Ingo Wegener", title = "Relating monotone formula size and monotone depth of {Boolean} functions", journal = j-INFO-PROC-LETT, volume = "16", number = "1", pages = "41--42", day = "24", month = jan, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25 (94C10)", MRnumber = "84c:68035", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Fachbereich Informatik, Johann Wolfgang Goethe-Univ., Frankfurt am Main, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "binary functions; Boolean functions; Boolean network complexity; complexity measures; computational complexity; formula size; logarithm; monotone basis; monotone depth; monotone formula size", treatment = "T Theoretical or Mathematical", } @Article{Lester:1983:AAQ, author = "Lewis Neale Lester", title = "Accuracy of Approximating Queueing Network Departure Processes with Independent Renewal Processes", journal = j-INFO-PROC-LETT, volume = "16", number = "1", pages = "43--48", day = "24", month = jan, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "722; 723; 922; B0240C (Queueing theory); C1140C (Queueing theory)", corpsource = "Aeronautical Res. Labs., Melbourne, Vic., Australia", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer systems, digital; diffusion models; independent renewal processes; interarrival time SCV; probability --- Queueing; queueing network departure processes; queueing theory; simulation results", treatment = "T Theoretical or Mathematical", } @Article{Jedrzejowicz:1983:ECR, author = "Joanna J{\polhk{e}}drzejowicz", title = "On the enlargement of the class of regular languages by the shuffle closure", journal = j-INFO-PROC-LETT, volume = "16", number = "2", pages = "51--54", day = "26", month = feb, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68F05", MRnumber = "84g:68061", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Inst. of Math., Univ. of Gdansk, Gdansk, Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "class; context sensitive languages; enumerable languages; flow languages; formal languages; lock; regular languages; shuffle closure; signal", treatment = "P Practical", } @Article{Hartmanis:1983:SS, author = "Juris Hartmanis", title = "On sparse sets in {${\rm NP}-{\rm P}$}", journal = j-INFO-PROC-LETT, volume = "16", number = "2", pages = "55--60", day = "26", month = feb, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q15 (03D15)", MRnumber = "85d:68029", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Computer Sci., Cornell Univ., Ithaca, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "complexity; formal languages; NP; set theory; sparse sets", treatment = "P Practical", } @Article{Allison:1983:SMC, author = "Lloyd Allison", title = "Stable Marriages by Coroutines", journal = j-INFO-PROC-LETT, volume = "16", number = "2", pages = "61--65", day = "26", month = feb, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C1290 (Applications of systems theory); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Computer Sci., Univ. of Western Australia, Nedlands, WA, Australia", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm theory; computer programming; coroutines; operations research; pairing problems; recursive algorithm; stable marriage problem", treatment = "T Theoretical or Mathematical", } @Article{Fraser:1983:GTC, author = "Christopher W. Fraser", title = "A generalization of two code ordering optimizations", journal = j-INFO-PROC-LETT, volume = "16", number = "2", pages = "67--70", day = "26", month = feb, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C6150C (Compilers, interpreters and other processors)", corpsource = "Dept. of Computer Sci., Univ. of Arizona, Tucson, AZ, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "branches; code ordering optimizations; code straightening; codes, symbolic; compilers; control structures; execution ordering; labels; loads; optimisation; program compilers; program counter loads; stores", treatment = "P Practical", } @Article{Eichholz:1983:OND, author = "S. Eichholz", title = "Optimal networks for distributing nonsequential programs", journal = j-INFO-PROC-LETT, volume = "16", number = "2", pages = "71--74", day = "26", month = feb, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C5620 (Computer networks and techniques); C6110 (Systems analysis and programming)", corpsource = "Inst. f{\"u}r Informatik, Tech. Univ. Munchen, Munich, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "application problems; computer networks; CONCURRENT PASCAL; CSP; digital computers; distributing nonsequential programs; DP; finite, undirected graph; graph theory; MESA; MODULA; parallel processing; parallelism; programming languages", treatment = "P Practical", } @Article{Chazelle:1983:DPO, author = "Bernard Chazelle", title = "A decision procedure for optimal polyhedron partitioning", journal = j-INFO-PROC-LETT, volume = "16", number = "2", pages = "75--78", day = "26", month = feb, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "52A15", MRnumber = "84m:52004", MRreviewer = "B. Sahoo", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Computer Sci., Carnegie-Mellon Univ., Pittsburgh, PA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "combinatorial argument; computability and decidability; computational geometry; decidability; decision procedure; geometric structure; optimal polyhedron partitioning; polygon", treatment = "T Theoretical or Mathematical", } @Article{Alpern:1983:KEU, author = "B. Alpern and F. B. Schneider", title = "Key exchange using keyless cryptography", journal = j-INFO-PROC-LETT, volume = "16", number = "2", pages = "79--81", day = "26", month = feb, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "B6120B (Codes); B6210L (Computer communications); C5620 (Computer networks and techniques); C6130 (Data handling techniques)", corpsource = "Dept. of Computer Sci., Cornell Univ., Ithaca, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "computer network; computer networks; cryptography; keyless cryptography; protocols; secret keys", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Hofri:1983:STH, author = "Micha Hofri", title = "Should the Two-Headed Disk Be Greedy? --- Yes, It Should", journal = j-INFO-PROC-LETT, volume = "16", number = "2", pages = "83--85", day = "26", month = feb, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C4290 (Other computer theory); C5320 (Digital storage); C6150J (Operating systems)", corpsource = "Dept. of Computer Sci., Technion-Israel Inst. of Technol., Haifa, Israel", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "data processing; magnetic disc and drum storage; mean seek time; movable arms; multihead disk; operating systems (computers); optimal anticipatory position; OS; scheduling; two headed disk; write requests", treatment = "P Practical", } @Article{Gusfield:1983:CED, author = "Dan Gusfield", title = "Connectivity and edge-disjoint spanning trees", journal = j-INFO-PROC-LETT, volume = "16", number = "2", pages = "87--89", day = "26", month = feb, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "05C40", MRnumber = "84e:05069", MRreviewer = "R. E. Pippert", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4290 (Other computer theory); C5620 (Computer networks and techniques)", corpsource = "Dept. of Computer Sci., Yale Univ., New Haven, CT, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "computer networks; edge connectivity; edge-disjoint spanning trees; graph theory; graph vulnerability; undirected graph", treatment = "T Theoretical or Mathematical", } @Article{Walsh:1983:ISB, author = "T. R. Walsh", title = "Iteration strikes back---at the cyclic {Towers} of {Hanoi}", journal = j-INFO-PROC-LETT, volume = "16", number = "2", pages = "91--93", day = "26", month = feb, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C05", MRnumber = "84g:68022", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Dept. of Computer Sci., Univ. of Western Ontario, London, Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "algorithm theory; cyclic order; cyclic Towers of Hanoi; iterative algorithm; pegs", treatment = "T Theoretical or Mathematical", } @Article{Ibaraki:1983:LCT, author = "T. Ibaraki and N. Katoh", title = "On-line computation of transitive closures of graphs", journal = j-INFO-PROC-LETT, volume = "16", number = "2", pages = "95--97", day = "26", month = feb, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E10 (05C20)", MRnumber = "84e:68071", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Appl. Math. and Phys., Kyoto Univ., Kyoto, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "algorithm theory; directed graphs; graphs; online computation; transitive closures", treatment = "T Theoretical or Mathematical", } @Article{Wood:1983:MDP, author = "Christopher R. Wood and Eduardo B. Fernandez and Tomas Lang", title = "Minimization of Demand Paging for the {LRU} Stack Model of Program Behavior", journal = j-INFO-PROC-LETT, volume = "16", number = "2", pages = "99--104", day = "26", month = feb, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68B20", MRnumber = "84d:68031", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory); C6150J (Operating systems)", corpsource = "Dept. of Electrical Engng., Univ. of Miami, Coral Gables, FL, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "allocated pages; computer programming; demand paging; fixed-space replacement algorithm; LRU stack model; minimization; optimization problem; page faults; probability distribution; program behavior; programming theory; storage allocation; VS", treatment = "T Theoretical or Mathematical", } @Article{Constable:1983:PPS, author = "Robert L. Constable", title = "Programs as proofs: a synopsis", journal = j-INFO-PROC-LETT, volume = "16", number = "3", pages = "105--112", day = "15", month = apr, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68B10 (03F99)", MRnumber = "84e:68009", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Computer Sci., Cornell Univ., Ithaca, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "constructive proofs; formal logic; PL/CV; precision; programming logics; programming methodology; programming theory; programs", treatment = "T Theoretical or Mathematical", } @Article{McGlinn:1983:SBT, author = "Robert J. McGlinn", title = "Is {SSS}$^*$ better than alpha-beta", journal = j-INFO-PROC-LETT, volume = "16", number = "3", pages = "113--120", day = "15", month = apr, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68R10", MRnumber = "85a:68151", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C1180 (Optimisation techniques); C1230 (Artificial intelligence)", corpsource = "Dept. of Computer Sci., Southern Illinois Univ., Carbondale, IL, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "alpha-beta; artificial intelligence; game tree; minimax techniques; minimax value; SSS*; trees (mathematics)", treatment = "T Theoretical or Mathematical", } @Article{Soisalon-Soininen:1983:CAC, author = "Eljas Soisalon-Soininen", title = "On computing approximate convex hulls", journal = j-INFO-PROC-LETT, volume = "16", number = "3", pages = "121--126", day = "15", month = apr, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "52-04 (52A10)", MRnumber = "84g:52001", MRreviewer = "V. Medek", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics)", corpsource = "Dept. of Computer Sci., Univ. of Helsinki, Helsinki, Finland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "approximate convex hulls; computing; linear time algorithm; planar approximation algorithm; point sets; set theory", treatment = "T Theoretical or Mathematical", } @Article{Rytter:1983:TCL, author = "Wojciech Rytter", title = "Time Complexity of Loop-Free Two-Way Pushdown Automata", journal = j-INFO-PROC-LETT, volume = "16", number = "3", pages = "127--129", day = "15", month = apr, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68F10 (68C25)", MRnumber = "84e:68098", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "721; C4210 (Formal logic); C4220 (Automata theory)", corpsource = "Inst. of Informatics, Warsaw Univ., Warszawa, Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; computational complexity; languages; loop-free two-way pushdown automata; nondeterministic pushdown automata; time complexity", treatment = "T Theoretical or Mathematical", } @Article{Tamminen:1983:AT, author = "Markku Tamminen", title = "Analysis of {$N$}-trees", journal = j-INFO-PROC-LETT, volume = "16", number = "3", pages = "131--137", day = "15", month = apr, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E05", MRnumber = "84e:68064", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; 921; C4240 (Programming and algorithm theory)", corpsource = "Lab. of Information Processing Sci., Helsinki Univ. of Technol., Espoo, Finland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "access efficiency; computer programming; distributive sorting; mathematical techniques --- Trees; N-trees; programming theory; recursive bucket methods; search cost; sorting; storage; trees (mathematics)", treatment = "T Theoretical or Mathematical", } @Article{Yuba:1983:CML, author = "Toshitsugu Yuba and Yoshinori Yamaguchi and Toshio Shimada", title = "A control mechanism of a {Lisp}-based data-driven machine", journal = j-INFO-PROC-LETT, volume = "16", number = "3", pages = "139--143", day = "15", month = apr, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "722; 723; C5220 (Computer architecture)", corpsource = "Electrotech. Lab., Ibaraki, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer architecture; computer systems, digital --- Parallel Processing; control mechanism; data-driven machine; EM-3; ETL data-driven Machine-3; high level language machine; Lisp-based; multiprocessing systems; parallelism; symbol manipulation", treatment = "T Theoretical or Mathematical", } @Article{Agrawal:1983:UHD, author = "Rakesh Agrawal and David J. Dewitt", key = "Agrawal \& Dewitt", title = "Updating Hypothetical Data Bases", journal = j-INFO-PROC-LETT, volume = "16", number = "3", pages = "145--146", day = "15", month = apr, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory); C6160 (Database management systems (DBMS))", corpsource = "Computer Sci. Dept., Univ. of Wisconsin, Madison, WI, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "crash recovery; database management systems; database systems; differential files; hypothetical database, update, crash recovery, differential files, log; hypothetical databases; log; programming theory; update", owner = "mckenzie; robyn", treatment = "T Theoretical or Mathematical", } @Article{Rystsov:1983:PCP, author = "I. K. Rystsov", title = "Polynomial complete problems in automata theory", journal = j-INFO-PROC-LETT, volume = "16", number = "3", pages = "147--151", day = "15", month = apr, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25 (03D05 03D15)", MRnumber = "84g:68031", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory)", corpsource = "Inst. of Cybernetics, Acad. of Sci., Kiev, Ukrainian SSR, USSR", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "automata theory; computational complexity; deterministic finite state automata; finite automata; polynomial complete; regular languages intersection", treatment = "T Theoretical or Mathematical", } @Article{Casanova:1983:TFS, author = "Marco A. Casanova", title = "The theory of functional and subset dependencies over relational expressions", journal = j-INFO-PROC-LETT, volume = "16", number = "3", pages = "153--160", day = "15", month = apr, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68F05 (03B10)", MRnumber = "84e:68081", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C4210 (Formal logic); C6160D (Relational databases)", corpsource = "Pontificia Univ. Catolica do Rio de Janeiro, Rio de Janeiro, Brazil", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "analytic tableaux method; database design; database management systems; database systems; formal languages; functional dependencies; relational expressions; subset dependences", treatment = "T Theoretical or Mathematical", } @Article{Deleage:1983:ATL, author = "J. L. Del{\'e}age", title = "An application of a transfer lemma", journal = j-INFO-PROC-LETT, volume = "16", number = "4", pages = "161--163", day = "13", month = may, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68F05", MRnumber = "84i:68124", MRreviewer = "S. A. Greibach", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "LITP Univ. de Paris 7, Paris, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "context-free languages; formal languages; full AFL; nondegenerated iterative pair; substitution; transfer lemma", treatment = "P Practical", } @Article{Hertel:1983:SBP, author = "Stefan Hertel", title = "{Smoothsort}'s Behavior on Presorted Sequences", journal = j-INFO-PROC-LETT, volume = "16", number = "4", pages = "165--170", day = "13", month = may, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68P10", MRnumber = "85a:68024", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory); C6130 (Data handling techniques)", corpsource = "Fachbereich Angewandte Math. und Informatik, Univ. des Saarlandes, Saarbrucken, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer systems programming; inversions; number-of-inversions-measure; presorted sequences; programming theory; running time; smoothsort; sorting", treatment = "P Practical", } @Article{Frederickson:1983:SUT, author = "Greg N. Frederickson", title = "Scheduling Unit-Time Tasks with Integer Release Times and Deadlines", journal = j-INFO-PROC-LETT, volume = "16", number = "4", pages = "171--173", day = "13", month = may, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C15 (68C25 90B35)", MRnumber = "84m:68030", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See note \cite{Steiner:1993:NSU}.", acknowledgement = ack-nhfb, classification = "913; C6150J (Operating systems)", corpsource = "Dept. of Computer Sci., Purdue Univ., West Lafayette, IN, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "deadlines; integer release times; off-line minimum problem; operating systems (computers); scheduling; unit-time tasks", treatment = "P Practical", } @Article{Lloyd:1983:SDR, author = "Errol L. Lloyd", title = "On a Simple Deadlock Recovery Problem", journal = j-INFO-PROC-LETT, volume = "16", number = "4", pages = "175--178", day = "13", month = may, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68N25", MRnumber = "85a:68020", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "722; 723; C6150J (Operating systems)", corpsource = "Dept. of Computer Sci., Univ. of Pittsburgh, Pittsburgh, PA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer programming; computer systems, digital --- Multiprocessing; deadlock recovery problem; minimum cost recovery; network flow problem; polynomial time algorithm; system failure; system recovery", treatment = "P Practical", } @Article{Crochemore:1983:OTF, author = "Max Crochemore and Michel {Le Rest} and Philippe Wender", title = "An optimal test on finite unavoidable sets of words", journal = j-INFO-PROC-LETT, volume = "16", number = "4", pages = "179--180", day = "13", month = may, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q45", MRnumber = "85a:68088", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "B6120B (Codes); C6130 (Data handling techniques)", corpsource = "Lab. d'Informatique, Univ. de Haute Normandie, Mont-Saint-Aignan, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "encoding; finite unavoidable set; finite unavoidable sets of words; graph theory; maximal length; optimal test", treatment = "T Theoretical or Mathematical", } @Article{Yap:1983:HAS, author = "Chee K. Yap", title = "A hybrid algorithm for the shortest path between two nodes in the presence of few negative arcs", journal = j-INFO-PROC-LETT, volume = "16", number = "4", pages = "181--182", day = "13", month = may, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68R10 (05C35 90B10)", MRnumber = "85b:68044", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Courant Inst. of Math. Sci., New York Univ., New York, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Bellman-Ford algorithms; computational complexity; computer programming; Dijkstra; direct graph; directed graphs; hybrid algorithm; negative arcs; parallel processing; shortest path", treatment = "T Theoretical or Mathematical", } @Article{Tsuda:1983:GFM, author = "Takao Tsuda and Takashi Sato and Takaaki Tatsumi", title = "Generalization of {Floyd}'s model on permuting information in idealized two-level storage", journal = j-INFO-PROC-LETT, volume = "16", number = "4", pages = "183--188", day = "13", month = may, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68B15", MRnumber = "84m:68015", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation); C6130 (Data handling techniques)", corpsource = "Dept. of Information Sci., Kyoto Univ., Kyoto, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "data handling; data structures; Floyd's model; idealized two-level storage; permuting information; processing large data structures", treatment = "P Practical", } @Article{Fushimi:1983:IOE, author = "Masanori Fushimi", title = "Increasing the orders of equidistribution of the leading bits of the {Tausworthe} sequence", journal = j-INFO-PROC-LETT, volume = "16", number = "4", pages = "189--192", day = "13", month = may, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "65C10", MRnumber = "85a:65011", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C7890 (Other special applications of computing)", corpsource = "Faculty of Engng., Univ. of Tokyo, Tokyo, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "algebraic method; equidistribution; Lehmer's congruential generator; maximal-length linearly recurring sequence; orders of equidistribution; pseudo random number generation; random number generation; Tausworthe sequence", treatment = "P Practical", } @Article{Chazelle:1983:IAF, author = "Bernard Chazelle", title = "An improved algorithm for the fixed-radius neighbor problem", journal = j-INFO-PROC-LETT, volume = "16", number = "4", pages = "193--198", day = "13", month = may, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68U05 (52-04 90B05)", MRnumber = "85m:68032", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C1160 (Combinatorial mathematics); C6120 (File organisation); C7250L (Non-bibliographic retrieval systems)", corpsource = "Dept. of Computer Sci., Brown Univ., Providence, RI, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "balanced search tree; computer programming; fast algorithms; fixed radius; fixed-radius neighbor problem; graph theory; information retrieval; logarithmic query time; partitioning; planar point location; Preparata's algorithm", treatment = "T Theoretical or Mathematical", } @Article{Rytter:1983:SRT, author = "Wojciech Rytter", title = "A simulation result for two-way pushdown automata", journal = j-INFO-PROC-LETT, volume = "16", number = "4", pages = "199--202", day = "13", month = may, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68D05 (68F10)", MRnumber = "84m:68045", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "721; C4210 (Formal logic); C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "Inst. of Informatics, Warsaw Univ., Warszawa, Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; computational complexity; deterministic automata; formal languages; languages; pushdown automata; pyramidal structure; random access machine; space complexity; surface configurations; two-way pushdown automata; uniform cost criterion", treatment = "P Practical", } @Article{Bossi:1983:DCA, author = "A. Bossi and N. Cocco and L. Colussi", title = "A divide-and-conquer approach to general context-free parsing", journal = j-INFO-PROC-LETT, volume = "16", number = "4", pages = "203--208", day = "13", month = may, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q50", MRnumber = "85a:68098", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "721; C4210 (Formal logic)", corpsource = "Univ. di Padova, Padova, Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; Chomsky normal form; context-free grammars; divide-and-conquer; general context-free parsing; recursive procedure", treatment = "P Practical", } @Article{Schoning:1983:S, author = "Uwe Sch{\"o}ning", title = "On the structure of {$\Delta^p_2$}", journal = j-INFO-PROC-LETT, volume = "16", number = "4", pages = "209--211", day = "13", month = may, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "03D15 (68Q25)", MRnumber = "85a:03054", MRreviewer = "Gh. Grigora{\c{s}}", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Inst. f{\"u}r Informatik, Univ. Stuttgart, Stuttgart, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "computational complexity; decidable; DELTA/sub 2//sup p/; intractability; NP-complete set; Turing machines; Turing reducibility", treatment = "P Practical", } @Article{Goldberg:1983:CAT, author = "Allen Goldberg and Paul Purdom and Cynthia Brown", title = "Corrigendum: {``Average time analyses of simplified Davis--Putnam procedures'' [Inform. Process. Lett. {\bf 15} (1982), no. 2, 72--75]}", journal = j-INFO-PROC-LETT, volume = "16", number = "4", pages = "213--213", day = "13", month = may, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25 (03B05 03B35 03D15)", MRnumber = "84d:68038b", MRreviewer = "Gh. Grigora{\cedla{s}}", bibdate = "Sat Apr 11 12:24:20 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See \cite{Goldberg:1982:ATA}.", acknowledgement = ack-nhfb, fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", } @Article{Dijkstra:1983:DTD, author = "Edsger W. Dijkstra and W. H. J. Feijen and A. J. M. {van Gasteren}", title = "Derivation of a Termination Detection Algorithm for Distributed Computations", journal = j-INFO-PROC-LETT, volume = "16", number = "5", pages = "217--219", day = "10", month = jun, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68B05 (68C05)", MRnumber = "84m:68005", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; B6210L (Computer communications); C5620 (Computer networks and techniques); C6150J (Operating systems)", corpsource = "Burroughs, AL Nuenen, Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer programming; distributed computations; distributed processing; networks; protocols; termination detection algorithm", treatment = "P Practical", } @Article{Duda:1983:ECP, author = "Andrzej Duda", title = "The effects of checkpointing on program execution time", journal = j-INFO-PROC-LETT, volume = "16", number = "5", pages = "221--229", day = "10", month = jun, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68B05", MRnumber = "84m:68006", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C6150G (Diagnostic, testing, debugging and evaluating systems)", corpsource = "Dept. of Complex Control Systems, Polish Acad. of Sci., Gliwice, Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "checkpointing; computer programming; elapsed time; expected execution time; program diagnostics; program execution time", treatment = "P Practical", } @Article{Carpi:1983:SSF, author = "Arturo Carpi", title = "On the size of a square-free morphism on a three letter alphabet", journal = j-INFO-PROC-LETT, volume = "16", number = "5", pages = "231--235", day = "10", month = jun, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68F05 (20M05)", MRnumber = "84m:68061", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Istituto di Matematica, Univ. di Napoli, Napoli, Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "formal languages; square-free morphism; three letter alphabet", treatment = "P Practical", } @Article{Murtagh:1983:ETC, author = "F. Murtagh", title = "Expected-time complexity results for hierarchic clustering algorithms which use cluster centres", journal = j-INFO-PROC-LETT, volume = "16", number = "5", pages = "237--241", day = "10", month = jun, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25 (62H30 68G10)", MRnumber = "84j:68025", MRreviewer = "Vijay V. Raghavan", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory); C7250 (Information storage and retrieval)", corpsource = "Dept. of Computer Sci., Univ. Coll. Dublin, Dublin, Ireland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm improvements; centroid methods; cluster centres; complexity; computational complexity; computer programming; dynamic searching; expected-time performance; hierarchic clustering algorithms; information retrieval; interpreting data; median method; nearest neighbours; probabilistic algorithms; structuring; time complexity; trees; Ward's method", treatment = "P Practical", } @Article{Ozawa:1983:CSM, author = "K. Ozawa", title = "Considerations on the similarity measures between index terms", journal = j-INFO-PROC-LETT, volume = "16", number = "5", pages = "243--246", day = "10", month = jun, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C7240 (Information analysis and indexing); C7250C (Bibliographic retrieval systems)", corpsource = "Information Sci. Center, Osaka Electro-Communication Univ., Osaka, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "automatic clustering; clustering criterion; documents; index terms; indexing; information retrieval; insensitive measure; similarity measures; Tanimoto measure", treatment = "P Practical", } @Article{Cohen:1983:NFA, author = "Jacques Cohen", title = "A note on a fast algorithm for sparse matrix multiplication", journal = j-INFO-PROC-LETT, volume = "16", number = "5", pages = "247--248", day = "10", month = jun, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "65F50 (65V05)", MRnumber = "84m:65057", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "B0290H (Linear algebra); C4140 (Linear algebra)", corpsource = "Computer Sci. Program, Brandeis Univ., Waltham, MA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "analysis of algorithms; fast algorithm; matrix algebra; program transformations; sparse matrix multiplication", treatment = "T Theoretical or Mathematical", } @Article{Zahorjan:1983:EBT, author = "John Zahorjan and Barbara J. Bell and Kenneth C. Sevcik", title = "Estimating Block Transfers When Record Access Probabilities are Non-Uniform", journal = j-INFO-PROC-LETT, volume = "16", number = "5", pages = "249--252", day = "10", month = jun, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C6160 (Database management systems (DBMS))", corpsource = "Dept. of Computer Sci., Univ. of Washington, Seattle, WA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "block transfer; database; database management systems; database systems; DBMS; direct access; record access probabilities; sequentially accessed files", treatment = "P Practical", } @Article{Tarjan:1983:UBS, author = "Robert Endre Tarjan", title = "Updating a Balanced Search Tree in {$O(1)$} Rotations", journal = j-INFO-PROC-LETT, volume = "16", number = "5", pages = "253--257", day = "10", month = jun, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68P10", MRnumber = "85a:68026", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C6120 (File organisation); C7250 (Information storage and retrieval)", corpsource = "Bell Labs., Murray Hill, NJ, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "balanced search tree; data processing; information retrieval; red black trees; rotations; search trees; trees (mathematics)", treatment = "P Practical", } @Article{Kriegel:1983:ISB, author = "H. P. Kriegel and Y. S. Kwong", title = "Insertion-Safeness in Balanced Trees", journal = j-INFO-PROC-LETT, volume = "16", number = "5", pages = "259--264", day = "10", month = jun, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68B15", MRnumber = "84m:68013", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C6120 (File organisation); C7250 (Information storage and retrieval)", corpsource = "Lehrstuhl Informatik VI, Univ. Dortmund, Dortmund, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "average case results; balanced trees; data processing; data structures; information retrieval; insertion; keys; random insertion; safe node; trees (mathematics)", treatment = "P Practical", } @Article{Freund:1983:IAO, author = "Rudolf Freund", title = "Init and {Anf} operating on $\omega$-languages", journal = j-INFO-PROC-LETT, volume = "16", number = "5", pages = "265--269", day = "10", month = jun, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68F05", MRnumber = "84m:68065", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Inst. f{\"u}r Math. Logik und Formale Spachen, Tech. Univ. Wien, Wien, Austria", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "ANF; context-free languages; finite-string languages; formal languages; Init; omega-Kleene closure; omega-languages; regular languages", treatment = "P Practical", } @Article{Er:1983:CSO, author = "M. C. Er", title = "Computing Sums of Order-$k$ {Fibonacci} Numbers in Log Time", journal = j-INFO-PROC-LETT, volume = "17", number = "1", pages = "1--5", day = "19", month = jul, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "11Y55 (11B39 68Q25)", MRnumber = "85b:11124", MRreviewer = "Samuel S. Wagstaff, Jr.", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C1110 (Algebra); C1160 (Combinatorial mathematics)", corpsource = "Dept. of Computing Sci., Univ. of Wollongong, Wollongong, NSW, Australia", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer programming; Fibonacci numbers; log time; matrix; matrix algebra; number theory; order-k Fibonacci numbers; sums", treatment = "T Theoretical or Mathematical", } @Article{Willett:1983:TKS, author = "Michael Willett", title = "Trapdoor Knapsacks without Superincreasing Structure", journal = j-INFO-PROC-LETT, volume = "17", number = "1", pages = "7--11", day = "19", month = jul, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "94A60 (68P20)", MRnumber = "85e:94020", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C0230 (Economic, social and political aspects of computing); C1260 (Information theory); C1290 (Applications of systems theory)", corpsource = "Dept. of Math., Univ. of North Carolina, Greensboro, NC, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer programming; cryptography; information theory; knapsacks; Merkle--Hellman public-key schemes; operations research; polynomial-time algorithm; superincreasing structure; trapdoor", treatment = "T Theoretical or Mathematical", } @Article{Cesarini:1983:ACC, author = "F. Cesarini and G. Soda", title = "An algorithm to construct a compact {$B$}-tree in case of ordered keys", journal = j-INFO-PROC-LETT, volume = "17", number = "1", pages = "13--16", day = "19", month = jul, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C1160 (Combinatorial mathematics); C1260 (Information theory)", corpsource = "Istituto di Informatica e Sistemistica, Univ. of Florence, Florence, Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "compact B-tree; computer programming; construction algorithm; cryptography; data processing --- Data Structures; ordered keys; overflow movings; trees (mathematics)", treatment = "T Theoretical or Mathematical", } @Article{Richards:1983:SDH, author = "Ronald C. Richards", title = "Shape Distribution of Height-Balanced Trees", journal = j-INFO-PROC-LETT, volume = "17", number = "1", pages = "17--20", day = "19", month = jul, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C1140Z (Other topics in statistics); C1160 (Combinatorial mathematics); C1260 (Information theory)", corpsource = "IBM Corp., Houston, TX, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "approximate probabilities; computer programming; data processing --- Data Structures; height-balanced trees; information theory; node trees; probabilities; probability; tree shapes; trees (mathematics)", treatment = "T Theoretical or Mathematical", } @Article{Tirri:1983:SRP, author = "Henry R. Tirri", title = "Simulation, Reduction and Preservation of Correctness Properties of Parallel Systems", journal = j-INFO-PROC-LETT, volume = "17", number = "1", pages = "21--27", day = "19", month = jul, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q60 (03B45 03B70)", MRnumber = "85e:68063", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "722; 723; C4240 (Programming and algorithm theory)", corpsource = "Dept. of Computer Sci., Univ. of Helsinki, Helsinki, Finland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computation homomorphism; computer systems, digital; correctness properties; parallel systems; preservation; programming theory; reduction; simulation; temporal logic", treatment = "T Theoretical or Mathematical", } @Article{Broy:1983:DSC, author = "Manfred Broy", title = "Denotational Semantics of Communicating Processes Based on a Language for Applicative Multiprogramming", journal = j-INFO-PROC-LETT, volume = "17", number = "1", pages = "29--35", day = "19", month = jul, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68F20 (68B10)", MRnumber = "84m:68078", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C4210 (Formal logic)", corpsource = "Inst. f{\"u}r Informatik, Tech. Univ. Munchen, Munchen, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "applicative multiprogramming; communicating processes; computer systems programming; denotational semantics; formal languages; language; loosely-coupled systems; nondeterministic stream-processing functions; semantic target language; synchronous systems", treatment = "T Theoretical or Mathematical", } @Article{Tarjan:1983:IAH, author = "Robert E. Tarjan", title = "An improved algorithm for hierarchical clustering using strong components", journal = j-INFO-PROC-LETT, volume = "17", number = "1", pages = "37--41", day = "19", month = jul, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E10 (68C25)", MRnumber = "84m:68056", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; B6140C (Optical information, image and video signal processing); C1160 (Combinatorial mathematics); C1250 (Pattern recognition)", corpsource = "Bell Labs., Murray Hill, NJ, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "asymmetric similarity measure; cluster analysis; computer programming; directed graphs; graph; hierarchical clustering; pattern recognition; strong components; time algorithm; weighted edges", treatment = "T Theoretical or Mathematical", } @Article{Rana:1983:DSD, author = "S. P. Rana", title = "A distributed solution of the distributed termination problem", journal = j-INFO-PROC-LETT, volume = "17", number = "1", pages = "43--46", day = "19", month = jul, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68B05", MRnumber = "84m:68007", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C5620 (Computer networks and techniques); C6150J (Operating systems)", corpsource = "Computer Centre, Indian Inst. of Technol., New Delhi, India", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "asynchronous communications; computer programming; computer systems, digital --- Distributed; distributed processing; distributed solution; distributed termination problem; symmetric solution", treatment = "T Theoretical or Mathematical", } @Article{Williams:1983:ESS, author = "M. H. Williams", title = "Is an Exit Statement Sufficient?", journal = j-INFO-PROC-LETT, volume = "17", number = "1", pages = "47--51", day = "19", month = jul, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C6110 (Systems analysis and programming)", corpsource = "Dept. of Computer Sci., Heriot-Watt Univ., Edinburgh, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer programming languages; conditional statements; exit statement; goto statement; loops; structured programming", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Croitoru:1983:PSG, author = "Cornelius Croitoru and Emilian Suditu", title = "Perfect Stables in Graphs", journal = j-INFO-PROC-LETT, volume = "17", number = "1", pages = "53--56", day = "19", month = jul, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "05C70 (68Q25)", MRnumber = "85k:05083", MRreviewer = "P. E. O'Neil", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "921; C1160 (Combinatorial mathematics); C1180 (Optimisation techniques)", corpsource = "Dept. of Math., Univ. of IASI, IASI, Romania", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "graph theory; graphs; mathematical programming; mathematical techniques; NP- complete; perfect matching; perfect stable; polynomial; vertex", treatment = "T Theoretical or Mathematical", } @Article{Nawrocki:1983:CSL, author = "Jerzy R. Nawrocki", title = "Contiguous Segmentation with Limited Compacting", journal = j-INFO-PROC-LETT, volume = "17", number = "2", pages = "57--62", day = "24", month = aug, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C6120 (File organisation); C6150J (Operating systems)", corpsource = "Regional Computer Center, Tech. Univ. of Poznan, Poznan, Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "address mapping; computer operating systems; contiguous segmentation; limited compacting; memory management; multi-segment virtual memory; real-time systems; storage management; virtual storage", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Magazine:1983:OIC, author = "Michael J. Magazine", title = "Optimality of Intuitive Checkpointing Policies", journal = j-INFO-PROC-LETT, volume = "17", number = "2", pages = "63--66", day = "24", month = aug, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "921; C1140Z (Other topics in statistics); C1180 (Optimisation techniques); C1290F (Systems theory applications in industry)", corpsource = "Dept. of Management Sci., Univ. of Waterloo, Waterloo, Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "intuitive checkpointing; management science; mathematical programming; optimality; optimisation; probabilistic process; probability; system operation", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Shing:1983:OOB, author = "Man-Tak Shing", title = "Optimum Ordered Bi-Weighted Binary Trees", journal = j-INFO-PROC-LETT, volume = "17", number = "2", pages = "67--70", day = "24", month = aug, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68P10", MRnumber = "85f:68013", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; 921; C1160 (Combinatorial mathematics); C1180 (Optimisation techniques)", corpsource = "Dept. of Computer Sci., Univ. of California, Santa Barbara, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "bi-weighted binary trees; children; computer programming; dynamic programming; left son; mathematical programming, dynamic; nonnegative numbers; optimisation; optimum ordered; parent; right son; symmetric ordering; trees (mathematics)", treatment = "T Theoretical or Mathematical", } @Article{Vyskoc:1983:NPI, author = "Jozef Vysko{\v{c}}", title = "A note on the power of integer division", journal = j-INFO-PROC-LETT, volume = "17", number = "2", pages = "71--72", day = "24", month = aug, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (15A15)", MRnumber = "85g:68032", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C1110 (Algebra); C1160 (Combinatorial mathematics); C4140 (Linear algebra)", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "asymptotically optimal algorithms; computational complexity; integer division; matrix algebra; matrix multiplication; nonnegative integers; number theory; permanent; polynomial multiplication; polynomials; time-complexity", treatment = "T Theoretical or Mathematical", } @Article{Tong:1983:FAF, author = "Po Tong and E. L. Lawler", title = "A faster algorithm for finding edge-disjoint branchings", journal = j-INFO-PROC-LETT, volume = "17", number = "2", pages = "73--76", day = "24", month = aug, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (05C20 68R10)", MRnumber = "85a:68081", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C1160 (Combinatorial mathematics)", corpsource = "Computer Sci. Dept., Univ. of California, Berkeley, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer programming; directed graphs; directed multigraph; edge-disjoint branchings; faster algorithm; vertices", treatment = "T Theoretical or Mathematical", } @Article{Shamir:1983:ECT, author = "Adi Shamir", title = "Embedding Cryptographic Trapdoors in Arbitrary Knapsack Systems", journal = j-INFO-PROC-LETT, volume = "17", number = "2", pages = "77--79", day = "24", month = aug, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "94A60", MRnumber = "85e:94019", MRreviewer = "Tai Yang Hwang", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C1260 (Information theory); C1290Z (Other applications of systems theory); C6130 (Data handling techniques)", corpsource = "Dept. of Appl. Maths., Weizmann Inst. of Sci., Rehovot, Israel", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "arbitrary knapsack systems; cryptographic trapdoors; cryptography; information theory; modular multiplications; operations research; public-key cryptography", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Willard:1983:LLW, author = "Dan E. Willard", title = "Log-Logarithmic Worst-Case Range Queries are Possible in Space {$\Theta (N)$}", journal = j-INFO-PROC-LETT, volume = "17", number = "2", pages = "81--84", day = "24", month = aug, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68P10", MRnumber = "85a:68027", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C1140C (Queueing theory); C1160 (Combinatorial mathematics); C4130 (Interpolation and function approximation); C4210 (Formal logic); C6120 (File organisation)", corpsource = "Bell Labs., Murray Hill, NJ, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "data processing; data structure; data structures; distinct nonnegative integers; interpolation; log-logarithmic queries; queueing theory; random access machine; specified bound; trees (mathematics); worst-case range queries", treatment = "T Theoretical or Mathematical", } @Article{Kobuchi:1983:SDS, author = "Youichi Kobuchi", title = "Stability of desynchronized {0L} systems", journal = j-INFO-PROC-LETT, volume = "17", number = "2", pages = "85--90", day = "24", month = aug, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q45", MRnumber = "85i:68027", MRreviewer = "K. P. Lee", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Biophys., Kyoto Univ., Kyoto, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "alphabet; desynchronized 0L systems; formal languages; generative grammars; grammars; homogeneous treatment; parallellism; stability; synchronization; system operation", treatment = "T Theoretical or Mathematical", } @Article{DeBra:1983:AHD, author = "Paul {De Bra} and Jan Paredaens", title = "An Algorithm for Horizontal Decompositions", journal = j-INFO-PROC-LETT, volume = "17", number = "2", pages = "91--95", day = "24", month = aug, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C6160D (Relational databases)", corpsource = "Dept. of Maths., Univ. of Antwerp, Wilrijk, Belgium", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "database management systems; database systems; exception handling mechanism; functional dependency; horizontal decompositions; relational database model; vertical decomposition", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Bertossi:1983:FHC, author = "Alan A. Bertossi", title = "Finding {Hamiltonian} Circuits in Proper Interval Graphs", journal = j-INFO-PROC-LETT, volume = "17", number = "2", pages = "97--101", day = "24", month = aug, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68R10", MRnumber = "85a:68143", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; 921; C1160 (Combinatorial mathematics)", corpsource = "Dipartimento di Informatica, Univ. di Pisa, Pisa, Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "circular arc graph; cliques; computational complexity; computer programming; edges; graph theory; Hamiltonian circuits; mathematical techniques --- Graph Theory; node disjoint paths; optimal; polynomial time; property interval graphs", treatment = "T Theoretical or Mathematical", } @Article{Schorr:1983:PPD, author = "Amir Schorr", title = "Physical Parallel Devices are not Much Faster Than Sequential Ones", journal = j-INFO-PROC-LETT, volume = "17", number = "2", pages = "103--106", day = "24", month = aug, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25", MRnumber = "84m:68040", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "722; 723; C4130 (Interpolation and function approximation); C4230D (Sequential switching theory); C4240 (Programming and algorithm theory); C5420 (Mainframes and minicomputers)", corpsource = "Nat. Semiconductor Ltd, Herzlia, Israel", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computational complexity; computer systems, digital; formal languages; language; parallel devices; parallel processing; physical parallel devices; polynomials; sequential devices; sequential machines; time-complexity", treatment = "T Theoretical or Mathematical", } @Article{Kucera:1983:EAP, author = "Lud{\v{e}}k Ku{\v{c}}era", title = "Erratum and addendum to: {``Parallel computation and conflicts in memory access'' [Inform. Process. Lett. {\bf 14} (1982), no. 2, 93--96; MR 83g:68038]}", journal = j-INFO-PROC-LETT, volume = "17", number = "2", pages = "107--107", day = "24", month = aug, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q10 (05C50 68N25)", MRnumber = "85a:68054", bibdate = "Sat Apr 11 12:24:20 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See \cite{Kucera:1982:PCC}.", acknowledgement = ack-nhfb, fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", } @Article{Martin:1983:PTF, author = "J. J. Martin", title = "Precise typing and filters", journal = j-INFO-PROC-LETT, volume = "17", number = "3", pages = "109--112", day = "5", month = oct, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Virginia Polytech. Inst. and State Univ., Blacksburg, VA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "abstract types; data types; filters; natural domains; precise typing; programming theory; run time errors; type checking", treatment = "T Theoretical or Mathematical", } @Article{Farinas:1983:STT, author = "Luis Fari{\~n}as", title = "Space as time", journal = j-INFO-PROC-LETT, volume = "17", number = "3", pages = "113--115", day = "5", month = oct, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q55 (03B45 03B70)", MRnumber = "85g:68041", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Langages et Syst{\`e}mes Informatiques, Univ. de Toulouse Le Mirail, Toulouse, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "axiomatization; formal logic; mutual exclusion problem; observation; two-dimensional temporal logic", treatment = "T Theoretical or Mathematical", } @Article{Lifschitz:1983:NCP, author = "Vladimir Lifschitz and Leon Pesotchinsky", title = "A note on the complexity of a partition algorithm", journal = j-INFO-PROC-LETT, volume = "17", number = "3", pages = "117--120", day = "5", month = oct, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (90C09)", MRnumber = "85h:68022", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Dept. of Math. Sci., Univ. of Texas, El Paso, TX, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm theory; analysis of algorithms; computational complexity; computer programming; partition algorithms; partition problem; PARTS; worst-case behaviour", treatment = "T Theoretical or Mathematical", } @Article{Ehrenfeucht:1983:SCF, author = "A. Ehrenfeucht and G. Rozenberg", title = "On the Subword Complexity of $m$-Free {D0L} Languages", journal = j-INFO-PROC-LETT, volume = "17", number = "3", pages = "121--124", day = "5", month = oct, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q45", MRnumber = "85f:68043", MRreviewer = "K. P. Lee", bibdate = "Sun May 02 08:27:19 1999", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See \cite{Ehrenfeucht:1983:SCL}.", acknowledgement = ack-nhfb, classification = "721; C4210 (Formal logic)", corpsource = "Computer Sci. Dept., Univ. of Colorado, Boulder, CO, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; computational complexity; DOL language; formal languages; m-free DOL languages; subword complexity", treatment = "T Theoretical or Mathematical", } @Article{Skyum:1983:MWB, author = "Sven Skyum", title = "A measure in which {Boolean} negation is exponentially powerful", journal = j-INFO-PROC-LETT, volume = "17", number = "3", pages = "125--128", day = "5", month = oct, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q15 (94C10)", MRnumber = "85g:68022", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Computer Sci. Dept., Aarhus Univ., Aarhus, Denmark", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "Boolean algebra; Boolean negation; combinatorial complexity theory; computational complexity; negation; projections; restricted representations", treatment = "T Theoretical or Mathematical", } @Article{Weiser:1983:RSB, author = "Mark Weiser", title = "Reconstructing Sequential Behavior from Parallel Behavior Projections", journal = j-INFO-PROC-LETT, volume = "17", number = "3", pages = "129--135", day = "5", month = oct, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "722; 723; C4240 (Programming and algorithm theory)", corpsource = "Computer Sci. Dept., Univ. of Maryland, College Park, MD, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer programming; computer systems, digital --- Parallel Processing; data flow; data flow slices; formal languages; parallel processing; parallelism; regular expressions; slicing; vectorization", treatment = "T Theoretical or Mathematical", } @Article{Yokomori:1983:SLP, author = "Takashi Yokomori and Aravind K. Joshi", title = "Semi-Linearity, {Parikh}-Boundedness and Tree Adjunct Languages", journal = j-INFO-PROC-LETT, volume = "17", number = "3", pages = "137--143", day = "5", month = oct, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q45 (03B65 03D05)", MRnumber = "85f:68049", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "721; C4210 (Formal logic)", corpsource = "Dept. of Computer and Information Sci., Univ. of Pennsylvania, Philadelphia, PA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; context-free grammars; context-free languages; Parikh-bounded languages; Parikh-boundedness; semilinearity; TAG; TAL; tree adjunct grammars; tree adjunct languages", treatment = "T Theoretical or Mathematical", } @Article{Seroussi:1983:ACM, author = "Gadiel Seroussi and Fai Ma", title = "On the Arithmetic Complexity of Matrix {Kronecker} Powers", journal = j-INFO-PROC-LETT, volume = "17", number = "3", pages = "145--148", day = "5", month = oct, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (65F30)", MRnumber = "85a:68079", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Math. Sci. Dept., IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algebraic computational complexity; arithmetic complexity; computational complexity; computer programming; inductive computation; matrix Kronecker powers", treatment = "T Theoretical or Mathematical", } @Article{Choffrut:1983:FPD, author = "C. Choffrut and K. {Culik, II}", title = "Folding of the Plane and the Design of Systolic Arrays", journal = j-INFO-PROC-LETT, volume = "17", number = "3", pages = "149--153", day = "5", month = oct, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q35", MRnumber = "85m:68013", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "721; C5220 (Computer architecture)", corpsource = "Univ. Paris VII, U.E.R. de Math., Paris, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "folding; geometric transformation; logic circuits; parallel processing; systolic arrays; VLSI", treatment = "T Theoretical or Mathematical", } @Article{Mili:1983:VPI, author = "Ali Mili", title = "Verifying Programs by Induction on Their Data Structure: General Format and Applications", journal = j-INFO-PROC-LETT, volume = "17", number = "3", pages = "155--160", day = "5", month = oct, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q60", MRnumber = "85a:68124", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Dept. d'Informatique, Univ. Laval, Quebec City, Que., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer programming; correctness; intermittent assertion method; Noetherian induction; program correctness proving; program verification; programming theory; subgoal induction method", treatment = "T Theoretical or Mathematical", } @Article{Wyrostek:1983:CPP, author = "Piotr Wyrostek", title = "On the {``correct prefix property''} in precedence parsers", journal = j-INFO-PROC-LETT, volume = "17", number = "3", pages = "161--165", day = "5", month = oct, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q50", MRnumber = "85a:68112", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See also erratum \cite{Wyrostek:1984:ECP}.", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Regional Computer Centre `Cyfronet', Krakow, Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "correct prefix property; CPP; grammars; language processors; precedence grammars; precedence parser; Rhodes' parser; syntactic analysis", treatment = "T Theoretical or Mathematical", } @Article{Zheng:1983:DMA, author = "Zhi Jie Zheng", title = "The duodirun merging algorithm: a new fast algorithm for parallel merging", journal = j-INFO-PROC-LETT, volume = "17", number = "3", pages = "167--168", day = "5", month = oct, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68P10", MRnumber = "85f:68014", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6130 (Data handling techniques)", corpsource = "Dept. of Computer Architecture, Inst. of Computer Technol., Acad. Sinica, Beijing, China", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "duodirun; duodirun merging; merging; parallel merging; regularity; sorting; symmetry", treatment = "T Theoretical or Mathematical", } @Article{Williams:1983:PAP, author = "M. H. Williams", title = "The problem of absolute privacy", journal = j-INFO-PROC-LETT, volume = "17", number = "3", pages = "169--171", day = "5", month = oct, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C6150J (Operating systems)", corpsource = "Computer Sci. Dept., Heriot-Watt Univ., Edinburgh, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer operating systems; data privacy; data processing --- Security of Data; data security; file protection; operating systems (computers); security of data", treatment = "G General Review; P Practical", } @Article{Clocksin:1983:RFQ, author = "W. F. Clocksin", title = "Real-Time Functional Queue Operations Using the Logical Variable", journal = j-INFO-PROC-LETT, volume = "17", number = "4", pages = "173--175", day = "8", month = nov, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; 922; C6120 (File organisation)", corpsource = "Univ. of Oxford, Oxford, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "backtracking; computer programming; data structures; functional queue operations; logic programming; logical variable; probability --- Queueing Theory; programming; queue operations; queueing theory; unification", treatment = "T Theoretical or Mathematical", } @Article{Bartholdi:1983:FHB, author = "John J. {Bartholdi, III} and Loren K. Platzman", title = "A fast heuristic based on space filling curves for minimum-weight matching in the plane", journal = j-INFO-PROC-LETT, volume = "17", number = "4", pages = "177--180", day = "8", month = nov, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; B6140C (Optical information, image and video signal processing); C1250 (Pattern recognition); C1290Z (Other applications of systems theory)", corpsource = "School of Industrial and Systems Engng., Georgia Inst. of Technol., Atlanta, GA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "approximation algorithms; computer programming; good matching; linear expected time; minimum weight matching; minimum-weight matching; operations research; picture processing; plane; probability distribution; sorting; space filling curves; travelling salesman problem", treatment = "T Theoretical or Mathematical", } @Article{Makinen:1983:BTU, author = "Erkki M{\"a}kinen", title = "Boundedness Testing for Unambiguous Context-Free Grammars", journal = j-INFO-PROC-LETT, volume = "17", number = "4", pages = "181--183", day = "8", month = nov, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q50", MRnumber = "85i:68028", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "721; C4210 (Formal logic)", corpsource = "Dept. of Math. Sci. and Computer Sci., Univ. of Tampere, Tampere, Finland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; bounded language; boundedness testing; context-free grammars; decidability problems; exponential time complexity; left Szilard language; linear grammars; polynomial time algorithm; unambiguous context-free grammars", treatment = "T Theoretical or Mathematical", } @Article{Shmueli:1983:DCD, author = "Oded Shmueli", title = "Dynamic Cycle Detection", journal = j-INFO-PROC-LETT, volume = "17", number = "4", pages = "185--188", day = "8", month = nov, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68R10 (05-04 05C20 68N25)", MRnumber = "85b:68043", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; 922; C6150J (Operating systems)", corpsource = "Dept. of Computer Sci., Technion-Israel Inst. of Technol., Haifa, Israel", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "centralized continuous deadlock detection; database systems; deadlock; depth first search; directed acyclic graph; directed graphs; dynamically changing environment; edge addition; operating systems (computers); OS; probability; resource contention; system recovery", treatment = "P Practical", } @Article{Ramesh:1983:LPF, author = "S. Ramesh and S. L. Mehndiratta", title = "The liveness property of on-the-fly garbage collector---a proof", journal = j-INFO-PROC-LETT, volume = "17", number = "4", pages = "189--195", day = "8", month = nov, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q60 (68Q10)", MRnumber = "85i:68030", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory); C6150J (Operating systems)", corpsource = "Computer Centre, Indian Inst. of Technol., Bombay, India", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer programming; correctness proof; freelist; liveness property; on-the-fly garbage collector; parallel programs; programming theory; storage management", treatment = "P Practical", } @Article{Gangolli:1983:TPM, author = "Anil R. Gangolli and Steven L. Tanimoto", title = "Two Pyramid Machine Algorithms for Edge Detection in Noisy Binary Images", journal = j-INFO-PROC-LETT, volume = "17", number = "4", pages = "197--202", day = "8", month = nov, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "722; 723; B6140C (Optical information, image and video signal processing); C1250 (Pattern recognition)", corpsource = "Dept. of Computer Sci., Univ. of Washington, Seattle, WA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer programming --- Algorithms; computer systems, digital --- Parallel Processing; edge detection; fast algorithms; image processing; noisy binary images; parallel hierarchical cellular array processor; parallel processing; picture processing; pyramid machine algorithms", treatment = "T Theoretical or Mathematical", } @Article{Blum:1983:NPC, author = "Norbert Blum", title = "A note on the ``parallel computation thesis''", journal = j-INFO-PROC-LETT, volume = "17", number = "4", pages = "203--205", day = "8", month = nov, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q10 (03D10 03D15 68Q15)", MRnumber = "85d:68023", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Angewandte Math. und Informatik, Univ. des Saarlandes, Saarbrucken, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "complexity; parallel computation thesis; parallel machines; parallel processing; programming theory; simulation; space-bounded computers; Turing machines", treatment = "T Theoretical or Mathematical", } @Article{Atallah:1983:LTA, author = "Mikhail J. Atallah", title = "A linear time algorithm for the {Hausdorff} distance between convex polygons", journal = j-INFO-PROC-LETT, volume = "17", number = "4", pages = "207--209", day = "8", month = nov, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68U05 (52A37)", MRnumber = "85j:68101", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Dept. of Computer Sci., Purdue Univ., West Lafayette, IN, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm analysis; computational complexity; computational geometry; computer programming; convex polygons; Euclidean distance; Hausdorff distance; linear time algorithm", treatment = "T Theoretical or Mathematical", } @Article{Mayoh:1983:MPP, author = "Brian H. Mayoh", title = "Models of Programs and Processes", journal = j-INFO-PROC-LETT, volume = "17", number = "4", pages = "211--214", day = "8", month = nov, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q10", MRnumber = "85b:68016", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C6110 (Systems analysis and programming)", corpsource = "Computer Sci. Dept., Aarhus Univ., Aarhus, Denmark", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer metatheory; diagrams; equation sets; flowcharting; flowcharts; graphs; Milner agents; parallel processing; Petri nets; Pratt processes; processes; programming; programs", treatment = "P Practical", } @Article{Lautemann:1983:BPH, author = "Clemens Lautemann", title = "{BPP} and the polynomial hierarchy", journal = j-INFO-PROC-LETT, volume = "17", number = "4", pages = "215--217", day = "8", month = nov, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "03D15 (68Q05 68Q15)", MRnumber = "85j:03063", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "721; C4220 (Automata theory)", corpsource = "Inst. f{\"u}r Software and Theoretische Informatik, Tech. Univ. Berlin, Berlin, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; bounded error probability; BPP; polynomial hierarchy; polynomial time bound; probabilistic Turing machine; pure counting arguments; Turing machines", treatment = "T Theoretical or Mathematical", } @Article{Guibas:1983:CAN, author = "Leo J. Guibas and Jorge Stolfi", title = "On computing all north-east nearest neighbors in the {$L_1$} metric", journal = j-INFO-PROC-LETT, volume = "17", number = "4", pages = "219--223", day = "8", month = nov, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68U05 (68Q25)", MRnumber = "85b:68049", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Xerox Parc, Palo Alto, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computational complexity; computational geometry; computer programming; L/sub 1/ metric; minimum spanning tree; northeast nearest neighbors", treatment = "T Theoretical or Mathematical", } @Article{Hikita:1983:LCS, author = "Teruo Hikita", title = "Listing and Counting Subtrees of Equal Size of a Binary Tree", journal = j-INFO-PROC-LETT, volume = "17", number = "4", pages = "225--229", day = "8", month = nov, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68R10 (05C05 05C30 68P10)", MRnumber = "85k:68076", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; 921; C1160 (Combinatorial mathematics); C6120 (File organisation)", corpsource = "Dept. of Maths., Tokyo Metropolitan Univ., Tokyo, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "binary tree; computer programming; counting; data structures; listing; mathematical techniques --- Trees; rooted ordered binary trees; subtrees; trees (mathematics)", treatment = "P Practical", } @Article{Rohl:1983:FLQ, author = "J. S. Rohl", title = "A faster lexicographical {$N$} queens algorithm", journal = j-INFO-PROC-LETT, volume = "17", number = "5", pages = "231--233", day = "15", month = dec, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Dept. of Computer Sci., Univ. of Western Australia, Nedlands, WA, Australia", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm theory; computer programming; lexicographical order; N queens problem; permutations; Rohl's procedure", treatment = "T Theoretical or Mathematical", } @Article{Yu:1983:UDC, author = "Yao Tin Yu and Mohamed G. Gouda", title = "Unboundedness Detection for a Class of Communicating Finite-State Machines", journal = j-INFO-PROC-LETT, volume = "17", number = "5", pages = "235--240", day = "15", month = dec, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q05 (68M10)", MRnumber = "85c:68017", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "721; 723; C4220 (Automata theory)", corpsource = "Dept. of Computer Sci., Univ. of Texas, Austin, TX, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; bounded communication; communicating machines; communication protocols; computer programming --- Algorithms; deadlock detection; finite automata; finite-state machines; protocols; reachability; unboundness detection", treatment = "T Theoretical or Mathematical", } @Article{Myers:1983:ARA, author = "Eugene W. Myers", title = "An applicative random-access stack", journal = j-INFO-PROC-LETT, volume = "17", number = "5", pages = "241--248", day = "15", month = dec, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68N05 (68P05)", MRnumber = "86a:68008", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C6120 (File organisation)", corpsource = "Dept. of Computer Sci., Univ. of Arizona, Tucson, AZ, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "applicative algorithms; auxiliary linking structure; computer programming; data structures; RA-stack; random-access stack; singly-linked list; stack data abstraction", treatment = "T Theoretical or Mathematical", } @Article{Fischer:1983:SRF, author = "Michael J. Fischer and Michael S. Paterson", title = "Storage Requirements for Fair Scheduling", journal = j-INFO-PROC-LETT, volume = "17", number = "5", pages = "249--250", day = "15", month = dec, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q10 (68Q60)", MRnumber = "85h:68017", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; 913; C4240 (Programming and algorithm theory); C5380 (Other aspects of storage devices and techniques); C6150J (Operating systems)", corpsource = "Dept. of Computer Sci., Yale Univ., New Haven, CT, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm theory; analysis of algorithms; bounds; computer programming; fair scheduling; parallel computation; parallel processing; scheduling; storage", treatment = "T Theoretical or Mathematical", } @Article{Nishihara:1983:ACA, author = "Seiichi Nishihara and Katsuo Ikeda", title = "Address Calculation Algorithms for Ordered Sets of Combinations", journal = j-INFO-PROC-LETT, volume = "17", number = "5", pages = "251--253", day = "15", month = dec, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Inst. of Information Sci. and Electronics, Univ. of Tsukuba, Ibaraki, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "address calculation algorithms; algorithm theory; combinations; computer programming; lexicographically ordered combinations; ordered sets", treatment = "T Theoretical or Mathematical", } @Article{Barnard:1983:RDP, author = "D. T. Barnard", title = "Recursive descent parsing using implementation languages requiring definition before use", journal = j-INFO-PROC-LETT, volume = "17", number = "5", pages = "255--258", day = "15", month = dec, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Computing and Information Sci., Queen's Univ., Kingston, Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "ALGOL scope rules; code generation; compilers; context-sensitive constraint checking; grammar; grammars; implementation languages; parser; recursive descent parsing", treatment = "T Theoretical or Mathematical", } @Article{Ida:1983:SFA, author = "T. Ida", title = "Some {FP} algebra with {Currying} operation", journal = j-INFO-PROC-LETT, volume = "17", number = "5", pages = "259--261", day = "15", month = dec, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Information Sci. Lab., Inst. of Phys. and Chem. Res., Saitama, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "algebraic equations; bu; Currying operation; FP algebra; FP system; functional programming; programming theory", treatment = "T Theoretical or Mathematical", } @Article{Kolla:1983:WOS, author = "Reiner Kolla", title = "Where-Oblivious is not Sufficient", journal = j-INFO-PROC-LETT, volume = "17", number = "5", pages = "263--268", day = "15", month = dec, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q35", MRnumber = "85h:68026", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "713; 714; 921; C4240 (Programming and algorithm theory)", corpsource = "Inst. f{\"u}r Angewandte Math. und Informatik, Univ. des Saarlandes, Saarbrucken, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "complexity theory; computational complexity; input-output schedule; integrated circuits, VLSI; large scale integration; Thompson's model; Thompson's VLSI model; VLSI; when-oblivious; where-oblivious", treatment = "T Theoretical or Mathematical", } @Article{Tsin:1983:GPS, author = "Yung H. Tsin and Francis Y. Chin", title = "A general program scheme for finding bridges", journal = j-INFO-PROC-LETT, volume = "17", number = "5", pages = "269--272", day = "15", month = dec, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68R10 (05C40 68Q20)", MRnumber = "85i:68039", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; 921; B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics)", corpsource = "Dept. of Computing Sci., Univ. of Alberta, Edmonton, Alta., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "analysis of algorithms; bridges; combinatorial problems; computer programming; graph theory; mathematical techniques --- Graph Theory; optimal parallel algorithms; optimal sequential algorithms; parallel computation; program scheme; undirected graph", treatment = "T Theoretical or Mathematical", } @Article{Asai:1983:CPI, author = "Hitohisa Asai", title = "A consideration of a practical implementation for a new convergence division", journal = j-INFO-PROC-LETT, volume = "17", number = "5", pages = "273--281", day = "15", month = dec, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "65V05 (68M05)", MRnumber = "85d:65077", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C5230 (Digital arithmetic methods)", corpsource = "Computer Sci. Dept., Christopher Newport Coll., Newport News, VA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer programming; convergence division; digital arithmetic; division algorithm; performance time; table size", treatment = "P Practical", } @Article{Kasyanov:1984:LC, author = "V. N. Kas{\cprime}yanov", title = "Loop Cleaning", journal = j-INFO-PROC-LETT, volume = "18", number = "1", pages = "1--6", day = "20", month = jan, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68N05", MRnumber = "85e:68005", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C6150C (Compilers, interpreters and other processors)", corpsource = "Computing Center, Acad. of Sci., Novosibirsk, USSR", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "compilers; computer programming; equivalent program transformations; large block schema; loop; loop cleaning; optimisation; program compilers; program optimizations; recursive procedure body", treatment = "P Practical", } @Article{Magott:1984:PEC, author = "Jan Magott", title = "Performance Evaluation of Concurrent Systems Using {Petri} Nets", journal = j-INFO-PROC-LETT, volume = "18", number = "1", pages = "7--13", day = "20", month = jan, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q90", MRnumber = "85f:68075", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; 921; C1160 (Combinatorial mathematics); C5420 (Mainframes and minicomputers)", corpsource = "Inst. of Cybernetics, Tech. Univ. Wroclaw, Wroclaw, Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer systems, digital; concurrent systems; exponential complexity; graph theory; LP; mathematical techniques --- Graph Theory; minimal cycle time; NP-complete; parallel processing; performance evaluation; Petri nets; polynomial algorithm", treatment = "P Practical", } @Article{Saoudi:1984:ITL, author = "A. Saoudi", title = "Infinitary Tree Languages Recognized by $\omega$-automata", journal = j-INFO-PROC-LETT, volume = "18", number = "1", pages = "15--19", day = "20", month = jan, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "03D05 (68Q05 68Q45)", MRnumber = "85e:03092", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "721; C1160 (Combinatorial mathematics); C4210 (Formal logic); C4220 (Automata theory)", corpsource = "Univ. de Paris VII, Paris, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "AFL-like operations; automata theory; formal languages; infinite Sigma-trees; omega-automata; omega-languages; Rabin's automata; regular recursive schemas; top-down infinite tree automata; trees (mathematics)", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Kreowski:1984:NNR, author = "Hans-J{\"o}rg Kreowski and Grzegorz Rozenberg", title = "Note on node-rewriting graph grammars", journal = j-INFO-PROC-LETT, volume = "18", number = "1", pages = "21--24", day = "20", month = jan, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q50", MRnumber = "85f:68053", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic)", corpsource = "Fachbereich Math. und Informatik, Tech. Univ. Bremen, Bremen, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "Berlin approach; gluing; grammars; graph theory; NLC approach; node-labeled undirected; node-rewriting graph grammars", treatment = "T Theoretical or Mathematical", } @Article{Rowe:1984:DIS, author = "Neil C. Rowe", title = "Diophantine Inference on a Statistical Database", journal = j-INFO-PROC-LETT, volume = "18", number = "1", pages = "25--31", day = "20", month = jan, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C6160 (Database management systems (DBMS))", corpsource = "Dept. of Computer Sci., Naval Postgraduate School, Monterey, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "database management systems; database systems; DBMS; inferences; queryable values; simultaneous Diophantine equations; statistical aggregates; statistical analysis; statistical database", treatment = "P Practical", } @Article{Topor:1984:TDD, author = "Rodney W. Topor", title = "Termination Detection for Distributed Computations", journal = j-INFO-PROC-LETT, volume = "18", number = "1", pages = "33--36", day = "20", month = jan, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "722; 723; C1160 (Combinatorial mathematics); C6150J (Operating systems)", corpsource = "Dept. of Computer Sci., Univ. of Melbourne, Parkville, Vic., Australia", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer programming; computer systems, digital; concurrency; CSP; distributed computations; distributed processing; graph theory; operating systems (computers); OS; program derivation; termination", treatment = "P Practical", } @Article{Atallah:1984:PSO, author = "Mikhail J. Atallah", title = "Parallel Strong Orientation of an Undirected Graph", journal = j-INFO-PROC-LETT, volume = "18", number = "1", pages = "37--39", day = "20", month = jan, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q10 (05C20 68R10)", MRnumber = "85j:68038", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory); C6150J (Operating systems)", corpsource = "Dept. of Computer Sci., Purdue Univ., West Lafayette, IN, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "common memory; computer programming --- Algorithms; computer systems, digital --- Parallel Processing; graph theory; mathematical techniques; operating systems (computers); parallel processing; parallel solutions; read conflicts; shared memory model; strong orientation; undirected graph; write conflicts", treatment = "P Practical", } @Article{Chin:1984:MVD, author = "Francis Chin and Cao An Wang", title = "Minimum vertex distance between separable convex polygons", journal = j-INFO-PROC-LETT, volume = "18", number = "1", pages = "41--45", day = "20", month = jan, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68U05 (52-04)", MRnumber = "85f:68090", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Computing Sci., Univ. of Alberta, Edmonton, Alta., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "algorithm theory; graph theory; minimum vertex distance; optimal algorithm; separable convex polygons", treatment = "T Theoretical or Mathematical", } @Article{Jin:1984:LPG, author = "Xiao Long Jin", title = "Large Processors are Good in {VLSI} Chips", journal = j-INFO-PROC-LETT, volume = "18", number = "1", pages = "47--49", day = "20", month = jan, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q35", MRnumber = "85c:68032", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "713; 714; B0250 (Combinatorial mathematics); B1130 (General circuit analysis and synthesis methods); B2570 (Semiconductor integrated circuits)", corpsource = "Dept. of Telecommunication, Shanghai Inst. of Railway Technol., Shanghai, China", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "circuit layout; graph theory; I/O port; integrated circuits, VLSI; large scale integration; monolithic integrated circuits; separator", treatment = "T Theoretical or Mathematical", } @Article{Yodogawa:1984:NAG, author = "Eiji Yodogawa", title = "A note on array grammars", journal = j-INFO-PROC-LETT, volume = "18", number = "1", pages = "51--54", day = "20", month = jan, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68U10 (68Q45)", MRnumber = "85k:68098", MRreviewer = "Rani Siromoney", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Musachino Electrical Communication Lab., Nippon Telegraph and Telephone Public Corp., Tokyo, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "array grammars; digital picture processing; grammars; isometric array grammars; mathematical models; shearing effect; two-dimensional phrase-structure grammars", treatment = "P Practical", } @Article{Geist:1984:PCD, author = "R. Geist", title = "Perception-based configuration design of computer systems", journal = j-INFO-PROC-LETT, volume = "18", number = "1", pages = "55--57", day = "20", month = jan, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C5220 (Computer architecture)", corpsource = "Dept. of Computer Sci., Duke Univ., Durham, NC, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "computer architecture; computer systems; configuration design; perceived mean; student perceptions", treatment = "P Practical", } @Article{Dyer:1984:PAM, author = "M. E. Dyer and A. M. Frieze", title = "A partitioning algorithm for minimum weighted {Euclidean} matching", journal = j-INFO-PROC-LETT, volume = "18", number = "2", pages = "59--62", day = "28", month = feb, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q20 (68R05 90C35)", MRnumber = "85h:68018", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; B6140C (Optical information, image and video signal processing); C1250 (Pattern recognition)", corpsource = "Dept. of Maths. and Statistics, Teesside Polytech., Middlesbrough, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer programming; fast expected running time; minimum weighted Euclidean matching; partitioning algorithm; pattern recognition; picture processing; unit square", treatment = "T Theoretical or Mathematical", } @Article{Hull:1984:PVS, author = "M. Elizabeth C. Hull", title = "A parallel view of stable marriages", journal = j-INFO-PROC-LETT, volume = "18", number = "2", pages = "63--66", day = "28", month = feb, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C6120 (File organisation)", corpsource = "School of Computer Sci., Ulster Polytech., Newtownabbey, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer programming; coroutine; data structures; parallel processing; parallelism; recursion; stable marriages", treatment = "P Practical", } @Article{Schlorer:1984:ISC, author = "Jan Schl{\"o}rer", title = "Insecurity of Set Controls for Statistical Databases", journal = j-INFO-PROC-LETT, volume = "18", number = "2", pages = "67--71", day = "28", month = feb, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C6130 (Data handling techniques); C6160 (Database management systems (DBMS))", corpsource = "Klinische Dokumentation, Univ. Ulm, Ulm, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "database management systems; database systems; DBMS; inference controls; insecure; query set; security of data; set controls; statistical databases; statistics", treatment = "P Practical", } @Article{Turpin:1984:EBB, author = "Russell Turpin and Brian A. Coan", title = "Extending Binary {Byzantine Agreement} to Multivalued {Byzantine Agreement}", journal = j-INFO-PROC-LETT, volume = "18", number = "2", pages = "73--76", day = "28", month = feb, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "722; 723; C6150J (Operating systems)", corpsource = "Information Research Associates, Austin, TX, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "binary Byzantine agreement; computer programming --- Algorithms; computer systems, digital; distributed processing; distributed systems; fault tolerance; multivalued Byzantine agreement; multivalued domain; operating systems (computers); OS", treatment = "P Practical", } @Article{Holenderski:1984:NSV, author = "Leszek Holenderski", title = "A note on specifying and verifying concurrent processes", journal = j-INFO-PROC-LETT, volume = "18", number = "2", pages = "77--85", day = "28", month = feb, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q10 (68Q60)", MRnumber = "86c:68021", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "722; 723; C4240 (Programming and algorithm theory)", corpsource = "Inst. of Informatics, Univ. of Warsaw, Warsaw, Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "alphabet symbols; binary semaphores; computer systems, digital; concurrent computations; concurrent processes; correctness proof; finite alphabet; finite sequences; parallel processing; programming theory; sequential processes; shuffle; specifying; unbounded semaphore; verifying", treatment = "T Theoretical or Mathematical", } @Article{Katsuno:1984:WDN, author = "Hirofumi Katsuno", title = "When Do Non-Conflict-Free Multivalued Dependency Sets Appear?", journal = j-INFO-PROC-LETT, volume = "18", number = "2", pages = "87--92", day = "28", month = feb, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68P15", MRnumber = "86h:68028", MRreviewer = "W. W. Armstrong", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C6160D (Relational databases)", corpsource = "Musashino Electrical Communication Lab., NTT, Tokyo, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Armstrong relation; Cartesian product; conflict-free sets; data dependencies; database management systems; database systems; database theory; distributed databases; functional dependency; integrity constraints; multivalued dependency sets; relational database", treatment = "P Practical", } @Article{Ihm:1984:LPP, author = "Heung-Soon S. Ihm and Simeon C. Ntafos", title = "On Legal Path Problems in Digraphs", journal = j-INFO-PROC-LETT, volume = "18", number = "2", pages = "93--98", day = "28", month = feb, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68R10 (05-04 05C20)", MRnumber = "85h:68067", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; 921; C4240 (Programming and algorithm theory); C6150G (Diagnostic, testing, debugging and evaluating systems)", corpsource = "ISC Corporation, Spokane, WA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computationally intractable; computer programming --- Algorithms; digraphs; directed graphs; impossible paths; legal path problems; mathematical techniques; NP completeness; program testing; programming theory", treatment = "T Theoretical or Mathematical", } @Article{Scarioni:1984:PAE, author = "F. Scarioni and H. G. Speranza", title = "A probabilistic analysis of an error-correcting algorithm for the {Towers} of {Hanoi} puzzle", journal = j-INFO-PROC-LETT, volume = "18", number = "2", pages = "99--103", day = "28", month = feb, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25", MRnumber = "87j:68057", MRreviewer = "Derick Wood", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C1290 (Applications of systems theory)", corpsource = "Dept. of Maths., Univ. of Milan, Milano, Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "disks; error-correcting algorithm; iterative methods; legal move; needles; operations research; probabilistic analysis; towers of Hanoi Puzzle", treatment = "T Theoretical or Mathematical", } @Article{Miyano:1984:RTW, author = "Satoru Miyano", title = "Remarks on Two-Way Automata with Weak-Counters", journal = j-INFO-PROC-LETT, volume = "18", number = "2", pages = "105--107", day = "28", month = feb, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q05 (68Q45)", MRnumber = "86g:68043", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "721; C4220 (Automata theory)", corpsource = "Dept. of Maths., Kyushu Univ., Fukuoka, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "add; automata theory; counter; deterministic automata; nonnegative integer; recognition power; subtract; two-way automata; weak-counter; zero test", treatment = "P Practical", } @Article{Lee:1984:CCM, author = "C. C. Lee and D. T. Lee", title = "On a Circle-Cover Minimization Problem", journal = j-INFO-PROC-LETT, volume = "18", number = "2", pages = "109--115", day = "28", month = feb, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68U05", MRnumber = "85h:68080", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; B0250 (Combinatorial mathematics); B0260 (Optimisation techniques); C1160 (Combinatorial mathematics); C1180 (Optimisation techniques)", corpsource = "Dept. of Electrical Engng. and Computer Sci., Northwestern Univ., Evanston, IL, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "circle-cover minimization problem; circular-arcs; computational geometry; computer programming; graph theory; minimisation; minimum cover problem; union", treatment = "T Theoretical or Mathematical", } @Article{Wilf:1984:BET, author = "Herbert S. Wilf", title = "Backtrack: an {$O(1)$} expected time algorithm for the graph coloring problem", journal = j-INFO-PROC-LETT, volume = "18", number = "3", pages = "119--121", day = "30", month = mar, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q20 (05C15 68R10)", MRnumber = "86c:68036", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; 921; B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics)", corpsource = "Dept. of Maths., Univ. of Pennsylvania, Philadelphia, PA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "backtrack algorithm; computer programming; decision problem; decision theory and analysis; graph coloring problem; graph colouring; mathematical techniques --- Graph Theory; O(1) expected time algorithm; search tree; trees (mathematics)", treatment = "T Theoretical or Mathematical", } @Article{Zemel:1984:ALM, author = "Eitan Zemel", title = "An {$O(n)$} algorithm for the linear multiple choice {Knapsack} problem and related problems", journal = j-INFO-PROC-LETT, volume = "18", number = "3", pages = "123--128", day = "30", month = mar, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "90C08 (68Q25)", MRnumber = "85h:90083", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "B0260 (Optimisation techniques); C1180 (Optimisation techniques)", corpsource = "J.L. Kellogg Graduate School of Management, Northwestern Univ., Evanston, IL, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "convex programming; geometric location models; linear multiple choice Knapsack problem; linear programming; O(n) algorithm; rectilinear norm", treatment = "T Theoretical or Mathematical", } @Article{Moller-Nielsen:1984:EFS, author = "Peter Moller-Nielsen and Jorgen Staunstrup", title = "Experiments with a Fast String Searching Algorithm", journal = j-INFO-PROC-LETT, volume = "18", number = "3", pages = "129--135", day = "30", month = mar, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Computer Sci. Dept., Aarhus Univ., Aarhus, Denmark", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm theory; computer programming; fast string searching algorithm; MultiMaren multiprocessor; multiprocessing systems; multiprocessor; string searching", treatment = "T Theoretical or Mathematical", } @Article{Remmers:1984:TDL, author = "J. H. Remmers", title = "A technique for developing loop invariants", journal = j-INFO-PROC-LETT, volume = "18", number = "3", pages = "137--139", day = "30", month = mar, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Dept. of Maths. and Computer Sci., Eastern Michigan Univ., Ypsilanti, MI, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "binary search; linear search; loop invariants development; postcondition; precondition; programming theory", treatment = "T Theoretical or Mathematical", } @Article{Alia:1984:FVC, author = "G. Alia and F. Barsi and E. Martinelli", title = "A fast {VLSI} conversion between binary and residue systems", journal = j-INFO-PROC-LETT, volume = "18", number = "3", pages = "141--145", day = "30", month = mar, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "B1130B (Computer-aided circuit analysis and design); B2570 (Semiconductor integrated circuits); C7410D (Electronic engineering computing)", corpsource = "Istituto di Elaborazione dell'Informazione, CNR, Pisa, Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "binary number systems; circuit layout CAD; circuit layouts; fast VLSI conversion; large scale integration; residue systems", treatment = "T Theoretical or Mathematical", } @Article{Berkowitz:1984:CDS, author = "Stuart J. Berkowitz", title = "On Computing the Determinant in Small Parallel Time Using a Small Number of Processors", journal = j-INFO-PROC-LETT, volume = "18", number = "3", pages = "147--150", day = "30", month = mar, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "65W05 (68Q15)", MRnumber = "85k:65111", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "722; 723; C4240 (Programming and algorithm theory)", corpsource = "Dept. of Computer Sci., Univ. of Toronto, Toronto, Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "arbitrary commutative ring; characteristic polynomial; computational complexity; computer systems, digital; determinant; parallel algebraic circuit complexity; parallel time; polynomials; processors; upper bounds", treatment = "T Theoretical or Mathematical", } @Article{Turan:1984:CCG, author = "Gy{\"o}rgy Tur{\'a}n", title = "The critical complexity of graph properties", journal = j-INFO-PROC-LETT, volume = "18", number = "3", pages = "151--153", day = "30", month = mar, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q15 (05C99 68R10 94C15)", MRnumber = "86d:68029", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Inst. for Okonometrie und Operations Res., Rheinische Friedrich-Wilhelms-Univ., Bonn, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "Boolean function; computational complexity; critical complexity; graph properties; graph theory; parallel complexity; parallel processing", treatment = "T Theoretical or Mathematical", } @Article{Apostolico:1984:PMM, author = "A. Apostolico and R. Giancarlo", title = "Pattern matching machine implementation of a fast test for unique decipherability", journal = j-INFO-PROC-LETT, volume = "18", number = "3", pages = "155--158", day = "30", month = mar, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "B6140C (Optical information, image and video signal processing); C1160 (Combinatorial mathematics); C1250 (Pattern recognition); C1260 (Information theory)", corpsource = "ISI, Univ. of Salerno, Salerno, Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "codes; fast implementation; graph theory; pattern matching machine; pattern recognition; Sardinas- Patterson-Even test; unique decipherability", treatment = "N New Development; T Theoretical or Mathematical", } @Article{Cormack:1984:AAH, author = "Gordon V. Cormack and R. Nigel Horspool", title = "Algorithms for Adaptive {Huffman} Codes", journal = j-INFO-PROC-LETT, volume = "18", number = "3", pages = "159--165", day = "30", month = mar, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "94A29 (94B30)", MRnumber = "86g:94032", MRreviewer = "N. L. Aggarwal", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C1260 (Information theory)", corpsource = "School of Computer Sci., McGill Univ., Montreal, Que., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "adaptive Huffman codes algorithms; binary tree; codes; codes, symbolic; computer programming --- Algorithms", treatment = "T Theoretical or Mathematical", } @Article{Miola:1984:AAA, author = "Alfonso Miola", title = "Algebraic approach to $p$-adic conversion of rational numbers", journal = j-INFO-PROC-LETT, volume = "18", number = "3", pages = "167--171", day = "30", month = mar, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "11A63 (11Y99 68Q99)", MRnumber = "86d:11012", MRreviewer = "J. C. Lagarias", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics)", corpsource = "Istituto di Analisi dei Sistemi ed Informatica, CNR, Roma, Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "algebraic approach; approximation method; continued fraction expansion; direct mappings; Hensel-codes; inverse mappings; number theory; p-adic conversion; rational numbers", treatment = "T Theoretical or Mathematical", } @Article{Lickteig:1984:NBR, author = "Thomas Lickteig", title = "A note on border rank", journal = j-INFO-PROC-LETT, volume = "18", number = "3", pages = "173--178", day = "30", month = mar, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (65F30)", MRnumber = "86c:68040", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Maths. Inst., Univ. T{\"u}bingen, T{\"u}bingen, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "border rank; closed condition; computational complexity; structural tensor; tensors", treatment = "T Theoretical or Mathematical", } @Article{Cioni:1984:PDD, author = "Gianna Cioni and Antoni Kreczmar", title = "Programmed Deallocation without Dangling Reference", journal = j-INFO-PROC-LETT, volume = "18", number = "4", pages = "179--187", day = "14", month = may, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory); C6120 (File organisation)", corpsource = "Istituto di Analisi dei Sistemi ed Informatica, CNR, Roma, Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithmic approach; computer programming languages; constant time; dangling reference; data processing --- Security of Data; dynamic languages; free frames structure; parallel computation; programmed deallocation strategy; programming theory; run-time systems; searching; storage management", treatment = "A Application; T Theoretical or Mathematical", } @Article{Moffat:1984:PQA, author = "Alistair Moffat and Tadao Takaoka", title = "A priority queue for the all pairs shortest path problem", journal = j-INFO-PROC-LETT, volume = "18", number = "4", pages = "189--193", day = "14", month = may, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; 922; C1140C (Queueing theory); C6120 (File organisation)", corpsource = "Dept. of Computer Sci., Univ. of Canterbury, Christchurch, New Zealand", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "all pairs shortest path problem; array priority queue; computational model; computer programming --- Algorithms; data operations; data processing --- Data Structures; data structure; data structures; Dijkstra's shortest path algorithm; parallel chains data structure; path costs; pointer manipulations; priority queue; probability; queueing theory; restricted situation; Yen's bound", treatment = "A Application; T Theoretical or Mathematical", } @Article{Allison:1984:TSP, author = "D. C. S. Allison and M. T. Noga", title = "The {$L_1$} traveling salesman problem", journal = j-INFO-PROC-LETT, volume = "18", number = "4", pages = "195--199", day = "14", month = may, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C1180 (Optimisation techniques); C1290 (Applications of systems theory)", corpsource = "Dept. of Computer Sci., Virginia Polytech. Inst. and State Univ., Blacksburg, VA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "convex hull; decomposition procedure; heuristic programming; initial subtour; L/sub 1/ traveling salesman problem; operations research; polynomial-time heuristics; tour optimality", treatment = "T Theoretical or Mathematical", } @Article{Tiekenheinrich:1984:LBM, author = "J{\"u}rgen Tiekenheinrich", title = "A $4n$-lower bound on the monotone network complexity of a one-output {Boolean} function", journal = j-INFO-PROC-LETT, volume = "18", number = "4", pages = "201--202", day = "14", month = may, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "94C10", MRnumber = "85m:94048", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "4n-lower bound; binary functions; Boolean functions; majority-function; monotone network complexity; one-output Boolean function", treatment = "T Theoretical or Mathematical", } @Article{Mannila:1984:SLA, author = "Heikki Mannila and Esko Ukkonen", title = "A simple linear-time algorithm for in situ merging", journal = j-INFO-PROC-LETT, volume = "18", number = "4", pages = "203--208", day = "14", month = may, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory); C6130 (Data handling techniques)", corpsource = "Dept. of Computer Sci., Univ. of Helsinki, Helsinki, Finland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "bounded workspace; computer programming --- Algorithms; computer systems programming; divide-and-conquer algorithm; linear-time algorithm; merging; ordered lists; programming theory; sorting; sublinear workspace", treatment = "T Theoretical or Mathematical", } @Article{Yamasaki:1984:NCI, author = "Susumu Yamasaki and Mikio Yoshida and Shuji Doshita and Mikito Hirata", title = "A new combination of input and unit deductions for {Horn} sentences", journal = j-INFO-PROC-LETT, volume = "18", number = "4", pages = "209--213", day = "14", month = may, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68T15 (03B35)", MRnumber = "86c:68072", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C4210 (Formal logic)", corpsource = "Dept. of Information Sci., Kyoto Univ., Kyoto, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer metatheory; formal languages; formal logic; Horn sentences; input; input refutation; logic programs; theorem proving; unit deductions; variable substitution procedures", treatment = "T Theoretical or Mathematical", } @Article{Best:1984:FC, author = "Eike Best", title = "Fairness and conspiracies", journal = j-INFO-PROC-LETT, volume = "18", number = "4", pages = "215--220", day = "14", month = may, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q90 (68Q10)", MRnumber = "85h:68053", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See also erratum \cite{Best:1984:EFC}.", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "GMD-Fi, St. Augustin, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "concurrent programs; conspiracies; fairness; formal logic; multiprocessing programs; nets; Petri nets", treatment = "T Theoretical or Mathematical", } @Article{Lifschitz:1984:VPG, author = "Vladimir Lifschitz", title = "On verification of programs with {GOTO} statements", journal = j-INFO-PROC-LETT, volume = "18", number = "4", pages = "221--225", day = "14", month = may, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q60 (03B70)", MRnumber = "86h:68120", MRreviewer = "Andrzej Blikle", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Computer Sci. Dept., Univ. of Texas, El Paso, TX, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "annotated program; complete proofs; correctness proof; de Bruin; equivalence; GOTO statements; Hoare's logic; informal proof; intermittent assertions; programming theory; programs; syntax", treatment = "A Application; T Theoretical or Mathematical", } @Article{Ohya:1984:FVA, author = "T. Ohya and M. Iri and K. Murota", title = "A fast {Voronoi}-diagram algorithm with quaternary tree bucketing", journal = j-INFO-PROC-LETT, volume = "18", number = "4", pages = "227--231", day = "14", month = may, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Math. Engng. and Instrumentation Phys., Univ. of Tokyo, Tokyo, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "algorithm theory; fast practical algorithm; generators; incremental method; preprocessing procedure; quaternary tree bucketing; robust; trees (mathematics); Voronoi-diagram algorithm", treatment = "T Theoretical or Mathematical", } @Article{Atzeni:1984:FDR, author = "Paolo Atzeni and Nicola M. Morfuni", title = "Functional Dependencies in Relations with Null Values", journal = j-INFO-PROC-LETT, volume = "18", number = "4", pages = "233--238", day = "14", month = may, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C6160D (Relational databases)", corpsource = "Istituto di Analisi dei Sistemi ed Informatica, CNR, Roma, Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "database management systems; database systems; framework; functional dependencies; functional dependency; generality; inference rules; naturalness; null values; relational database; relational databases; relational model; semantics", treatment = "T Theoretical or Mathematical", } @Article{Monien:1984:DTW, author = "B. Monien", title = "Deterministic Two-Way One-Head Pushdown Automata are Very Powerful", journal = j-INFO-PROC-LETT, volume = "18", number = "5", pages = "239--242", day = "18", month = jun, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q05 (03D05 68Q15)", MRnumber = "85j:68034", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "721; C4210 (Formal logic); C4220 (Automata theory)", corpsource = "Univ. of Paderborn, Paderborn, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "2DPDA; automata theory; complexity classes; computational complexity; finite automata; formal languages; one-letter input alphabet; pushdown automata; two-letter alphabet; unary encoding", treatment = "T Theoretical or Mathematical", } @Article{Fle:1984:MIT, author = "M. P. Fl{\'e} and G. Roucairol", title = "Multiserialization of Iterated Transactions", journal = j-INFO-PROC-LETT, volume = "18", number = "5", pages = "243--247", day = "18", month = jun, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68P10 (68N25)", MRnumber = "85j:68018", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C6160 (Database management systems (DBMS))", corpsource = "Lab. de Recherche en Informatique, Univ. Paris-Sud, Orsay, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "concurrency; concurrent transactions; data base systems; database management systems; database systems; deadlock; iterated transactions; mutual exclusion; operating system; serializability; serialization", treatment = "T Theoretical or Mathematical", } @Article{Barth:1984:ACT, author = "Gerhard Barth", title = "An analytical comparison of two string searching algorithms", journal = j-INFO-PROC-LETT, volume = "18", number = "5", pages = "249--256", day = "18", month = jun, year = "1984", CODEN = "IFPLAT", DOI = "https://doi.org/10.1016/0020-0190(84)90003-6", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25", MRnumber = "85m:68012", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Fachbereich Informatik, Univ. Kaiserslautern, Kaiserslautern, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm theory; average case analysis; average case complexities; combinatorial algorithms; comparisons; complexity; computer programming; heuristics; KMP algorithm; Knuth-Morris-Pratt algorithm; Markov chain theory; pattern matching algorithms; string searching algorithms; trial-and-error", treatment = "T Theoretical or Mathematical", } @Article{Vardi:1984:NLD, author = "Moshe Y. Vardi", title = "A note on lossless database decompositions", journal = j-INFO-PROC-LETT, volume = "18", number = "5", pages = "257--260", day = "18", month = jun, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68P15", MRnumber = "86a:68020", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C6160D (Relational databases)", corpsource = "IBM Res. Lab., San Jose, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "database management systems; dependencies; lossless database decompositions; lossless join; relation schemes", treatment = "T Theoretical or Mathematical", } @Article{Goodman:1984:CMD, author = "Nathan Goodman and Y. C. Tay", title = "A characterization of multivalued dependencies equivalent to a join dependency", journal = j-INFO-PROC-LETT, volume = "18", number = "5", pages = "261--266", day = "18", month = jun, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68P15", MRnumber = "85m:68007", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C6160 (Database management systems (DBMS))", corpsource = "Boston Univ., Boston, MA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "acyclic database schemas; acyclicity; conflict-free cover; database management systems; database systems; JD; join dependencies; join dependency; multivalued dependencies; MVDS; subset property", treatment = "T Theoretical or Mathematical", } @Article{Blazewicz:1984:SIP, author = "J. Blazewicz and J. Weglarz and M. Drabowski", title = "Scheduling independent $2$-processor tasks to minimize schedule length", journal = j-INFO-PROC-LETT, volume = "18", number = "5", pages = "267--273", day = "18", month = jun, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "722; 723; C6150J (Operating systems)", corpsource = "Inst. Automatyki, Politech. Poznanska, Poznan, Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer systems, digital; deterministic scheduling theory; independent 2- processor tasks; microprocessor systems; parallel processing; preemptive scheduling; schedule-length; scheduling", treatment = "T Theoretical or Mathematical", } @Article{Trakhtenbrot:1984:SET, author = "M. B. Trakhtenbrot", title = "Some Equivalent Transformations of Recursive Programs Based on Their Schematic Properties", journal = j-INFO-PROC-LETT, volume = "18", number = "5", pages = "275--283", day = "18", month = jun, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q55 (68N05)", MRnumber = "86g:68116", MRreviewer = "Ir{\`e}ne Guessarian", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Computing Center, Acad. of Sci., Novosibirsk, USSR", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "complexity; computer metatheory; computer programming --- Theory; equivalent transformations; program transformation; programming theory; recursive programs; schematic properties", treatment = "T Theoretical or Mathematical", } @Article{Courcelle:1984:SNR, author = "Bruno Courcelle", title = "Some negative results concerning {DPDAs}", journal = j-INFO-PROC-LETT, volume = "18", number = "5", pages = "285--289", day = "18", month = jun, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q05", MRnumber = "86i:68030", MRreviewer = "Yasuyoshi Inagaki", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory)", corpsource = "Univ. Bordeaux-I, Dept. of Maths., Talence, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "deterministic pushdown automaton; DPDA; equivalence; finite automata; mapping; rational transduction; regularity", treatment = "T Theoretical or Mathematical", } @Article{Tazawa:1984:CRP, author = "Shinsei Tazawa", title = "On the consecutive retrieval property for generalized binary queries", journal = j-INFO-PROC-LETT, volume = "18", number = "5", pages = "291--293", day = "18", month = jun, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68P20", MRnumber = "86j:68025", MRreviewer = "Fabrizio Luccio", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4290 (Other computer theory); C6120 (File organisation)", corpsource = "Faculty of Sci. and Technol., Kinki Univ., Osaka, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "attributes; binary queries; consecutive retrieval property; CR-sequence; CRP; file organisation; file organization; lower bound; retrieval time; storage space", treatment = "T Theoretical or Mathematical", } @Article{Friesen:1984:SSS, author = "D. K. Friesen and M. A. Langston", title = "A storage-size selection problem", journal = j-INFO-PROC-LETT, volume = "18", number = "5", pages = "295--296", day = "18", month = jun, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25", MRnumber = "86b:68019", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory); C6150J (Operating systems)", corpsource = "Computer Sci. Dept., Texas A and M Univ., College Station, TX, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm theory; approximation algorithms; bin packing problem; bin size; computer programming; memory allocation; storage allocation; storage-size selection; wasted space; worst-case analysis", treatment = "T Theoretical or Mathematical", } @Article{Zak:1984:LEF, author = "Stanislav {\v{Z}}{\'a}k", title = "Letter to the editor: {``Finitary and infinitary interpretations of languages'' [Math. Systems Theory {\bf 15} (1981/82), no. 3, 251--265; MR 83h:68119] by H. A. Maurer, A. Salomaa and D. Wood}", journal = j-INFO-PROC-LETT, volume = "18", number = "5", pages = "297--298", day = "18", month = jun, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q45 (05C15)", MRnumber = "85k:68052", bibdate = "Sat Apr 11 12:24:20 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", } @Article{Madduri:1984:EBA, author = "Hari Madduri and Raphael Finkel", title = "Extension of the {Banker}'s Algorithm for Resource Allocation in a Distributed Operating System", journal = j-INFO-PROC-LETT, volume = "19", number = "1", pages = "1--8", day = "26", month = jul, year = "1984", CODEN = "IFPLAT", DOI = "https://doi.org/10.1016/0020-0190(84)90119-4", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", URL = "http://www.sciencedirect.com/science/article/pii/0020019084901194", acknowledgement = ack-nhfb, classification = "722; 723; C6150J (Operating systems)", corpsource = "Computer Sci. Dept., Univ. of Wisconsin, Madison, WI, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "banker's algorithm; Banker's algorithm; computer operating systems; computer programming; computer systems, digital --- Distributed; deadlock avoidance; deadlocks; distributed environment; operating systems (computers); resource allocation", treatment = "T Theoretical or Mathematical", } @Article{Oyamaguchi:1984:SRS, author = "Michio Oyamaguchi", title = "Some Remarks on Subclass Containment Problems for Several Classes of {DPDA}'s", journal = j-INFO-PROC-LETT, volume = "19", number = "1", pages = "9--12", day = "26", month = jul, year = "1984", CODEN = "IFPLAT", DOI = "https://doi.org/10.1016/0020-0190(84)90120-0", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q05 (03D05 68Q45)", MRnumber = "86d:68020", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", URL = "http://www.sciencedirect.com/science/article/pii/0020019084901200", acknowledgement = ack-nhfb, classification = "721; C4220 (Automata theory)", corpsource = "Faculty of Engng., Mie Univ., Tsu-shi, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; deterministic automata; deterministic pushdown automata; deterministic pushdown automaton; DPDA; necessary stacking derivation; subclass containment; subclass containment problems", treatment = "T Theoretical or Mathematical", } @Article{Woo:1984:PDP, author = "Nam Sung Woo and Carl H. Smith and Ashok Agrawala", title = "A proof of the determinacy property of the data flow schema", journal = j-INFO-PROC-LETT, volume = "19", number = "1", pages = "13--16", day = "26", month = jul, year = "1984", CODEN = "IFPLAT", DOI = "https://doi.org/10.1016/0020-0190(84)90121-2", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q99", MRnumber = "85m:68029", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", URL = "http://www.sciencedirect.com/science/article/pii/0020019084901212", acknowledgement = ack-nhfb, classification = "723; C4220 (Automata theory)", corpsource = "Dept. of Computer Sci., Univ. of Maryland, College Park, MD, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "abstract semantics; APPLY actors; computer metatheory; data flow determinacy; data flow schema; determinacy; deterministic automata; SWITCH actors", treatment = "T Theoretical or Mathematical", } @Article{Parker:1984:CCS, author = "J. R. Parker", title = "On Converting Character Strings to Integers", journal = j-INFO-PROC-LETT, volume = "19", number = "1", pages = "17--19", day = "26", month = jul, year = "1984", CODEN = "IFPLAT", DOI = "https://doi.org/10.1016/0020-0190(84)90122-4", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", URL = "http://www.sciencedirect.com/science/article/pii/0020019084901224", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Dept. of Computer Sci., Univ. of Calgary, Calgary, Alta., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "character strings; character to integer conversion; computer programming; integer overflow; programming theory", treatment = "T Theoretical or Mathematical", } @Article{Bechtold:1984:UEH, author = "Ulrich Bechtold and Klaus K{\"u}spert", title = "On the Use of Extendible Hashing without Hashing", journal = j-INFO-PROC-LETT, volume = "19", number = "1", pages = "21--26", day = "26", month = jul, year = "1984", CODEN = "IFPLAT", DOI = "https://doi.org/10.1016/0020-0190(84)90123-6", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", URL = "http://www.sciencedirect.com/science/article/pii/0020019084901236", abstract = "The authors report on the use of decimal numbers coded in EBCDIC which are stored in the EXHASH table without prior randomization. Thus, they do not distinguish between keys and pseudokeys. This allows for the sequential processing of records in key order which is commonly needed in database applications. The performance of the method is compared to that of perfect randomization by means of simulation series. The results indicate that packed decimal keys can be used in EXHASH without randomization, whereas the use of unpacked decimal keys necessitates randomization to avoid an intolerable growth of the EXHASH directory. The storage utilization in the leaves (hash buckets), however, is shown to be fairly high both in the case of packed and of unpacked decimal pseudokeys.", acknowledgement = ack-nhfb, classification = "723; C6120 (File organisation)", corpsource = "Dept of Computer Sci., Univ. of Kaiserslautern, Kaiserslautern, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "data processing; data records; data structures; decimal numbers; direct access; dynamic hashing; EBCDIC; extendible hashing; extensibility; hash table; hashing; perfect randomization method; randomization; unpacked decimal numbers", treatment = "T Theoretical or Mathematical", } @Article{Faigle:1984:MCT, author = "Ulrich Faigle and Rainer Schrader", title = "Minimizing Completion Time for a Class of Scheduling Problems", journal = j-INFO-PROC-LETT, volume = "19", number = "1", pages = "27--29", day = "26", month = jul, year = "1984", CODEN = "IFPLAT", DOI = "https://doi.org/10.1016/0020-0190(84)90124-8", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "90B35", MRnumber = "85h:90062", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", URL = "http://www.sciencedirect.com/science/article/pii/0020019084901248", acknowledgement = ack-nhfb, classification = "913; 921; C6150J (Operating systems)", corpsource = "Dept. of Operations Res., Rheinische Friedrich-Wilhelms-Univ., Bonn, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "greedy algorithm; N-free ordered sets; optimization; precedence constraints; scheduling; setup minimization; weighted linear scheduling problems", treatment = "T Theoretical or Mathematical", } @Article{Savitch:1984:PRT, author = "Walter J. Savitch and Paul M. B. Vit{\'a}nyi", title = "On the Power of Real-Time Two-Way Multihead Finite Automata with Jumps", journal = j-INFO-PROC-LETT, volume = "19", number = "1", pages = "31--35", day = "26", month = jul, year = "1984", CODEN = "IFPLAT", DOI = "https://doi.org/10.1016/0020-0190(84)90125-X", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q05 (03D05)", MRnumber = "85j:68036", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", URL = "http://www.sciencedirect.com/science/article/pii/002001908490125X", acknowledgement = ack-nhfb, classification = "721; C4220 (Automata theory)", corpsource = "Dept. of Electrical Engng. and Computer Sci., Univ. of California, San Diego, La Jolla, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; finite automata; jumps; nondeterminism; number of heads; real-time finite automata", treatment = "T Theoretical or Mathematical", } @Article{Bertossi:1984:DSS, author = "Alan A. Bertossi", title = "Dominating sets for split and bipartite graphs", journal = j-INFO-PROC-LETT, volume = "19", number = "1", pages = "37--40", day = "26", month = jul, year = "1984", CODEN = "IFPLAT", DOI = "https://doi.org/10.1016/0020-0190(84)90126-1", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (05C35 68R10)", MRnumber = "86a:68034", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", URL = "http://www.sciencedirect.com/science/article/pii/0020019084901261", acknowledgement = ack-nhfb, classification = "921; B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics)", corpsource = "Dipartimento di Informatica, Univ. di Pisa, Pisa, Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "bipartite graphs; chordal graphs; dominating set; graph theory; mathematical techniques; minimum cardinality dominating set; split graphs; undirected graph", treatment = "T Theoretical or Mathematical", } @Article{Subrahmanyam:1984:EFL, author = "P. A. Subrahmanyam and J.-H. You", title = "On Embedding Functions in Logic", journal = j-INFO-PROC-LETT, volume = "19", number = "1", pages = "41--46", day = "26", month = jul, year = "1984", CODEN = "IFPLAT", DOI = "https://doi.org/10.1016/0020-0190(84)90127-3", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68T25", MRnumber = "86b:68045", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", URL = "http://www.sciencedirect.com/science/article/pii/0020019084901273", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory); C6140D (High level languages)", corpsource = "Dept. of Computer Sci., Univ. of Utah, Salt Lake City, UT, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer programming languages; embedding functions; first-order predicate logic; functions; high level languages; infinite data structures; knowledge-based inferencing; lazy reduction; logic; logic-based languages; pattern-driven reduction; programming theory; Prolog; reduction mechanism; search-based computations; software engineering; terminating computations", treatment = "T Theoretical or Mathematical", } @Article{Akl:1984:OAP, author = "Selim G. Akl", title = "An optimal algorithm for parallel selection", journal = j-INFO-PROC-LETT, volume = "19", number = "1", pages = "47--50", day = "26", month = jul, year = "1984", CODEN = "IFPLAT", DOI = "https://doi.org/10.1016/0020-0190(84)90128-5", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68P10", MRnumber = "85j:68017", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", URL = "http://www.sciencedirect.com/science/article/pii/0020019084901285", acknowledgement = ack-nhfb, classification = "722; 723; C4240 (Programming and algorithm theory)", corpsource = "Dept. of Computing and Information Sci., Queen's Univ., Kingston, Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm theory; computational complexity; computer programming; computer systems, digital --- Parallel Processing; optimal total cost; parallel selection", treatment = "T Theoretical or Mathematical", } @Article{Manber:1984:PLB, author = "Udi Manber", title = "A probabilistic lower bound for checking disjointness of sets", journal = j-INFO-PROC-LETT, volume = "19", number = "1", pages = "51--53", day = "26", month = jul, year = "1984", CODEN = "IFPLAT", DOI = "https://doi.org/10.1016/0020-0190(84)90129-7", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25", MRnumber = "86d:68033", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", URL = "http://www.sciencedirect.com/science/article/pii/0020019084901297", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Dept. of Computer Sci., Univ. of Wisconsin, Madison, WI, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm theory; computational complexity; computer programming; disjointness; probabilistic algorithms; probabilistic choices; probability of error; time speedup", treatment = "T Theoretical or Mathematical", } @Article{Spirakis:1984:SNH, author = "Paul Spirakis and Chee K. Yap", title = "Strong {NP}-hardness of moving many discs", journal = j-INFO-PROC-LETT, volume = "19", number = "1", pages = "55--59", day = "26", month = jul, year = "1984", CODEN = "IFPLAT", DOI = "https://doi.org/10.1016/0020-0190(84)90130-3", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q20 (68Q25)", MRnumber = "86a:68033", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", URL = "http://www.sciencedirect.com/science/article/pii/0020019084901303", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Courant Inst. of Math. Sci., New York Univ., New York, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "algorithm theory; computational complexity; coordination problems; discs; Many (Moving) Bodies Problem; Many Discs Problem; motion; robot system", treatment = "T Theoretical or Mathematical", } @Article{Alt:1984:PMR, author = "Helmut Alt and Kurt Mehlhorn and J. Ian Munro", title = "Partial Match Retrieval in Implicit Data Structures", journal = j-INFO-PROC-LETT, volume = "19", number = "2", pages = "61--65", day = "31", month = aug, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68P10 (68Q25)", MRnumber = "86g:68018", MRreviewer = "Ernst-Erich Doberkat", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C6120 (File organisation); C6160 (Database management systems (DBMS))", corpsource = "Dept. of Computer Sci., Pennsylvania State Univ., University Park, PA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "combinatorial problems; data processing; data structures; database management systems; DBMS; implicit data structures; information retrieval; keys; partial match query", treatment = "P Practical", } @Article{Martin:1984:PFA, author = "Alain J. Martin and Martin Rem", title = "A presentation of the {Fibonacci} algorithm", journal = j-INFO-PROC-LETT, volume = "19", number = "2", pages = "67--68", day = "31", month = aug, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "11Y55 (05-04 05A10 11B39)", MRnumber = "85m:11093", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C7310 (Mathematics computing)", corpsource = "Dept. of Computer Sci., California Inst. of Technol., Pasadena, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "Fibonacci algorithm; mathematics", treatment = "P Practical", } @Article{McKeown:1984:CPM, author = "G. P. McKeown and V. J. Rayward-Smith", title = "Communication Problems on {MIMD} Parallel Computers", journal = j-INFO-PROC-LETT, volume = "19", number = "2", pages = "69--73", day = "31", month = aug, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "722; 723; C5220 (Computer architecture); C5420 (Mainframes and minicomputers)", corpsource = "School of Computing Studies and Accountancy, Univ. of East Anglia, Norwich, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "binary n-cube; bottlenecks; communication problems; computer architecture; computer systems, digital; hot potato principle; MIMD parallel computers; networks; parallel processing; VLSI", treatment = "P Practical", } @Article{Palvia:1984:ABA, author = "Prashant Palvia and Salvatore T. March", title = "Approximating Block Accesses in Database Organizations", journal = j-INFO-PROC-LETT, volume = "19", number = "2", pages = "75--79", day = "31", month = aug, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C4290 (Other computer theory); C6160 (Database management systems (DBMS))", corpsource = "Dept. of Computer and Information Sci., Temple Univ., Philadelphia, PA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "block accesses; blocking factor; computation theory; database management systems; database organizations; database systems; DBMS; design; query", treatment = "T Theoretical or Mathematical", } @Article{Luque:1984:ILP, author = "E. Luque and A. Ripoll", title = "Integer Linear Programming for Microprograms Register Allocation", journal = j-INFO-PROC-LETT, volume = "19", number = "2", pages = "81--85", day = "31", month = aug, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "722; 723; 921; C1180 (Optimisation techniques); C4240 (Programming and algorithm theory); C6150J (Operating systems)", corpsource = "Dept. de Electricidad y Electronica, Univ. Autonoma de Barcelona, Barcelona, Spain", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer architecture --- Microprogramming; control flow; execution time; global internal register allocation; integer linear programming; integer programming; linear programming; mathematical programming, linear; microcoded; microprogramming; microprograms register allocation; register allocation; relative frequencies; step executions; storage allocation", treatment = "T Theoretical or Mathematical", } @Article{Klupsz:1984:LAD, author = "Ewa Klupsz", title = "A linear algorithm of a deadlock avoidance for nonpreemptible resources", journal = j-INFO-PROC-LETT, volume = "19", number = "2", pages = "87--94", day = "31", month = aug, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68N25", MRnumber = "86d:68015", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C6150J (Operating systems)", corpsource = "Inst. of Biocybernetics and Biomed. Engng., Polish Acad. of Sci., Warsaw, Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer programming; deadlock avoidance; fault tolerant computing; Habermann's algorithm; linear algorithm; maximum requests; multitype resource systems; nonpreemptible resources; parallel processing; partitioning processes; resource allocation", treatment = "P Practical", } @Article{Lotti:1984:ATT, author = "Grazia Lotti", title = "Area-time tradeoff for rectangular matrix multiplication in {VLSI} models", journal = j-INFO-PROC-LETT, volume = "19", number = "2", pages = "95--98", day = "31", month = aug, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q35 (65F30 94C05)", MRnumber = "86a:68047", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "B1130B (Computer-aided circuit analysis and design); B1265B (Logic circuits); C5210 (Logic design methods); C7410D (Electronic engineering computing)", corpsource = "Dipartimento di Informatica, Univ. di Pisa, Pisa, Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "area time complexity; CAD; circuit layout CAD; integrated logic circuits; large scale integration; logic design; matrix algebra; rectangular matrix multiplication; VLSI models", treatment = "T Theoretical or Mathematical", } @Article{Lipski:1984:MPA, author = "Witold {Lipski, Jr.}", title = "An {$O(n \log n)$ Manhattan} path algorithm", journal = j-INFO-PROC-LETT, volume = "19", number = "2", pages = "99--102", day = "31", month = aug, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68U05", MRnumber = "86b:68047", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Lab. de Recherche en Informatique, Univ. de Paris-Sud, Orsay, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "complexity; computational complexity; computational geometry; computer programming; data structure; decision tree model; Manhattan path algorithm; O(n log n) Manhattan path algorithm; segments; topology", treatment = "T Theoretical or Mathematical", } @Article{Weyuker:1984:CDF, author = "E. J. Weyuker", title = "The complexity of data flow criteria for test data selection", journal = j-INFO-PROC-LETT, volume = "19", number = "2", pages = "103--109", day = "31", month = aug, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6150G (Diagnostic, testing, debugging and evaluating systems)", corpsource = "Dept. of Computer Sci., New York Univ., New York, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "complexity; computational complexity; data flow analysis; data flow criteria; optimizing compilers; program testing; reliability; test data selection", treatment = "P Practical", } @Article{Wyrostek:1984:ECP, author = "Piotr Wyrostek", title = "Erratum: {``On the `correct prefix property' in precedence parsers'' [Inform. Process. Lett. {\bf 17} (1983), no. 3, 161--165, MR 85a:68112]}", journal = j-INFO-PROC-LETT, volume = "19", number = "2", pages = "111--111", day = "31", month = aug, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q50", MRnumber = "85j:68065", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See \cite{Wyrostek:1983:CPP}.", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C6150C (Compilers, interpreters and other processors)", corpsource = "Regional Computer Center, Krakow, Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "context free grammars; context-free grammars; correct prefix property; precedence parsers; program compilers", treatment = "P Practical", } @Article{Shamir:1984:CCV, author = "A. Shamir and C. P. Schnorr", title = "Cryptanalysis of Certain Variants of {Rabin}'s Signature Scheme", journal = j-INFO-PROC-LETT, volume = "19", number = "3", pages = "113--115", day = "19", month = oct, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68P25 (94A60)", MRnumber = "86e:68029", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C6130 (Data handling techniques)", corpsource = "Dept. of Appl. Math., Weizmann Inst. of Sci., Rehovot, Israel", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "cleartext attacks; cryptanalysis; cryptography; digital signatures; natural perturbation techniques; protect; Rabin's signature scheme", treatment = "T Theoretical or Mathematical", } @Article{Treat:1984:EGS, author = "Joseph M. Treat and Timothy A. Budd", title = "Extensions to Grid Selector Composition and Compilation in {APL}", journal = j-INFO-PROC-LETT, volume = "19", number = "3", pages = "117--123", day = "19", month = oct, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C6150C (Compilers, interpreters and other processors)", corpsource = "Dept. of Comput. Sci., Arizona Univ., Tucson, AZ, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "APL; APL compilation; compilation; computer operating systems; grid selector composition; grid selector functions; program compilers; scalar operators; universal selector", treatment = "T Theoretical or Mathematical", } @Article{Avis:1984:NPS, author = "David Avis", title = "Non-Partitionable Point Sets", journal = j-INFO-PROC-LETT, volume = "19", number = "3", pages = "125--129", day = "19", month = oct, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68P05 (68U05)", MRnumber = "86j:68014", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C1160 (Combinatorial mathematics)", corpsource = "School of Comput. Sci., McGill Univ., Montreal, Que., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "data processing; data structures; discrete mathematics; finite set; nonpartitionable point sets; set theory", treatment = "T Theoretical or Mathematical", } @Article{Eades:1984:AGS, author = "Peter Eades and Brendan McKay", title = "An algorithm for generating subsets of fixed size with a strong minimal change property", journal = j-INFO-PROC-LETT, volume = "19", number = "3", pages = "131--133", day = "19", month = oct, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68R05 (05A05)", MRnumber = "86d:68058", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C1160 (Combinatorial mathematics)", corpsource = "Dept. of Comput. Sci., Queensland Univ., St. Lucia, Qld., Australia", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm; combinatorial algorithm; computer programming; fixed size; generating subsets; Hamilton path; minimal change algorithm; set; set theory; strong minimal change property; subset generation", treatment = "T Theoretical or Mathematical", } @Article{Johnson:1984:FSM, author = "Dale Johnson and Barrett R. Bryant", title = "Formal Syntax Methods for Natural Language", journal = j-INFO-PROC-LETT, volume = "19", number = "3", pages = "135--143", day = "19", month = oct, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; 901; C4210 (Formal logic)", corpsource = "Dept. of Comput. and Inf. Sci., Alabama Univ., Birmingham, AL, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "context-sensitive syntax; English; formal methods; grammars; information science; natural language; natural languages; syntactic analysis; two-level grammar; Vienna Definition Language", treatment = "T Theoretical or Mathematical", } @Article{Kowaltowski:1984:ASM, author = "Tomasz Kowaltowski and Antonio Palma", title = "Another Solution of the Mutual Exclusion Problem", journal = j-INFO-PROC-LETT, volume = "19", number = "3", pages = "145--146", day = "19", month = oct, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Dept. de Ciencia da Computacao, Univ. Estadual de Campinas, SP, Brazil", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer systems, digital; mutual exclusion problem; programming theory; protocols; scheduler; search loop", treatment = "T Theoretical or Mathematical", } @Article{Gupta:1984:SSA, author = "R. G. Gupta and V. S. P. Srivastava", title = "On Synthesis of Scheduling Algorithms", journal = j-INFO-PROC-LETT, volume = "19", number = "3", pages = "147--150", day = "19", month = oct, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q20 (68N25 90B35)", MRnumber = "86i:68047", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; 913; C4240 (Programming and algorithm theory)", corpsource = "Sch. of Comput. and Syst. Sci., Jawaharlal Nehru Univ., New Delhi, India", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm theory; computer programming; program transformation techniques; scheduling; scheduling --- Computer Applications; scheduling algorithms; synthesis; synthesis of algorithms", treatment = "T Theoretical or Mathematical", } @Article{Biskup:1984:SVT, author = "Joachim Biskup", title = "Some Variants of the Take-Grant Protection Model", journal = j-INFO-PROC-LETT, volume = "19", number = "3", pages = "151--156", day = "19", month = oct, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68N25", MRnumber = "86i:68010", MRreviewer = "James W. Snively, Jr.", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C4290 (Other computer theory)", corpsource = "Informatik III, Dortmund Univ., West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "access control facilities; computation theory; computer systems; data processing; operating systems (computers); shared resources; take-grant protection model", treatment = "T Theoretical or Mathematical", } @Article{Maio:1984:EAC, author = "D. Maio and M. R. Scalas and P. Tiberio", title = "On Estimating Access Costs in Relational Databases", journal = j-INFO-PROC-LETT, volume = "19", number = "3", pages = "157--161", day = "19", month = oct, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C4250 (Database theory)", corpsource = "Bologna Univ., Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "access costs; clustering; database systems; database theory; query optimization; relational databases; tuples; uniform distribution", treatment = "T Theoretical or Mathematical", } @Article{Best:1984:EFC, author = "Eike Best", title = "Erratum: {``Fairness and conspiracies'' [Inform. Process. Lett. {\bf 18} (1984), no. 4, 215--220; MR 85h:68053]}", journal = j-INFO-PROC-LETT, volume = "19", number = "3", pages = "162--162", day = "19", month = oct, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q90 (68Q10)", MRnumber = "86i:68101", bibdate = "Sat Apr 11 12:24:20 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See \cite{Best:1984:FC}.", acknowledgement = ack-nhfb, fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", } @Article{Rytter:1984:LCF, author = "Wojciech Rytter", title = "On Linear Context-Free Languages and One-Way Multihead Automata", journal = j-INFO-PROC-LETT, volume = "19", number = "4", pages = "163--166", day = "12", month = nov, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q05 (68Q15 68Q45)", MRnumber = "86c:68019", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Warsaw Inst of Informatics, Warsaw, Pol", classification = "721; 723; C4210 (Formal logic); C4220 (Automata theory)", corpsource = "Inst. of Inf., Warsaw Univ., Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; computer programming --- Algorithms; Context Free Languages; context-free languages; finite automata; linear context-free languages; nondeterministic finite automata; one-way finite automata; one-way multihead automata; pushdown automata; time complexity", treatment = "T Theoretical or Mathematical", } @Article{Chrobak:1984:PTM, author = "M. Chrobak and B. S. Chlebus", title = "Probabilistic {Turing} Machines and Recursively Enumerable {Dedekind} Cuts", journal = j-INFO-PROC-LETT, volume = "19", number = "4", pages = "167--171", day = "12", month = nov, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "03D10 (03D25 68Q05 68Q75)", MRnumber = "86m:03069", MRreviewer = "George Tourlakis", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Polish Acad of Science, Inst of Mathematics, Warsaw, Pol", classification = "721; C4220 (Automata theory)", corpsource = "Inst. of Maths., Polish Acad. of Sci., Warsaw, Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm design; automata theory; Dedekind cut; languages; probabilistic methods; probabilistic Turing machine; probabilistic Turing machines; PTM; recursive real number; recursively enumerable Dedekind cuts; semantics; Turing machines", treatment = "T Theoretical or Mathematical", } @Article{Darondeau:1984:TFP, author = "Ph. Darondeau and L. Kott", title = "Towards a Formal Proof System for $\omega$-Rational Expressions", journal = j-INFO-PROC-LETT, volume = "19", number = "4", pages = "173--177", day = "12", month = nov, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q60 (03D05 68Q45)", MRnumber = "86i:68087", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "CNRS, Inst de Recherche en Informatique et Syst{\`e}mes Al{\'e}atoires, Rennes, Fr", affiliationaddress = "CNRS, Inst de Recherche en Informatique et Syst{\`e}mes Al{\'e}atoires, Rennes, Fr", classification = "721; C4210 (Formal logic)", corpsource = "CNRS, IRISA, Rennes I Univ., France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "abbreviated omega-languages; automata theory; equality; equivalence proof; finitary rational expressions; finite alphabet; Formal Languages; formal languages; formal proof system; machine behaviours; omega-languages; omega-rational expressions; omega-rational languages; Salomaa's theory", treatment = "T Theoretical or Mathematical", } @Article{Chrobak:1984:NBR, author = "Marek Chrobak", title = "A note on bounded-reversal multipushdown machines", journal = j-INFO-PROC-LETT, volume = "19", number = "4", pages = "179--180", day = "12", month = nov, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q05 (68Q45)", MRnumber = "86f:68013", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Polish Acad of Science, Inst of Mathematics, Warsaw, Pol", classification = "721; C4210 (Formal logic)", corpsource = "Inst. of Maths., Polish Acad. of Sci., Warsaw, Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; bounded-reversal multipushdown machines; formal languages; multicounter machines; multipushdown machines; regular languages", treatment = "T Theoretical or Mathematical", } @Article{Grune:1984:HPA, author = "Dick Grune", title = "How to produce all sentences from a two-level grammar", journal = j-INFO-PROC-LETT, volume = "19", number = "4", pages = "181--185", day = "12", month = nov, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q50", MRnumber = "86c:68049", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Free Univ, Dep of Mathematics \& Computer Science, Amsterdam, Neth", classification = "721; C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Maths. and Comput. Sci., Free Univ., Amsterdam, Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; automata theory; Chomsky Type 0 languages; formal languages; formalisms; Grammars; grammars; interpreters; languages; programming languages; programming theory; sentence generator; theory; two-level grammar; two-level grammars; type 0 languages; VW-grammars", review = "ACM CR 8507-0640", subject = "F.4.2 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems, Grammar types \\ D.3 Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory \\ F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Operations on languages \\ F.4.2 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems, Parsing", treatment = "T Theoretical or Mathematical", } @Article{Carpi:1984:CSW, author = "Arturo Carpi", title = "On the Centers of the Set of Weakly Square-Free Words on a Two Letter Alphabet", journal = j-INFO-PROC-LETT, volume = "19", number = "4", pages = "187--190", day = "12", month = nov, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q45 (20M05)", MRnumber = "86c:68044", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Istituto Nazionale di Alta Matematica F. Severi, Rome, Italy", classification = "721; C4210 (Formal logic)", corpsource = "Istituto Nazionale di Alta Matematica F. Severi, Roma, Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; decidability; Formal Languages; formal languages; power-free words; power-freeness; square-free words; two letter alphabet; weakly square-free words", treatment = "T Theoretical or Mathematical", } @Article{Kral:1984:SE, author = "J. Kral", title = "On software equations", journal = j-INFO-PROC-LETT, volume = "19", number = "4", pages = "191--196", day = "12", month = nov, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Ceske Vysoke Uconi Technike, Inst for Computation Techniques, Prague, Czech", affiliationaddress = "Ceske Vysoke Uconi Technike, Inst for Computation Techniques, Prague, Czech", classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Inst. for Comput. Tech., CVUT, Praha, Czechoslovakia", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer software; data bodies; empirical laws; measurement; programming; programming methodology; programming theory; software equations; software metrics; software products", review = "ACM CR 8506-0496", subject = "D.2 Software, SOFTWARE ENGINEERING, Metrics", treatment = "T Theoretical or Mathematical", } @Article{Kallay:1984:CIC, author = "Michael Kallay", title = "The complexity of incremental convex hull algorithms in {${\bf R}^d$}", journal = j-INFO-PROC-LETT, volume = "19", number = "4", pages = "197--197", day = "12", month = nov, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68U05 (52-04 68Q25)", MRnumber = "86c:68075", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Oklahoma, Norman, OK, USA", classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Eng. Div., Israel Aircraft Ind. Ltd., Ben Gurion Int. Airport, Tel Aviv, Israel", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm theory; Algorithms; complexity; computational complexity; computer programming; convex polytopes; dimensions; incremental convex hull algorithms; real space", treatment = "T Theoretical or Mathematical", } @Article{Leung:1984:ASU, author = "Clement H. C. Leung", title = "Approximate storage utilisation of {$B$}-trees: a simple derivation and generalisations", journal = j-INFO-PROC-LETT, volume = "19", number = "4", pages = "199--201", day = "12", month = nov, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ Coll, Dep of Computer Science, London, Engl", classification = "723; C4290 (Other computer theory); C6120 (File organisation)", corpsource = "Dept. of Comput. Sci., Univ. Coll., London, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "B*-trees; b-trees; B-trees; data processing; Data Structures; data structures; minimum fullness factor; storage management; storage utilisation; storage utilization; trees; trees (mathematics)", treatment = "T Theoretical or Mathematical", } @Article{Walsh:1984:HES, author = "T. R. Walsh", title = "How Evenly Should One Divide to Conquer Quickly?", journal = j-INFO-PROC-LETT, volume = "19", number = "4", pages = "203--208", day = "12", month = nov, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (68P10)", MRnumber = "86g:68078", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Western Ontario, Dep of Computer Science, London, Ont, Can", classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Univ. of Western Ontario, London, Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm theory; Algorithms; balanced division; balancing; comparisons; computer programming; divide-and-conquer; divide-and-conquer algorithms; iterative merge-sorting; merge sorting; subproblems; time complexity; time-cost", treatment = "T Theoretical or Mathematical", } @Article{Dowdy:1984:TCR, author = "Lawrence W. Dowdy and Derek L. Eager and Karen D. Gordon and Lawrence V. Saxton", title = "Throughput Concavity and Response Time Convexity", journal = j-INFO-PROC-LETT, volume = "19", number = "4", pages = "209--212", day = "12", month = nov, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68M20 (68N25)", MRnumber = "86i:68006", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Vanderbilt Univ, Computer Science Dep, Nashville, TN, USA", classification = "722; 723; C4290 (Other computer theory); C5470 (Performance evaluation and testing)", corpsource = "Dept. of Comput. Sci., Vanderbilt Univ., Nashville, TN, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer systems programming --- Multiprogramming; computer systems, digital; multiprogramming; multiprogramming level; Performance; performance evaluation; performance measures; product-form networks; response time; response time convexity; single-class closed queueing networks; system parameters; system's performance; throughput; throughput concavity", treatment = "T Theoretical or Mathematical", } @Article{Karhumaki:1984:IME, author = "Juhani Karhum{\"a}ki and Derick Wood", title = "Inverse Morphic Equivalence on Languages", journal = j-INFO-PROC-LETT, volume = "19", number = "5", pages = "213--218", day = "26", month = nov, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q45", MRnumber = "86g:68090", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Turku, Dep of Mathematics, Turku, Finl", classification = "721; C1160 (Combinatorial mathematics); C4210 (Formal logic)", corpsource = "Dept. of Math., Turku Univ., Finland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; equality set; equivalence classes; existential version; Formal Languages; formal languages; homomorphism; inverse morphic equivalence; languages; morphisms; universal version", treatment = "T Theoretical or Mathematical", } @Article{Frederickson:1984:LTA, author = "Greg N. Frederickson", title = "On Linear-Time Algorithms for Five-Coloring Planar Graphs", journal = j-INFO-PROC-LETT, volume = "19", number = "5", pages = "219--224", day = "26", month = nov, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q20 (05C15 68R10)", MRnumber = "86g:68065", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Purdue Univ, Dep of Computer Sciences, West Lafayette, IN, USA", classification = "723; 921; B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics)", corpsource = "Dept. of Comput. Sci., Purdue Univ., West Lafayette, IN, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer programming --- Algorithms; Euler's formula; five-coloring planar graphs; graph coloring; graph colouring; Graph Theory; linear-time algorithms; mathematical techniques; planar graphs", treatment = "T Theoretical or Mathematical", } @Article{Makinen:1984:DPC, author = "Erkki M{\"a}kinen", title = "On Derivation Preservation", journal = j-INFO-PROC-LETT, volume = "19", number = "5", pages = "225--228", day = "26", month = nov, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q50", MRnumber = "86f:68021", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Univ of Tampere, Dep of Mathematical Sciences \& Computer Science, Tampere, Finl", affiliationaddress = "Univ of Tampere, Dep of Mathematical Sciences \& Computer Science, Tampere, Finl", classification = "721; C4210 (Formal logic)", corpsource = "Dept. of Math. Sci. and Comput. Sci., Tampere Univ., Finland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; Context Free Grammars; context-free grammars; derivations; grammatical covering; homomorphism; nonterminal alphabets; parsing", treatment = "T Theoretical or Mathematical", } @Article{Wood:1984:CPR, author = "Derick Wood", title = "The contour problem for rectilinear polygons", journal = j-INFO-PROC-LETT, volume = "19", number = "5", pages = "229--236", day = "26", month = nov, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68U05", MRnumber = "86h:68165", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Waterloo, Data Structuring Group, Waterloo, Ont, Can", classification = "723; C4190 (Other numerical methods)", corpsource = "Dept. of Comput. Sci., Waterloo Univ., Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; computational geometry; computer programming; contour problem; disjoint set union; optimal algorithm; rectilinear convex; rectilinear polygons; scan-line paradigm; scanline; segment tree; space algorithm; sweep plane; time algorithm; visibility tree", treatment = "T Theoretical or Mathematical", } @Article{Bourret:1984:HES, author = "Paul Bourret", title = "How to Estimate the Sizes of Domains", journal = j-INFO-PROC-LETT, volume = "19", number = "5", pages = "237--243", day = "26", month = nov, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Office Natl d'Etudes et de Recherches Aerospatiales, Cent d'Etudes et de Recherches en Informatique, Toulouse, Fr", affiliationaddress = "Office Natl d'Etudes et de Recherches Aerospatiales, Cent d'Etudes et de Recherches en Informatique, Toulouse, Fr", classification = "723; 922; C1140Z (Other topics in statistics); C4250 (Database theory)", corpsource = "ONERA, Centre d'Etudes et de Recherches en Inf., Toulouse, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "confidence interval; data base; database systems; database theory; domains of attributes; estimation; relational databases; relational DBMS; statistical analysis; statistical method; statistical methods", treatment = "T Theoretical or Mathematical", } @Article{Tourlakis:1984:INT, author = "George Tourlakis", title = "An inductive number-theoretic characterization of {NP}", journal = j-INFO-PROC-LETT, volume = "19", number = "5", pages = "245--247", day = "26", month = nov, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "03D15 (68Q15)", MRnumber = "87a:03073", MRreviewer = "A. M. Dawes", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "York Univ, Dep of Computer Science \& Mathematics, Downsview, Ont, Can", classification = "723; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci. and Math., Atkinson Coll., York Univ., Downsview, Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "characterization; computational complexity; computational difficulty; computer metatheory; extended positive rudimentary relations; NP; number theory", treatment = "T Theoretical or Mathematical", } @Article{Vyskoc:1984:NBM, author = "Jozef Vysko{\v{c}}", title = "A note on {Boolean} matrix multiplication", journal = j-INFO-PROC-LETT, volume = "19", number = "5", pages = "249--251", day = "26", month = nov, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25", MRnumber = "86m:68068", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; 921; C4210 (Formal logic)", corpsource = "Trnavska, Zilina, Czechoslovakia", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; Boolean algebra; boolean matrix multiplication; computer programming; interval sparsity; interval tree; mathematical techniques --- Matrix Algebra", treatment = "T Theoretical or Mathematical", } @Article{McKenzie:1984:PBD, author = "Pierre McKenzie", title = "Permutations of Bounded Degree Generate Groups of Polynomial Diameter", journal = j-INFO-PROC-LETT, volume = "19", number = "5", pages = "253--254", day = "26", month = nov, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (20B99 68Q40 68R05)", MRnumber = "86h:68077", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Toronto, Dep of Computer Science, Toronto, Ont, Can", classification = "921; C1110 (Algebra); C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Toronto Univ., Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "bounded degree generate groups; Combinatorial Mathematics; combinatorial mathematics; combinatorial problems; computational complexity; group theory; mathematical techniques; permutation group; polynomial diameter", treatment = "T Theoretical or Mathematical", } @Article{Gursel:1984:AOS, author = "Goker Gursel and Peter Scheuermann", title = "Asserting the optimality of serial {SJRPs} in processing simple queries in chain networks", journal = j-INFO-PROC-LETT, volume = "19", number = "5", pages = "255--260", day = "26", month = nov, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "San Diego State Univ, Dep of Mathematical Sciences, San Diego, CA, USA", classification = "723; C4250 (Database theory)", corpsource = "Dept. of Math. Sci., San Diego State Univ., CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; chain networks; communication links; data transmission; database systems; database theory; Distributed; distributed database systems; local data processing; performance; processing simple queries; query processing; semi-joins; serial SJRPs", review = "ACM CR 8509-0855", subject = "H.2.4 Information Systems, DATABASE MANAGEMENT, Systems, Distributed systems \\ H.2.4 Information Systems, DATABASE MANAGEMENT, Systems, Query processing \\ C.2.1 Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Architecture and Design, Network topology", treatment = "T Theoretical or Mathematical", } @Article{Duboc:1985:SPC, author = "Christine Duboc", title = "Some Properties of Commutation in Free Partially Commutative Monoids", journal = j-INFO-PROC-LETT, volume = "20", number = "1", pages = "1--4", day = "2", month = jan, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "20M05 (68Q99)", MRnumber = "86h:20092", MRreviewer = "S. M. Goberstein", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ de Rouen, Lab d'Informatique, Rouen, Fr", classification = "721; 723; C4210 (Formal logic)", corpsource = "Lab. d'Info., Rouen Univ., Mont-Saint-Aignan, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; commutation; computer metatheory; Formal Languages; formal languages; free partially commutative monoids; shuffle product", treatment = "T Theoretical or Mathematical", } @Article{Book:1985:CRE, author = "Ronald V. Book and Friedrich Otto", title = "Cancellation Rules and Extended Word Problems", journal = j-INFO-PROC-LETT, volume = "20", number = "1", pages = "5--11", day = "2", month = jan, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q45 (03D03)", MRnumber = "87d:68054", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Univ of California, Santa Barbara, Dep of Mathematics, Santa Barbara, CA, USA", affiliationaddress = "Univ of California, Santa Barbara, Dep of Mathematics, Santa Barbara, CA, USA", classification = "721; B6120B (Codes); B6150 (Communication system theory)", corpsource = "Dept. of Maths., California Univ., Santa Barbara, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; cancellation rules; Church--Rosser property; church-rosser property; computer metatheory; congruences; cryptography; extended word problems; Formal Languages; formal model; name-stamp protocols; protocols; public key encryption; rewriting process; secure network communication; Thue systems", treatment = "T Theoretical or Mathematical", } @Article{Mirzaian:1985:SMS, author = "A. Mirzaian and E. Arjomandi", title = "Selection in $x + y$ and Matrices with Sorted Rows and Columns", journal = j-INFO-PROC-LETT, volume = "20", number = "1", pages = "13--17", day = "2", month = jan, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68P10", MRnumber = "86i:68017", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "York Univ, Dep of Computer Science, Downsview, Ont, Can", classification = "723; C4140 (Linear algebra); C4240 (Programming and algorithm theory); C6130 (Data handling techniques)", corpsource = "Dept. of Comput. Sci., York Univ., Downsview, Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm theory; Algorithms; Cartesian sum; columns; computer programming; computer systems programming --- Sorting; constant time factor; divide-and-conquer technique; matrices; matrix algebra; order related problems; selection problem; sorted rows; sorting; statistics; VLSI", treatment = "T Theoretical or Mathematical", } @Article{Makinen:1985:NUR, author = "Erkki M{\"a}kinen", title = "A note on undercover relation", journal = j-INFO-PROC-LETT, volume = "20", number = "1", pages = "19--21", day = "2", month = jan, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q50 (03D05)", MRnumber = "86h:68101", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Univ of Tampere, Dep of Mathematical Sciences \& Computer Science, Tampere, Finl", affiliationaddress = "Univ of Tampere, Dep of Mathematical Sciences \& Computer Science, Tampere, Finl", classification = "721; C4210 (Formal logic)", corpsource = "Dept. of Math. Sci. and Comput. Sci., Tampere Univ., Finland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; Context Free Grammars; context-free grammars; decidability; decidability result; grammatical covering; homomorphism equivalence; parsing; undercover relation", treatment = "T Theoretical or Mathematical", } @Article{McKeown:1985:SPM, author = "G. P. McKeown", title = "A special purpose {MIMD} parallel processor", journal = j-INFO-PROC-LETT, volume = "20", number = "1", pages = "23--27", day = "2", month = jan, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Univ of East Anglia, Sch of Computing Studies \& Accountancy, Norwich, Engl", affiliationaddress = "Univ of East Anglia, Sch of Computing Studies \& Accountancy, Norwich, Engl", classification = "722; 723; C5440 (Multiprocessing systems)", corpsource = "Sch. of Comput. Studies and Accountancy, East Anglia Univ., Norwich, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "asynchronous iterative scheme; band matrix; chordal ring network; computer systems, digital; local communication; MIMD parallel computers; Parallel Processing; parallel processing; special purpose MIMD parallel processor; topology", treatment = "T Theoretical or Mathematical", } @Article{Rao:1985:ALC, author = "S. Upendra Rao and A. K. Majumdar", title = "An algorithm for local compaction of horizontal microprograms", journal = j-INFO-PROC-LETT, volume = "20", number = "1", pages = "29--33", day = "2", month = jan, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Metal Box India Ltd, Systems Dep, Kharagpur, India", classification = "722; 723; C6110 (Systems analysis and programming); C6150C (Compilers, interpreters and other processors)", corpsource = "Metal Box India Ltd., Kharagpur, India", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "compilers; computer architecture; computer programming --- Algorithms; computer systems, digital --- Parallel Processing; data dependency; data reduction; heuristic algorithms; horizontal microprograms; local compaction; local microcode compaction; micro-operations; microprogramming; Microprogramming; parallel processing; parallelism; program compilers; resource conflict; word minimisation", treatment = "P Practical", } @Article{Passy:1985:PDC, author = "Solomon Passy and Tinko Tinchev", title = "{PDL} with data constants", journal = j-INFO-PROC-LETT, volume = "20", number = "1", pages = "35--41", day = "2", month = jan, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q55 (03B70)", MRnumber = "86i:68079", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Sofia Univ, Sector of Mathematical Logic, Sofia, Bulg", classification = "723; C4210 (Formal logic)", corpsource = "Maths. Fac., Sofia Univ., Bulgaria", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer metatheory --- Programming Theory; computer programming; CPDL; data constants; data identity; formal logic; Kripke complete; propositional dynamic logic; Theory", treatment = "T Theoretical or Mathematical", } @Article{Meira:1985:LAS, author = "Silvio Lemos Meira", title = "A linear applicative solution for the set union problem", journal = j-INFO-PROC-LETT, volume = "20", number = "1", pages = "43--45", day = "2", month = jan, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Kent at Canterbury, Computing Lab, Canterbury, Engl", classification = "723; C1160 (Combinatorial mathematics); C4210 (Formal logic)", corpsource = "Comput. Lab., Kent Univ., Canterbury, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "adjectivisation; algorithm complexity; Algorithms; applicative languages; computer programming; computer programming languages --- Theory; formal languages; imperative set union problem; linear applicative solution; set theory; set union problem", treatment = "T Theoretical or Mathematical", } @Article{Bounas:1985:DDS, author = "Adam C. Bounas", title = "Direct determination of a ``seed'' binary matrix", journal = j-INFO-PROC-LETT, volume = "20", number = "1", pages = "47--50", day = "2", month = jan, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "94A60 (94A15)", MRnumber = "86g:94038", MRreviewer = "S. Guia{\c{s}}u", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Greek Atomic Energy Commission, Computer Science Dep, Attiki, Greece", classification = "723; 922; B6120B (Codes); C6130 (Data handling techniques)", corpsource = "Dept. of Comput. Sci., Min. of Res. and Technol., Greek Atomic Energy Comm., Attiki, Greece", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "binary matrix; cryptography; data transformation; generalized feedback shift register pseudorandom number generator; keys; mathematical statistics --- Random Number Generation; pseudorandom number generators; random number generation; seed matrices; seed matrix; stream enciphering", treatment = "T Theoretical or Mathematical", } @Article{Jajodia:1985:ERN, author = "Sushil Jajodia", title = "On Equivalence of Relational and Network Database Models", journal = j-INFO-PROC-LETT, volume = "20", number = "1", pages = "51--54", day = "2", month = jan, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68P15", MRnumber = "86h:68027", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Missouri-Columbia, Dep of Computer Science, Columbia, MO, USA", classification = "723; C4250 (Database theory); C6160B (Distributed databases); C6160D (Relational databases)", corpsource = "Dept. of Comput. Sci., Missouri Univ., Columbia, MO, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "database systems; database theory; distributed processing; equivalence; functional dependencies; loop-free Bachman diagrams; multivalued dependencies; network database models; network databases; relational databases; relational structures", treatment = "T Theoretical or Mathematical", } @Article{Bilardi:1985:VOA, author = "G. Bilardi and F. P. Preparata", title = "The {VLSI} optimality of the {AKS} sorting network", journal = j-INFO-PROC-LETT, volume = "20", number = "2", pages = "55--59", day = "15", month = feb, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Univ of Illinois at Urbana-Champaign, Coordinated Science Lab, Urbana, IL, USA", affiliationaddress = "Univ of Illinois at Urbana-Champaign, Coordinated Science Lab, Urbana, IL, USA", classification = "723; B1130B (Computer-aided circuit analysis and design); B2570 (Semiconductor integrated circuits); C7410D (Electronic engineering computing)", corpsource = "Coordinated Sci. Lab., Illinois Univ., Urbana, IL, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "aks sorting network; AKS sorting network; area-time trade-off; circuit CAD; computer programming --- Algorithms; computer systems programming; computer systems, digital --- Parallel Processing; computing environment; parallel processing; Sorting; synchronous VLSI model of computation; VLSI; VLSI optimality", treatment = "P Practical", } @Article{Plaisted:1985:USE, author = "David A. Plaisted", title = "The undecidability of self-embedding for term rewriting systems", journal = j-INFO-PROC-LETT, volume = "20", number = "2", pages = "61--64", day = "15", month = feb, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q50 (03D35 68T15)", MRnumber = "86f:68022", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Univ of Illinois at Urbana-Champaign, Dep of Computer Science, Urbana, IL, USA", affiliationaddress = "Univ of Illinois at Urbana-Champaign, Dep of Computer Science, Urbana, IL, USA", classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer metatheory; computer programming languages --- Theory; decidability; programming theory; self-embedding; self-embedding property; term rewriting systems; theorem proving; undecidability; uniform termination property", treatment = "T Theoretical or Mathematical", } @Article{VandeSnepscheut:1985:EEQ, author = "Jan L. A. {Van de Snepscheut}", title = "Evaluating Expressions with a Queue", journal = j-INFO-PROC-LETT, volume = "20", number = "2", pages = "65--66", day = "15", month = feb, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "California Inst of Technology, Dep of Computer Science, Pasadena, CA, USA", classification = "723; C4240 (Programming and algorithm theory); C6150C (Compilers, interpreters and other processors)", corpsource = "Dept. of Comput. Sci., California Inst. of Technol., Pasadena, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "caudafix expression; code generation; compilation; computer metatheory --- Programming Theory; computer programming; expression evaluation; literals; mechanical evaluation; program compilers; programming theory; queue; queueing theory; Theory", treatment = "T Theoretical or Mathematical", } @Article{McLean:1985:CBS, author = "John McLean", title = "A comment on the `basic security theorem' of {Bell} and {LaPadula}", journal = j-INFO-PROC-LETT, volume = "20", number = "2", pages = "67--70", day = "15", month = feb, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "US Naval Research Lab, Computer Science \& Systems Branch, Washington, DC, USA", affiliationaddress = "US Naval Research Lab, Computer Science \& Systems Branch, Washington, DC, USA", classification = "404; 722; 723; C4240 (Programming and algorithm theory); C6130 (Data handling techniques)", corpsource = "Naval Res. Lab., Washington, DC, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "basic security theorem; computer systems, digital --- Military Purposes; data processing; programming theory; prototype military computer systems; security model; security of data; Security of Data", treatment = "T Theoretical or Mathematical", } @Article{Noshita:1985:TTC, author = "Kohei Noshita", title = "Translation of {Turner} combinators in ${O(n \log n)}$ space", journal = j-INFO-PROC-LETT, volume = "20", number = "2", pages = "71--74", day = "15", month = feb, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (03B40)", MRnumber = "86e:68051", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Electro-Communications, Dep of Computer Science, Chofu, Jpn", classification = "723; C4220 (Automata theory)", corpsource = "Dept. of Comput. Sci., Univ. of Electro-Commun., Tokyo, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; automata; automata theory; complexity; computer metatheory; computer programming; functional programming; lambda calculus; lambda expressions; performance; reduction machine; theory; Theory; turner combinators; Turner combinators; verification", review = "ACM CR 8510-0919", subject = "D.1 Software, PROGRAMMING TECHNIQUES, Applicative (Functional) Programming \\ F.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems \\ F.4.1 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Lambda calculus and related systems", treatment = "T Theoretical or Mathematical", } @Article{Widmayer:1985:OAM, author = "P. Widmayer and C. K. Wong", title = "An optimal algorithm for the maximum alignment of terminals", journal = j-INFO-PROC-LETT, volume = "20", number = "2", pages = "75--82", day = "15", month = feb, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "IBM, Thomas J. Watson Research Cent, Yorktown Heights, NY, USA", classification = "714; 723; B1130B (Computer-aided circuit analysis and design); C4230 (Switching theory)", corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "alignment of terminals; Computer Aided Design; computer programming --- Algorithms; graph theory; integrated circuits, VLSI; maximum alignment; minimisation of switching nets; optimal algorithm; terminals; VLSI wiring; wires", treatment = "T Theoretical or Mathematical", } @Article{Thatte:1985:CBT, author = "Satish R. Thatte", title = "On the Correspondence Between Two Classes of Reduction Systems", journal = j-INFO-PROC-LETT, volume = "20", number = "2", pages = "83--85", day = "15", month = feb, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q65 (68Q55)", MRnumber = "87i:68053", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Univ of Michigan, Dep of Computer \& Communication Sciences, Ann Arbor, MI, USA", affiliationaddress = "Univ of Michigan, Dep of Computer \& Communication Sciences, Ann Arbor, MI, USA", classification = "723; C4210 (Formal logic)", corpsource = "Dept. of Comput. and Commun. Sci., Michigan Univ., Ann Arbor, MI, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "C/sub I/ system; C/sub II/ system; computer metatheory; computer programming languages; constructors; grammars; HOPE; reduction systems; semantic models; semantics; sequential evaluation strategies; term rewriting; Theory", treatment = "P Practical", } @Article{Harel:1985:MLV, author = "David Harel and David Peleg", title = "More on Looping Vs. Repeating in Dynamic Logic", journal = j-INFO-PROC-LETT, volume = "20", number = "2", pages = "87--90", day = "15", month = feb, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q55 (03B70 03D35)", MRnumber = "86k:68065", MRreviewer = "G. Mirkowska", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Weizmann Inst of Science, Dep of Applied Mathematics, Rehovot, Isr", classification = "723; C4210 (Formal logic)", corpsource = "Dept. of Appl. Math., Weizmann Inst. of Sci., Rehovot, Israel", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer metatheory --- Programming Theory; computer programming; dynamic logic; expressiveness; formal logic; looping; program verification; relative power; repeating; Theory; validity; verification", treatment = "T Theoretical or Mathematical", } @Article{Auzins:1985:SEE, author = "A. J. Auzins and E. B. Kinber", title = "On Separation of the Emptiness and Equivalence Problems for Program Schemes", journal = j-INFO-PROC-LETT, volume = "20", number = "2", pages = "91--93", day = "15", month = feb, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q05 (03D35)", MRnumber = "86k:68013", MRreviewer = "A. Ya. Dikovski{\u{\i}}", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Latvian State Univ, Computing Cent, Riga, USSR", classification = "723; C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "Comput. Center, Latvian State Univ., Riga, Latvian SSR, USSR", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer metatheory --- Programming Theory; computer programming; decidability; deterministic automata; emptiness; emptiness problem; equivalence problem; equivalence problems; input tape; one-way deterministic pushdown automata; program schemes; programming theory; Theory", treatment = "T Theoretical or Mathematical", } @Article{Beauquier:1985:CAI, author = "D. Beauquier and D. Perrin", title = "Codeterministic Automata on Infinite Words", journal = j-INFO-PROC-LETT, volume = "20", number = "2", pages = "95--98", day = "15", month = feb, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q05 (03D05 68Q45)", MRnumber = "86i:68028", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ Paris 7, Lab d'Informatique Theorique et Programmation, Paris, Fr", classification = "721; C4220 (Automata theory)", corpsource = "Paris 7 Univ., France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; codeterministic automata; deterministic automata; finite automata; finite codeterministic automaton; infinite words; reverse deterministic automaton", treatment = "T Theoretical or Mathematical", } @Article{Ukkonen:1985:UBS, author = "Esko Ukkonen", title = "Upper bounds on the size of {${\rm LR}(k)$} parsers", journal = j-INFO-PROC-LETT, volume = "20", number = "2", pages = "99--103", day = "15", month = feb, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q50", MRnumber = "86j:68076", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Helsinki, Dep of Computer Science, Helsinki, Finl", classification = "721; C4210 (Formal logic)", corpsource = "Dept. of Comput. Sci., Helsinki Univ., Finland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; compilers; context-free grammars; grammar; Grammars; LR(k) parsers; trivial upper bound; upper bounds", treatment = "T Theoretical or Mathematical", } @Article{Main:1985:ISC, author = "Michael G. Main", title = "An infinite square-free {co-CFL}", journal = j-INFO-PROC-LETT, volume = "20", number = "2", pages = "105--107", day = "15", month = feb, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Colorado at Boulder, Dep of Computer Science, Boulder, CO, USA", classification = "721; C4210 (Formal logic)", corpsource = "Dept. of Comput. Sci., Colorado Univ., Boulder, CO, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; Context Free Languages; context-free languages; infinite complement; infinite square-free co-CFL; pumping lemmas; repetitions; square-containing strings", treatment = "T Theoretical or Mathematical", } @Article{Kak:1985:HDT, author = "Subhash C. Kak", title = "How to Detect Tampering of Data", journal = j-INFO-PROC-LETT, volume = "20", number = "2", pages = "109--110", day = "15", month = feb, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Louisiana State Univ, Baton Rouge, Dep of Electrical \& Computer Engineering, Baton Rouge, LA, USA", affiliationaddress = "Louisiana State Univ, Baton Rouge, Dep of Electrical \& Computer Engineering, Baton Rouge, LA, USA", classification = "723; C6130 (Data handling techniques)", corpsource = "Dept. of Electr. and Comput. Eng., Louisiana State Univ., Baton Rouge, LA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "codes, symbolic --- Error Detection; data processing; nested coding; Security of Data; security of data; tampering; tampering of data", treatment = "P Practical", } @Article{Njau:1985:DDC, author = "Ernest C. Njau", title = "Details of Distortions in the Computed {Fourier} Transforms of Signals. {Part I}. {Short} Periodic Signals", journal = j-INFO-PROC-LETT, volume = "20", number = "3", pages = "111--113", day = "8", month = apr, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "94A11", MRnumber = "86j:94014", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Int Cent for Theoretical Physics, Trieste, Italy", classification = "723; 731; 921; B0230 (Integral transforms); B6140 (Signal processing and detection); C1130 (Integral transforms); C1260 (Information theory)", corpsource = "Int. Centre for Theor. Phys., Trieste, Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computed Fourier transforms; Digital Techniques; Fourier transforms; frequency-broadening; mathematical transformations --- Fourier Transforms; peak precision; short periodic signals; signal processing; spectral analysis", treatment = "T Theoretical or Mathematical", } @Article{Sontag:1985:RAP, author = "Eduardo D. Sontag", title = "Real Addition and the Polynomial Hierarchy", journal = j-INFO-PROC-LETT, volume = "20", number = "3", pages = "115--120", day = "8", month = apr, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "03D15 (03B25 68Q15)", MRnumber = "87b:03082", MRreviewer = "Andreas Brandst{\"a}dt", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Rutgers Univ, Dep of Mathematics, New Brunswick, NJ, USA", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Math., Rutgers Univ., New Brunswick, NJ, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "addition; computational complexity; computer metatheory; deterministic line complexity; kth alternation level; mathematical techniques; nonempty polyhedron; number theory; polyhedral geometry; polynomial hierarchy; Polynomials; polynomials; prenex form; quantifier elimination; real addition; real numbers", treatment = "T Theoretical or Mathematical", } @Article{Chan:1985:NRD, author = "Mee Yee Chan", title = "A note on redundant {Disk Modulo} allocation", journal = j-INFO-PROC-LETT, volume = "20", number = "3", pages = "121--123", day = "8", month = apr, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Hong Kong, Cent of Computer Studies \& Applications, Hong Kong", classification = "723; C6120 (File organisation)", corpsource = "Centre of Comput. Studies and Applications, Hong Kong Univ., Hong Kong", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "binary buckets; buckets; complete file replication; data processing; database systems; file organisation; File Organization; magnetic disc storage; multidisk file design; multidisk file problem; multiple disks; optimal performance; partial match file design; partial match query; redundancy; redundant buckets; redundant Disk Modulo file allocations; worst case result", treatment = "T Theoretical or Mathematical", } @Article{Martin:1985:PAC, author = "Alain J. Martin", title = "The probe: an addition to communication primitives", journal = j-INFO-PROC-LETT, volume = "20", number = "3", pages = "125--130", day = "8", month = apr, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q10 (68N20)", MRnumber = "87d:68026a", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See also erratum \cite{Martin:1985:EPA}.", acknowledgement = ack-nhfb, affiliationaddress = "California Inst of Technology, Computer Science Dep, Pasadena, CA, USA", classification = "722; 723; C6140D (High level languages); C6150J (Operating systems)", corpsource = "Dept. of Comput. Sci., California Inst. of Technol., Pasadena, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "bounded buffers; communication primitives; computer programming languages; computer systems, digital --- Distributed; CSP; distributed computation; distributed processing; fairness; guarded commands; multiprocessing programs; operating systems (computers); probe; programming language kernel; programming languages; semantics; semaphores; stack; timer constructs", treatment = "T Theoretical or Mathematical", } @Article{Lodi:1985:SSH, author = "E. Lodi and F. Luccio", title = "Split Sequence Hash Search", journal = j-INFO-PROC-LETT, volume = "20", number = "3", pages = "131--136", day = "8", month = apr, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", abstract = "In all hash methods, the search for a key K starts with the comparison between K and the key L stored in the table position corresponding to the hash address of K. If K does not equal L, the search proceeds through a sequence of cells. It is proposed here to split this sequence in two parts, to be traced for K greater than L, or K less than L. The advantage of sequence splitting is studied for the hash techniques of chaining, and open addressing. The average numbers of probes for successful and unsuccessful searches are strongly reduced over standard methods, in particular for chaining and linear probing, at the cost of a very modest algorithm complication.", acknowledgement = ack-nhfb, affiliationaddress = "Univ di Pisa, Dipartimento di Informatica, Pisa, Italy", classification = "723; C6120 (File organisation); C6130 (Data handling techniques)", corpsource = "Dipartimento di Inf., Pisa Univ., Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "chaining; collision resolution; computer programming; data processing --- Data Structures; data structures; file organisation; hash address; hash methods; hashing; linear probing; open addressing; searching; split sequence hash search; table lookup; table position; table searching", treatment = "T Theoretical or Mathematical", } @Article{Cole:1985:PMA, author = "Richard Cole and Chee K. Yap", title = "A parallel median algorithm", journal = j-INFO-PROC-LETT, volume = "20", number = "3", pages = "137--139", day = "8", month = apr, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68P10", MRnumber = "86k:68004", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "New York Univ, Courant Inst of Mathematical Sciences, New York, NY, USA", classification = "722; 723; C4240 (Programming and algorithm theory)", corpsource = "Courant Inst. of Math. Sci., New York Univ., NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm theory; Algorithms; comparison model; computer programming; computer systems, digital --- Parallel Processing; deterministic algorithm; parallel algorithm; parallel median algorithm; parallel processing; statistics", treatment = "T Theoretical or Mathematical", } @Article{Makinen:1985:UPC, author = "Erkki M{\"a}kinen", title = "An undecidable problem for context-free grammars", journal = j-INFO-PROC-LETT, volume = "20", number = "3", pages = "141--142", day = "8", month = apr, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q45", MRnumber = "87a:68098", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Univ of Tampere, Dep of Mathematical Sciences \& Computer Science, Tampere, Finl", affiliationaddress = "Univ of Tampere, Dep of Mathematical Sciences \& Computer Science, Tampere, Finl", classification = "721; C4210 (Formal logic)", corpsource = "Dept. of Math. Sci. and Comput. Sci., Tampere Univ., Finland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "ambiguity; automata theory; Context Free Grammars; context-free grammars; context-free languages; decidability; felt Szilard languages; GNF; undecidable problem", treatment = "T Theoretical or Mathematical", } @Article{Tsin:1985:OPP, author = "Yung Hyang Tsin", title = "An optimal parallel processor bound in strong orientation of an undirected graph", journal = j-INFO-PROC-LETT, volume = "20", number = "3", pages = "143--146", day = "8", month = apr, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Memorial Univ of Newfoundland, Dep of Computer Science, St. John's, Newfoundl, Can", affiliationaddress = "Memorial Univ of Newfoundland, Dep of Computer Science, St. John's, Newfoundl, Can", classification = "722; 723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Memorial Univ. of Newfoundland, St. John's, Nfld., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm theory; analysis of algorithms; assigning directions; computer programming --- Algorithms; computer systems, digital --- Parallel Processing; dense graphs; Graph Theory; graph theory; mathematical techniques; optimal parallel processor; parallel graph algorithm; parallel processing; parallel processor; PRAM; SIMD shared memory model; spanning trees; strong orientation; trees (mathematics); undirected graph; vertex set", treatment = "T Theoretical or Mathematical", } @Article{Awerbuch:1985:NDD, author = "Baruch Awerbuch", title = "A new distributed depth-first-search algorithm", journal = j-INFO-PROC-LETT, volume = "20", number = "3", pages = "147--150", day = "8", month = apr, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "IBM, Israel Scientific Cent, Haifa, Isr", classification = "722; 723; C4230 (Switching theory); C4240 (Programming and algorithm theory); C5690 (Other data communication equipment and techniques)", corpsource = "IBM-Israel Sci. Center, Haifa, Israel", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm theory; Algorithms; asynchronous communication network; communication complexity; computer programming; computer systems, digital --- Distributed; distributed depth-first-search algorithm; distributed processing; graph theory; time complexities; undirected communication graph", treatment = "T Theoretical or Mathematical", } @Article{Shallit:1985:NTF, author = "Jeffrey Shallit and Adi Shamir", title = "Number-Theoretic Functions Which are Equivalent to Number of Divisors", journal = j-INFO-PROC-LETT, volume = "20", number = "3", pages = "151--153", day = "8", month = apr, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "11Y16 (68Q25)", MRnumber = "86k:11076", MRreviewer = "Hale F. Trotter", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Chicago, Dep of Computer Science, Chicago, IL, USA", classification = "723; 921; B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics); C4290 (Other computer theory)", corpsource = "Dept. of Comput. Sci., Chicago Univ., IL, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer metatheory; mathematical techniques; Mobius function; Moebius function; Number Theory; number theory; number-theoretic functions; oracle; positive integral divisors; prime factorization", treatment = "T Theoretical or Mathematical", } @Article{Volger:1985:SRA, author = "Hugo Volger", title = "Some Results on Addition\slash Subtraction Chains", journal = j-INFO-PROC-LETT, volume = "20", number = "3", pages = "155--160", day = "8", month = apr, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "11Y55 (68Q40)", MRnumber = "87c:11124", MRreviewer = "Kevin S. McCurley", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of T{\"u}bingen, Mathematical Inst, T{\"u}bingen, West Ger", classification = "921; C1160 (Combinatorial mathematics); C5230 (Digital arithmetic methods)", corpsource = "Math. Inst., T{\"u}bingen Univ., West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "addition/subtraction chains; digital arithmetic; mathematical techniques; number theory; upper bounds", treatment = "T Theoretical or Mathematical", } @Article{Beynon:1985:CBF, author = "W. M. Beynon and C. S. Iliopoulos", title = "Computing a Basis for a Finite {Abelian} $p$-Group", journal = j-INFO-PROC-LETT, volume = "20", number = "3", pages = "161--163", day = "8", month = apr, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q40 (20K01)", MRnumber = "87a:68086", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Warwick, Dep of Computer Science, Coventry, Engl", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Warwick Univ., Coventry, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithmic group theory; Algorithms; basis; computational complexity; computer programming; finite Abelian p-group; finite abelian p-group; group theory; mathematical techniques", treatment = "T Theoretical or Mathematical", } @Article{Welzl:1985:CVG, author = "Emo Welzl", title = "Constructing the Visibility Graph for $n$-Line Segments in ${O}(n^2)$ Time", journal = j-INFO-PROC-LETT, volume = "20", number = "4", pages = "167--171", day = "10", month = may, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68U05", MRnumber = "86m:68135", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Leiden State Univ, Inst of Applied Mathematics \& Computer Science, Leiden, Neth", affiliationaddress = "Leiden State Univ, Inst of Applied Mathematics \& Computer Science, Leiden, Neth", classification = "723; 921; C1160 (Combinatorial mathematics); C4190 (Other numerical methods)", corpsource = "Inst. for Inf. Proc., Tech. Univ. of Graz, Austria", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computational geometry; computer programming --- Algorithms; Graph Theory; graph theory; line segments; mathematical techniques; n-line segments; nontransparent obstacles; O(n/sup 2/) time; shortest path; undirected graph; visibility graph", pubcountry = "Netherlands A01", treatment = "T Theoretical or Mathematical", } @Article{Joseph:1985:PRC, author = "Mathai Joseph", title = "On a Problem in Real-Time Computing", journal = j-INFO-PROC-LETT, volume = "20", number = "4", pages = "173--177", day = "10", month = may, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Tata Inst of Fundamental Research, Computer Science Group, Bombay, India", classification = "722; 723; C1140C (Queueing theory); C5470 (Performance evaluation and testing)", corpsource = "Comput. Sci. Group., Tata Inst. of Fundamental Res., Bombay, India", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "buffered computation; computer systems, digital; peak processing load; Performance; performance evaluation; processor sharing; queueing theory; real-time computing; real-time systems; response time; response times", pubcountry = "Netherlands A02", treatment = "T Theoretical or Mathematical", } @Article{Santoro:1985:IBS, author = "Nicola Santoro and Jeffrey B. Sidney", title = "Interpolation-Binary Search", journal = j-INFO-PROC-LETT, volume = "20", number = "4", pages = "179--181", day = "10", month = may, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68P10", MRnumber = "86m:68022", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Carleton Univ, Sch of Computer Science, Ottawa, Ont, Can", classification = "723; C4130 (Interpolation and function approximation); C4240 (Programming and algorithm theory)", corpsource = "Sch. of Comput. Sci., Carleton Univ., Ottawa, Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; computational complexity; computer programming; interpolation; interpolation-binary system; multiple complexity objective; O(log log n) time; O(log n) time; ordered array; ordered arrays; searching", pubcountry = "Netherlands A03", treatment = "T Theoretical or Mathematical", } @Article{Rangarajan:1985:FDE, author = "K. Rangarajan and S. Arun-Kumar", title = "Fair Derivations in {E0L} Systems", journal = j-INFO-PROC-LETT, volume = "20", number = "4", pages = "183--188", day = "10", month = may, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q45 (68Q50)", MRnumber = "86k:68055", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Madras Christian Coll, Dep of Mathematics, Madras, India", classification = "721; C4210 (Formal logic)", corpsource = "Dept. of Math., Madras Christian Coll., India", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; context-free derivations; context-free languages; E0L systems; fair derivations; fairness; Formal Languages; formal languages; l-system; L-systems; synchronized E0L systems; termination; terminations", pubcountry = "Netherlands A04", treatment = "T Theoretical or Mathematical", } @Article{Morgan:1985:GLT, author = "Carroll Morgan", title = "Global and Logical Time in Distributed Algorithms", journal = j-INFO-PROC-LETT, volume = "20", number = "4", pages = "189--194", day = "10", month = may, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Oxford, Programming Research Group, Oxford, Engl", classification = "722; 723; C4240 (Programming and algorithm theory)", corpsource = "Programming Res. Group, Oxford Univ., UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm theory; Algorithms; computer programming; computer systems, digital; distributed algorithms; distributed auction system Enchere; distributed computation; distributed processing; distributed snapshot algorithm; fair agreement algorithm; global time; logical time; saved checkpoint", pubcountry = "Netherlands A05", treatment = "T Theoretical or Mathematical", } @Article{Wise:1985:RMQ, author = "David S. Wise", title = "Representing Matrices as Quadtrees for Parallel Processors", journal = j-INFO-PROC-LETT, volume = "20", number = "4", pages = "195--199", day = "10", month = may, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "65W05 (65Fxx)", MRnumber = "86j:65204", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Indiana Univ, Dep of Computer Science, Bloomington, IN, USA", classification = "722; 723; C4140 (Linear algebra); C6120 (File organisation)", corpsource = "Dept. of Comput. Sci., Indiana Univ., Bloomington, IN, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm selection; computer systems, digital --- Parallel Processing; data processing; Data Structures; data structures; homogeneous tree data structure; matrix algebra; multiprocessing; numerical methods; parallel processing; parallel processors; parallel- processing architectures; quadtrees; sparse matrices; sparse matrix representation; trees (mathematics)", pubcountry = "Netherlands A06", treatment = "T Theoretical or Mathematical", } @Article{Keil:1985:FHC, author = "J. Mark Keil", title = "Finding {Hamiltonian} Circuits in Interval Graphs", journal = j-INFO-PROC-LETT, volume = "20", number = "4", pages = "201--206", day = "10", month = may, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (05C45 68R10)", MRnumber = "87a:68082", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Saskatchewan, Dep of Computational Science, Saskatoon, Sask, Can", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Saskatchewan Univ., Saskatoon, Sask., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "circuit theory; computational complexity; computer programming --- Algorithms; Graph Theory; graph theory; Hamiltonian circuits; intersection graph; interval graphs; linear time algorithm; mathematical techniques; NP-complete", pubcountry = "Netherlands A07", treatment = "T Theoretical or Mathematical", } @Article{VanGils:1985:HCF, author = "W. J. {Van Gils}", title = "How to Cope with Faulty Processors in a Completely Connected Network of Communicating Processors", journal = j-INFO-PROC-LETT, volume = "20", number = "4", pages = "207--213", day = "10", month = may, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Philips Research Lab, Eindhoven, Neth", classification = "722; 723; C5440 (Multiprocessing systems)", corpsource = "Phillips Res. Lab., Eindhoven, Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Byzantine Generals problem; Byzantine generals problem; communicating processors; completely connected network; computer programming --- Algorithms; computer systems, digital; conflicting information; Distributed; fault tolerant computing; faulty processors; malfunctioning processors; multiprocessing systems; transmitting processor", pubcountry = "Netherlands A08", treatment = "T Theoretical or Mathematical", } @Article{Iliopoulos:1985:AAP, author = "Costas S. Iliopoulos", title = "Analysis of Algorithms on Problems in General {Abelian} Groups", journal = j-INFO-PROC-LETT, volume = "20", number = "4", pages = "215--220", day = "10", month = may, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q40 (20-04 20K05)", MRnumber = "86m:68072", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Warwick, Dep of Computer Science, Coventry, Engl", classification = "723; C1110 (Algebra); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comp. Sci., Warwick Univ., Coventry, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "abelian groups; Algorithms; analysis of algorithms; complete basis; computational complexity; computer programming; general Abelian groups; group theory; worst-case time complexity polynomial", pubcountry = "Netherlands A09", treatment = "T Theoretical or Mathematical", } @Article{Yehudai:1985:NCD, author = "Amiram Yehudai", title = "A note on chains of deterministic pushdown transducers", journal = j-INFO-PROC-LETT, volume = "20", number = "4", pages = "221--222", day = "10", month = may, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Univ of California, Los Angeles, Dep of Computer Science, Los Angeles, CA, USA", affiliationaddress = "Univ of California, Los Angeles, Dep of Computer Science, Los Angeles, CA, USA", classification = "721; C4210 (Formal logic)", corpsource = "Dept. of Comput. Sci., California Univ., Los Angeles, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "abstract model; automata theory; bounds; deterministic context-free; deterministic pushdown transducers; deterministic pushdown transducers.; DPDTs; formal languages; hierarchy; multipass compilers; polynomial; program compilers", pubcountry = "Netherlands A10", treatment = "T Theoretical or Mathematical", } @Article{Slusarek:1985:NDS, author = "Maciej Slusarek", title = "A note on the dynamic storage allocation problem", journal = j-INFO-PROC-LETT, volume = "20", number = "5", pages = "223--227", day = "12", month = jun, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Warsaw, Inst of Informatics, Warsaw, Pol", classification = "723; 921; C4240 (Programming and algorithm theory); C6150J (Operating systems)", corpsource = "Inst. of Inf., Warsaw Univ., Warsaw, Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "approximation algorithm; arrival times; computational complexity; computer operating systems; dynamic storage allocation; dynamic storage allocation problem; mathematical techniques --- Combinatorial Mathematics; memory cells; operations research; Storage Allocation; storage allocation; work variables allocation; worst-case ratio", pubcountry = "Netherlands A01", treatment = "T Theoretical or Mathematical", } @Article{Reif:1985:DFS, author = "John H. Reif", title = "Depth-First Search is Inherently Sequential", journal = j-INFO-PROC-LETT, volume = "20", number = "5", pages = "229--234", day = "12", month = jun, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68P10 (68Q15)", MRnumber = "86k:68007", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Harvard Univ, Aiken Computation Lab, Cambridge, MA, USA", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Div. of Appl. Sci., Harvard Univ., Cambridge, MA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "adjacency lists; Algorithms; computational complexity; computer programming; depth-first search; deterministic log-space reductions; deterministic polynomial time; directed graphs; graph theory; mathematical techniques --- Graph Theory; parallel computation; parallel processing; polynomial time complete; rooted graph; sequential algorithms", pubcountry = "Netherlands A02", treatment = "T Theoretical or Mathematical", } @Article{Vishkin:1985:EPS, author = "Uzi Vishkin", title = "On Efficient Parallel Strong Orientation", journal = j-INFO-PROC-LETT, volume = "20", number = "5", pages = "235--240", day = "12", month = jun, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "New York Univ, Dep of Computer Science, New York, NY, USA", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., New York Univ., NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computational complexity; computer programming --- Algorithms; concurrent-read concurrent-write; concurrent-read exclusive-write; connected bridgeless undirected graph; digraph; graph algorithm; Graph Theory; graph theory; mathematical techniques; parallel algorithm; parallel processing; parallel random access machines; parallel random excess machines; parallel strong orientation; pram; PRAM; PRAMs", pubcountry = "Netherlands A03", treatment = "T Theoretical or Mathematical", } @Article{Hartmanis:1985:IRA, author = "Juris Hartmanis", title = "Independence Results About Context-Free Languages and Lower Bounds", journal = j-INFO-PROC-LETT, volume = "20", number = "5", pages = "241--248", day = "12", month = jun, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q15 (03D05)", MRnumber = "88a:68036", MRreviewer = "E. B. Kinber", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Cornell Univ, Dep of Computer Science, Ithaca, NY, USA", classification = "721; C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; complexity; computational complexity; computations; Context Free Languages; context-free languages; formal system; grammar; independence results; logical structure; lower bounds; recursive representation", pubcountry = "Netherlands A04", treatment = "T Theoretical or Mathematical", } @Article{Bitner:1985:SMD, author = "James R. Bitner", title = "Storing Matrices on Disk for Efficient Row and Column Retrieval", journal = j-INFO-PROC-LETT, volume = "20", number = "5", pages = "249--254", day = "12", month = jun, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Texas at Austin, Dep of Computer Sciences, Austin, TX, USA", classification = "723; 921; C6120 (File organisation)", corpsource = "Dept. of Comput. Sci., Texas Univ., Austin, TX, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "access costs; column retrieval; computer programming --- Algorithms; data storage, digital; disk storage; lower bound; matrix algebra; matrix storage; Matrix storage; optimisation; optimization; page fetcher; row retrieval; storage management; virtual storage", pubcountry = "Netherlands A05", treatment = "T Theoretical or Mathematical", } @Article{Devroye:1985:NET, author = "Luc Devroye", title = "A note on the expected time required to construct the outer layer", journal = j-INFO-PROC-LETT, volume = "20", number = "5", pages = "255--257", day = "12", month = jun, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68U05 (68Q25)", MRnumber = "86k:68100", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "McGill Univ, Sch of Computer Science, Montreal, Que, Can", classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Sch. of Comput. Sci., McGill Univ., Montreal, Que., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; computational complexity; computer programming; divide-and-conquer algorithm; expected time; outer layer", pubcountry = "Netherlands A06", treatment = "T Theoretical or Mathematical", } @Article{Papadimitriou:1985:ASP, author = "Christos H. Papadimitriou", title = "An algorithm for shortest-path motion in three dimensions", journal = j-INFO-PROC-LETT, volume = "20", number = "5", pages = "259--263", day = "12", month = jun, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68U05 (68Q25)", MRnumber = "86k:68102", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Stanford Univ, Dep of Computer Science, Stanford, CA", classification = "723; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Stanford Univ., CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm theory; computer programming --- Algorithms; graph theory; path planning; polyhedral obstacles; polynomial approximation scheme; position control; robotics; shortest-path motion", pubcountry = "Netherlands A07", treatment = "T Theoretical or Mathematical", } @Article{Samet:1985:BC, author = "Hanan Samet", title = "Bidirectional Coroutines", journal = j-INFO-PROC-LETT, volume = "21", number = "1", pages = "1--6", day = "10", month = jul, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Univ of Maryland at College Park, Dep of Computer Science, College Park, MD, USA", affiliationaddress = "Univ of Maryland at College Park, Dep of Computer Science, College Park, MD, USA", classification = "723; C6110 (Systems analysis and programming); C6140D (High level languages)", corpsource = "Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "bidirectional coroutine; bidirectional coroutines; computer programming languages; control structures; data structures; hierarchical coroutines; high level languages; master slave control; programming; programming languages; resume master; resume slave; semicoroutines; subroutines; suspend mechanism", pubcountry = "Netherlands A01", treatment = "P Practical", } @Article{Hromkovic:1985:AMM, author = "Juraj Hromkovi{\v{c}}", title = "Alternating Multicounter Machines with Constant Number of Reversals", journal = j-INFO-PROC-LETT, volume = "21", number = "1", pages = "7--9", day = "10", month = jul, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q05 (03D05 68Q15)", MRnumber = "87h:68035", MRreviewer = "Gh. Grigora{\c{s}}", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Comenius Univ, Dep of Theoretical Cybernetics, Bratislava, Czech", classification = "721; C4220 (Automata theory)", corpsource = "Dept. of Theor. Cybernetics, Comenius Univ., Bratislava, Czechoslovakia", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "alternating multicounter machines; automata theory; computational complexity; constant number of reversals; multihead automata; multipushdown machine; nondeterminism; recursively enumerable sets; reversal number bound; single-letter alphabet; space bound; Turing machines", pubcountry = "Netherlands A02", treatment = "T Theoretical or Mathematical", } @Article{Negri:1985:JDM, author = "M. Negri and G. Pelagatti", title = "Join During Merge: an Improved Sort Based Algorithm", journal = j-INFO-PROC-LETT, volume = "21", number = "1", pages = "11--16", day = "10", month = jul, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Politecnico di Milano, Dipartimento di Elettronica, Milan, Italy", classification = "723; C6130 (Data handling techniques)", corpsource = "Dipartimento di Elettronica, Politecnico di Milano, Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer programming --- Algorithms; database systems; join; join during merge; join-during-merge; merging; sort based algorithm; sort-based algorithms; sorting; subfiles", pubcountry = "Netherlands A03", treatment = "P Practical", } @Article{Guralnik:1985:AUR, author = "Gerald Guralnik and Charles Zemach and Tony Warnock", title = "An algorithm for uniform random sampling of points in and on a hypersphere", journal = j-INFO-PROC-LETT, volume = "21", number = "1", pages = "17--21", day = "10", month = jul, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "65C10 (65W05)", MRnumber = "86k:65010", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Los Alamos Natl Lab, Los Alamos, NM, USA", classification = "723; 913; 922; C1140Z (Other topics in statistics); C4240 (Programming and algorithm theory)", corpsource = "Los Alamos Nat. Lab., NM, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; Box Muller method; computation times; computer programming; computer simulation; generalized polar coordinates; high-speed computers; hypersphere; Monte Carlo methods; n-dimensional sphere; points; programming theory; sampling; statistical analysis; topology; uniform random sampling; vector programming", pubcountry = "Netherlands A04", treatment = "T Theoretical or Mathematical", } @Article{Pagli:1985:SAH, author = "Linda Pagli", title = "Self-Adjusting Hash Tables", journal = j-INFO-PROC-LETT, volume = "21", number = "1", pages = "23--25", day = "10", month = jul, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", abstract = "The idea of self organizing data is applied to hash tables. Two different heuristics are proposed here, both based on the idea of moving the keys more frequently requested as close as possible to their own hash address.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Pisa, Dep of Computer Science, Pisa, Italy", classification = "723; C6120 (File organisation)", corpsource = "Dept. of Comput. Sci., Pisa Univ., Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "analysis of algorithms; computer programming --- Algorithms; data processing; data structures; Data Structures; file organisation; files; hash tables; quadratic search; search algorithms; self organizing data; self-adjusting hash tables", pubcountry = "Netherlands A05", treatment = "P Practical", } @Article{Kapur:1985:WCC, author = "Deepak Kapur and Mukkai S. Krishnamoorthy", title = "Worst-Case Choice for the Stable Marriage Problem", journal = j-INFO-PROC-LETT, volume = "21", number = "1", pages = "27--30", day = "10", month = jul, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68R05 (05A05 90B10)", MRnumber = "87b:68081", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See also comment \cite{Pujari:1987:CWC}.", acknowledgement = ack-nhfb, affiliationaddress = "GE, Computer Science Branch, Schenectady, NY, USA", classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Comput. Sci. Branch, General Electric Corp. Res. and Dev., Schenectady, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm theory; Algorithms; computer programming; coroutine solution; parallel algorithm; parallel processing; stable marriage problem; worst-case choice", pubcountry = "Netherlands A06", treatment = "T Theoretical or Mathematical", } @Article{Oh:1985:NRL, author = "Se Man Oh and J. C. H. Park", title = "A note on removing loops from table-driven code generators", journal = j-INFO-PROC-LETT, volume = "21", number = "1", pages = "31--34", day = "10", month = jul, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Korea Advanced Inst of Science \& Technology, Dep of Computer Science, Seoul, South Korea", affiliationaddress = "Korea Advanced Inst of Science \& Technology, Dep of Computer Science, Seoul, South Korea", classification = "723; C4210 (Formal logic); C6150C (Compilers, interpreters and other processors)", corpsource = "Dept. of Comput. Sci., Korea Adv. Inst. of Sci. and Technol., Seoul, South Korea", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; ambiguity; compilers; computer programming; grammars; LALR(1) look-ahead set; LALR(1) parse tables; look ahead set; loop detection and elimination; looping configuration; parsing; program compilers; removing loops; table-driven code generation; table-driven code generators; target codes; transition table", pubcountry = "Netherlands A07", treatment = "T Theoretical or Mathematical", } @Article{Yung:1985:SUK, author = "Mordechai M. Yung", title = "A secure and useful `keyless cryptosystem'", journal = j-INFO-PROC-LETT, volume = "21", number = "1", pages = "35--38", day = "10", month = jul, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Columbia Univ, Dep of Computer Science, New York, NY, USA", classification = "723; B6120B (Codes); C6130 (Data handling techniques)", corpsource = "Dept. of Comput. Sci., Columbia Univ., New York, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "authentication; communication environments; cryptography; data transmission; encryption; key generation protocol; keyless cryptography; protocol; protocols; security", pubcountry = "Netherlands A08", treatment = "P Practical", } @Article{Edelsbrunner:1985:FEP, author = "H. Edelsbrunner and H. A. Maurer", title = "Finding Extreme Points in Three Dimensions and Solving the Post-Office Problem in the Plane", journal = j-INFO-PROC-LETT, volume = "21", number = "1", pages = "39--47", day = "10", month = jul, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68U05", MRnumber = "87a:68148", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Technical Univ of Graz, Inst for Information Processing, Graz, Austria", classification = "723; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory); C6120 (File organisation)", corpsource = "Inst. for Inf. Process., Tech. Univ. of Graz, Austria", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; computational geometry; computer programming; data structures; extreme points; geometric search problem; graph theory; multi-dimensional searching; point location problems; post-office problem; three dimensions", pubcountry = "Netherlands A09", treatment = "T Theoretical or Mathematical", } @Article{Wegener:1985:OSP, author = "Ingo Wegener", title = "Optimal search with positive switch cost is {NP}-hard", journal = j-INFO-PROC-LETT, volume = "21", number = "1", pages = "49--52", day = "10", month = jul, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68P10 (68Q25 90C39)", MRnumber = "87d:68019", MRreviewer = "Ernst-Erich Doberkat", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ Frankfurt, Fachbereich Informatik, Frankfurt am Main, West Ger", classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Johann Wolfgang Goethe-Univ., Frankfurt, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; computer programming; NP-hard; NP-hardness; optimal search; positive switch cost; programming; programming theory", pubcountry = "Netherlands A10", treatment = "T Theoretical or Mathematical", } @Article{Yokomori:1985:ETR, author = "Takashi Yokomori and Derick Wood and Klaus-J{\"o}rn Lange", title = "Erratum: {``A three-restricted normal form theorem for {ETOL} languages'' [Inform. Process. Lett. {\bf 14} (1982), no. 3, 97--100; MR 83g:68115]}", journal = j-INFO-PROC-LETT, volume = "21", number = "1", pages = "53--53", day = "10", month = jul, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q45", MRnumber = "87f:68054", bibdate = "Sat Apr 11 12:24:20 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See \cite{Yokomori:1982:TRN}.", acknowledgement = ack-nhfb, fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", } @Article{Lumelsky:1985:FCD, author = "Vladimir J. Lumelsky", title = "On Fast Computation of Distance Between Line Segments", journal = j-INFO-PROC-LETT, volume = "21", number = "2", pages = "55--61", day = "16", month = aug, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "GE, Information Systems Lab, Schenectady, NY, USA", classification = "723; 921; C4240 (Programming and algorithm theory)", corpsource = "Inf. Syst. Lab., Gen. Elect. Co., Schenectady, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; CAD systems; computational geometry; computer programming; distance between line segments; fast computation; finite length straight lines; geometrical data; image processing; infinite length straight lines; information processing; MinD computation; minimum distance; minimum Euclidean distance; optimization; robotics; special algorithms; straight line segments; VLSI design", pubcountry = "Netherlands A01", treatment = "T Theoretical or Mathematical", } @Article{Rauchle:1985:EDC, author = "Thomas Rauchle and Sam Toueg", title = "Exposure to Deadlock for Communicating Processes is Hard to Detect", journal = j-INFO-PROC-LETT, volume = "21", number = "2", pages = "63--68", day = "16", month = aug, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Cornell Univ, Dep of Computer Science, Ithaca, NY, USA", classification = "722; 723; B6150 (Communication system theory); C4240 (Programming and algorithm theory); C6150G (Diagnostic, testing, debugging and evaluating systems)", corpsource = "Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "communicating processes; communication protocol correctness; computational complexity; computer communications software; computer metatheory; computer systems, digital; deadlock; deadlock exposure; Distributed; finite-state model; global deadlock states; global state analysis; operating systems (computers); programming theory; protocols; PSPACE-hard; system recovery; theorem proving; unbounded FIFO channels; unbounded non-FIFO channels", pubcountry = "Netherlands A02", treatment = "T Theoretical or Mathematical", } @Article{Kaldewaij:1985:DSA, author = "Anne Kaldewaij", title = "On the Decomposition of Sequences into Ascending Subsequences", journal = j-INFO-PROC-LETT, volume = "21", number = "2", pages = "69--69", day = "16", month = aug, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q20 (05A05)", MRnumber = "87b:68047", bibdate = "Sat Apr 11 12:24:20 MDT 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Eindhoven Univ of Technology, Dep of Mathematics \& Computing Science, Eindhoven, Neth", affiliationaddress = "Eindhoven Univ of Technology, Dep of Mathematics \& Computing Science, Eindhoven, Neth", classification = "723", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer metatheory --- Programming Theory; computer programming; decomposition of sequences; longest upsequence; Theory", } @Article{Hromkovic:1985:LLB, author = "Juraj Hromkovi{\v{c}}", title = "Linear Lower Bounds on Unbounded Fan-In {Boolean} Circuits", journal = j-INFO-PROC-LETT, volume = "21", number = "2", pages = "71--74", day = "16", month = aug, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q15 (94C10)", MRnumber = "87a:68063", MRreviewer = "Ingo Wegener", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Comenius Univ, Dep of Theoretical Cybernetics, Bratislava, Czech", classification = "721; 723; C4230 (Switching theory); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Theor. Cybern., Comenius Univ., Bratislava, Czechoslovakia", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Boolean function; Boolean functions; circuit complexity; combinational complexity; complexity theory; computational complexity; computer metatheory --- Boolean Functions; exponential lower bounds; linear lower bounds; logic circuits, combinatorial; lower bounds; nonpolynomial lower bounds; unbounded fan-in boolean circuits; unbounded fan-in Boolean circuits; WRAM", pubcountry = "Netherlands A03", treatment = "T Theoretical or Mathematical", } @Article{Janiga:1985:NFM, author = "Ladislav Janiga and V{\'a}clav Koubek", title = "A note on finding minimum cuts in directed planar networks by parallel computations", journal = j-INFO-PROC-LETT, volume = "21", number = "2", pages = "75--78", day = "16", month = aug, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68R10", MRnumber = "87c:68066", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "722; 723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computational complexity; computer systems, digital --- Parallel Processing; definitions; directed graphs; directed planar networks; Graph Theory; mathematical techniques; minimum cuts; parallel computations; parallel processing; proofs; propositions", pubcountry = "Netherlands A04", treatment = "T Theoretical or Mathematical", } @Article{Bini:1985:FPP, author = "Dario Bini and Victor Ya. Pan", title = "Fast Parallel Polynomial Division via Reduction to Triangular {Toeplitz} Matrix Inversion and to Polynomial Inversion Modulo a Power", journal = j-INFO-PROC-LETT, volume = "21", number = "2", pages = "79--81", day = "16", month = aug, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "65W05 (12-04 68Q40)", MRnumber = "86m:65167", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Pisa, Dep of Informatics, Pisa, Italy", classification = "722; 723; 921; C4130 (Interpolation and function approximation); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Inf., Pisa Univ., Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Boolean circuits; Boolean functions; computational complexity; computer programming --- Algorithms; computer systems, digital --- Parallel Processing; fast parallel polynomial division; mathematical techniques; matrix algebra; parallel polynominal division; parallel processing; polynomial inversion modulo A power; polynomial inversion modulo a power; Polynomials; polynomials; reduction to triangular Toeplitz matrix inversion; remainder of two polynomials; triangular Toeplitz matrix inversion; uniform arithmetic", pubcountry = "Netherlands A05", treatment = "T Theoretical or Mathematical", } @Article{Watjen:1985:FAT, author = "Dietmar W{\"a}tjen", title = "Feedback Automata and Their Languages", journal = j-INFO-PROC-LETT, volume = "21", number = "2", pages = "83--86", day = "16", month = aug, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q45", MRnumber = "87b:68062", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Technische Univ Braunschweig, Inst f{\"u}r Theoretische und Praktische Informatik, Braunschweig, West Ger", affiliationaddress = "Technische Univ Braunschweig, Inst f{\"u}r Theoretische und Praktische Informatik, Braunschweig, West Ger", classification = "721; C4210 (Formal logic); C4220 (Automata theory)", corpsource = "Inst. f{\"u}r Theor. und Praktische Inf., Tech. Univ Braunschweig, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; context-free languages; deterministic automata; deterministic models; epsilon-free regular languages; families of languages; feedback automata; feedback automata languages; feedback-controlled models; Formal Languages", pubcountry = "Netherlands A06", treatment = "T Theoretical or Mathematical", } @Article{Vitanyi:1985:STO, author = "Paul M. B. Vit{\'a}nyi", title = "Square Time is Optimal for Simulation of One Pushdown Store or One Queue by an Oblivious One-Head Tape Unit", journal = j-INFO-PROC-LETT, volume = "21", number = "2", pages = "87--91", day = "16", month = aug, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q05 (68Q15)", MRnumber = "87a:68050", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Cent for Mathematics \& Computer Science, Amsterdam, Neth", classification = "721; C1140C (Queueing theory); C4220 (Automata theory)", corpsource = "Centre for Math. and Comput. Sci., Amsterdam, Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; Kolmogorov complexity; multitape Taring machine; multitape Turing machines; oblivious one-head tape unit; one queue; pushdown store simulation; pushdown stores; queueing theory; simulation of one pushdown store; Turing machines", pubcountry = "Netherlands A07", treatment = "T Theoretical or Mathematical", } @Article{Nguyen:1985:IMC, author = "Van Nguyen", title = "The incompleteness of {Misra} and {Chandy}'s proof systems", journal = j-INFO-PROC-LETT, volume = "21", number = "2", pages = "93--96", day = "16", month = aug, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q60 (03B70)", MRnumber = "87f:68069", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Cornell Univ, Dep of Computer Science, Ithaca, NY, USA", classification = "722; 723; C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "communicating processes; computer metatheory; computer systems, digital; Distributed; distributed processing; networks of communicating processes; programming theory; proof systems", pubcountry = "Netherlands A08", treatment = "T Theoretical or Mathematical", } @Article{Martin:1985:FME, author = "Alain J. Martin and Jerry R. Burch", title = "Fair mutual exclusion with unfair {$P$} and {$V$} operations", journal = j-INFO-PROC-LETT, volume = "21", number = "2", pages = "97--100", day = "16", month = aug, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68N25", MRnumber = "87h:68015", MRreviewer = "N. N. Mirenkov", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "California Inst of Technology, Dep of Computer Science, Pasadena, CA, USA", classification = "722; 723; C4240 (Programming and algorithm theory)", corpsource = "Deput. of Compt. Sci., California Inst. of Technol., Pasadena, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer metatheory; computer systems, digital; Distributed; distributed processing; Domino Rule; fair mutual exclusion; fairness; mutual exclusion; P and V operations; programming theory; split binary semaphores; theorem proving; unfair P and V operations", pubcountry = "Netherlands A09", treatment = "T Theoretical or Mathematical", } @Article{Lautemann:1985:LTB, author = "Clemens Lautemann and Friedhelm {Meyer auf der Heide}", title = "Lower Time Bounds for Integer Programming with Two Variables", journal = j-INFO-PROC-LETT, volume = "21", number = "2", pages = "101--105", day = "16", month = aug, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "90C10", MRnumber = "87b:90089", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Technische Univ Berlin, Berlin, West Ger", classification = "921; B0250 (Combinatorial mathematics); B0260 (Optimisation techniques); C1160 (Combinatorial mathematics); C1180 (Optimisation techniques)", corpsource = "Tech. Univ., Berlin, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algebraic arguments; floor function; integer coordinates; integer programming; integer programming problem; lower bounds; lower time bounds; mathematical programming; trees (mathematics); variables", pubcountry = "Netherlands A10", treatment = "T Theoretical or Mathematical", } @Article{Martin:1985:EPA, author = "Alain J. Martin", title = "Erratum: {``The probe: an addition to communication primitives''}", journal = j-INFO-PROC-LETT, volume = "21", number = "2", pages = "107--107", day = "16", month = aug, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q10 (68N20)", MRnumber = "87d:68026b", bibdate = "Sat Apr 11 12:24:20 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See \cite{Martin:1985:PAC}.", acknowledgement = ack-nhfb, fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", } @Article{Thompson:1985:VDM, author = "Clark D. Thompson", title = "{VLSI} Design with Multiple Active Layers", journal = j-INFO-PROC-LETT, volume = "21", number = "3", pages = "109--111", day = "5", month = sep, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of California, Berkeley, Div of Computer Science, Berkeley, CA, USA", classification = "712; 714; 723; B1130 (General circuit analysis and synthesis methods); B2570 (Semiconductor integrated circuits)", corpsource = "Div. of Comput. Sci., California Univ., Berkeley, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "area time complexity; commercial VLSI design tools; Computer Aided Design; computer arithmetic; integrated circuits; integrated circuits, VLSI; multiple active layers; multiple-active-layer VLSI chips; multiple-layer layout; multiple-to-single layer transformation; network synthesis; redesign process; semiconducting silicon --- Applications; silicon; single-layer layout; transistors; VLSI; VLSI design", pubcountry = "Netherlands A01", treatment = "P Practical", } @Article{Kothari:1985:GAA, author = "Suresh C. Kothari and K. V. S. Ramarao", title = "General Algorithms for the Address Calculation of Lexicographically Ordered Tuples", journal = j-INFO-PROC-LETT, volume = "21", number = "3", pages = "113--116", day = "5", month = sep, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Iowa State Univ, Dep of Computer Science, Ames, IA, USA", classification = "723; C4240 (Programming and algorithm theory); C6120 (File organisation)", corpsource = "Dept. of Comput. Sci., Iowa State Univ., Ames, IA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "address calculation; algorithm theory; Algorithms; algorithms; computer programming; data structures; lexicographically ordered tuples; tuple entities", pubcountry = "Netherlands A02", treatment = "T Theoretical or Mathematical", } @Article{Lee:1985:PGD, author = "D. T. Lee and Y. T. Ching", title = "The power of geometric duality revisited", journal = j-INFO-PROC-LETT, volume = "21", number = "3", pages = "117--122", day = "5", month = sep, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68U05 (52-04 68Q25)", MRnumber = "87m:68070", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Northwestern Univ, Dep of Electrical Engineering \& Computer Science, Evanston, IL, USA", affiliationaddress = "Northwestern Univ, Dep of Electrical Engineering \& Computer Science, Evanston, IL, USA", classification = "723; C4190 (Other numerical methods); C4240 (Programming and algorithm theory); C6130 (Data handling techniques)", corpsource = "Dept. of Electr. Eng. and Comput. Sci., Northwestern Univ., Evanston, IL, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; computational complexity; computational geometry; computer programming; computer systems programming --- Sorting; duality (mathematics); geometric duality; optimal algorithm; sorting; two-dimensional sorting; two-dimensional sorting problem", pubcountry = "Netherlands A03", treatment = "T Theoretical or Mathematical", } @Article{JaJa:1985:ILB, author = "Joseph J{\'a}J{\'a} and Jean Takche", title = "Improved Lower Bounds for Some Matrix Multiplication Problems", journal = j-INFO-PROC-LETT, volume = "21", number = "3", pages = "123--127", day = "5", month = sep, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25", MRnumber = "87e:68043", MRreviewer = "Claus-Peter Schnorr", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Univ of Maryland at College Park, Electrical Engineering Dep, College Park, MD, USA", affiliationaddress = "Univ of Maryland at College Park, Electrical Engineering Dep, College Park, MD, USA", classification = "723; 921; C4140 (Linear algebra); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Electr. Eng., Maryland Univ., College Park, MD, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algebraic complexity; Algorithms; arithmetic complexity; bilinear forms; complexity; computational complexity; computer programming; fast algorithms; lower bounds; mathematical techniques --- Matrix Algebra; matrix algebra; matrix multiplication; matrix multiplication problems; special matrix multiplication problems", pubcountry = "Netherlands A04", treatment = "T Theoretical or Mathematical", } @Article{Herman:1985:DS, author = "Ted Herman and K. Mani Chandy", title = "On Distributed Search", journal = j-INFO-PROC-LETT, volume = "21", number = "3", pages = "129--133", day = "5", month = sep, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q20 (68M10 90C35)", MRnumber = "87c:68030", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Texas at Austin, Dep of Computer Science, Austin, TX, USA", classification = "723; 921; C1160 (Combinatorial mathematics); C1180 (Optimisation techniques)", corpsource = "Dept. of Comput. Sci., Texas Univ., Austin, TX, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "asynchronous network; computer programming --- Algorithms; directed graph; distributed algorithm; distributed computation; distributed program; distributed search; distributed system; dynamic programming; feasible solution; graph algorithms; graph theory; mathematical programming, dynamic; optimization; optimization problems; optimum solution; parallel search; threshold", pubcountry = "Netherlands A05", treatment = "T Theoretical or Mathematical", } @Article{Jantzen:1985:NSO, author = "M. Jantzen", title = "A note on a special one-rule {semi-Thue} system", journal = j-INFO-PROC-LETT, volume = "21", number = "3", pages = "135--140", day = "5", month = sep, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "03D03 (03D40 68Q45)", MRnumber = "87h:03058", MRreviewer = "John P. Helm", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ Hamburg, Fachbereich Informatik, Hamburg, West Ger", classification = "721; 723; C4210 (Formal logic)", corpsource = "Fachbereich Inf., Hamburg Univ., West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory --- Formal Languages; canonical; Church Rosser; church-rosser systems; computer metatheory; finite semi-Thue system; formal languages; grammars; monoid; one-rule semi-Thue system; semi-Thue system; string rewriting; string rewriting system; string transformation systems; Thue system; uniquely terminating; word problem", pubcountry = "Netherlands A06", treatment = "T Theoretical or Mathematical", } @Article{Budd:1985:CRR, author = "Timothy A. Budd", title = "Creation and Reflexive Rights in Grammatical Protection Systems", journal = j-INFO-PROC-LETT, volume = "21", number = "3", pages = "141--145", day = "5", month = sep, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68N25", MRnumber = "87a:68030", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Arizona, Dep of Computer Science, Tucson, AZ, USA", classification = "723; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory); C4290 (Other computer theory); C6150J (Operating systems)", corpsource = "Dept. of Comput. Sci., Arizona Univ., Tucson, AZ, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "command invocations; computational complexity; computer operating systems; computer programming --- Algorithms; creation rights; grammatical protection systems; graph theory; operating system protection mechanism; operating systems (computers); polynomial time algorithm; reflexive rights; safety; upper bound; upper bounds", pubcountry = "Netherlands A07", treatment = "T Theoretical or Mathematical", } @Article{Vitanyi:1985:LBT, author = "Paul M. B. Vit{\'a}nyi", title = "An $n^{1.618}$ lower bound on the time to simulate one queue or two pushdown stores by one tape", journal = j-INFO-PROC-LETT, volume = "21", number = "3", pages = "147--152", day = "5", month = sep, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q05 (03D10 03D15 68Q15)", MRnumber = "87j:68033", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Cent for Mathematics \& Computer Science, Dep of Computer Science, Amsterdam, Neth", affiliationaddress = "Cent for Mathematics \& Computer Science, Dep of Computer Science, Amsterdam, Neth", classification = "721; 922; C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Centre for Math. and Comput. Sci., Amsterdam, Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; computational complexity; Kolmogorov complexity; lower bound; lower bounds; multitape Turing machines; on-line; one-head tape Turing machine; online simulation by single-head tape units; probability --- Queueing Theory; pushdown stores; queue; queueing theory; time complexity; Turing machines; Turing Machines", pubcountry = "Netherlands A08", treatment = "T Theoretical or Mathematical", } @Article{Yoo:1985:ATC, author = "Chae Woo Yoo", title = "An approach to the transportation of computer software", journal = j-INFO-PROC-LETT, volume = "21", number = "3", pages = "153--157", day = "5", month = sep, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Soong Jun Univ, Dep of Computer Science, Seoul, South Korea", classification = "723; C6150C (Compilers, interpreters and other processors)", corpsource = "Dept. of Comput. Sci., Soong Jun Univ., Seoul, South Korea", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "compiler; computer operating systems; computer software; decompilation; detranslation; program compilers; software crisis; software methodologies; software portability; software transport system; software transportation; STS", pubcountry = "Netherlands A09", treatment = "P Practical", } @Article{Codenotti:1985:VIF, author = "B. Codenotti and F. Romani and G. Lotti", title = "{VLSI} Implementation of Fast Solvers for Band Linear Systems with Constant Coefficient Matrix", journal = j-INFO-PROC-LETT, volume = "21", number = "3", pages = "159--163", day = "5", month = sep, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "65F05 (65N10 65W05 68Q35)", MRnumber = "87g:65039", MRreviewer = "Ian Gladwell", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "CNR, Istituto di Elaborazione dell'Informazione, Pisa, Italy", classification = "714; 921; B0290H (Linear algebra); B0290Z (Other numerical methods); B2570 (Semiconductor integrated circuits); C4140 (Linear algebra); C4190 (Other numerical methods); C4240 (Programming and algorithm theory); C5220 (Computer architecture)", corpsource = "Istituto di Elaborazione dell'Inf., CNR, Pisa, Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "area complexity; band linear system; band linear systems; boundary value problems; computational complexity; computer architecture; constant coefficient matrix; DFT; diagonal matrices; difference method; elliptic equation; fast solvers; integrated circuits, VLSI --- Design; linear transform; linear transforms; mathematical techniques --- Vectors; mathematical transformations; matrix algebra; optimal VLSI designs; transforms; VLSI; VLSI implementation", pubcountry = "Netherlands A10", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Guting:1985:FDI, author = "Ralf Hartmut G{\"u}ting", title = "Fast Dynamic Intersection Searching in a Set of Isothetic Line Segments", journal = j-INFO-PROC-LETT, volume = "21", number = "4", pages = "165--171", day = "7", month = oct, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ Dortmund, Dortmund, West Ger", classification = "723; 921; C1160 (Combinatorial mathematics); C4130 (Interpolation and function approximation); C6130B (Graphics techniques)", corpsource = "Lehrstuhl Informatik, Dortmund Univ., West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; computational geometry; computer programming; halfobject technique; intersection searching; intersection searching problem; isothetic line segments; mathematical techniques --- Trees; query segment; range tree; segment tree; space requirements; trees (mathematics); update time; vertical line segments", pubcountry = "Netherlands A01", treatment = "T Theoretical or Mathematical", } @Article{Laumond:1985:EAP, author = "Jean-Paul Laumond", title = "Enumeration of Articulation Pairs of a Planar Graph", journal = j-INFO-PROC-LETT, volume = "21", number = "4", pages = "173--179", day = "7", month = oct, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "CNRS, Lab d'Automatique et d'Analyse des Syst{\`e}mes, Toulouse, Fr", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Lab. d'Automatique et d'Analyse des Systems, CNRS, Toulouse, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm theory; articulation pairs; computer programming --- Algorithms; connectivity; enumeration; Graph Theory; graph theory; mathematical techniques; planar graph; topological representations", pubcountry = "Netherlands A02", treatment = "T Theoretical or Mathematical", } @Article{Alpern:1985:DL, author = "Bowen Alpern and Fred B. Schneider", title = "Defining Liveness", journal = j-INFO-PROC-LETT, volume = "21", number = "4", pages = "181--185", day = "7", month = oct, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Cornell Univ, Dep of Computer Sciences, Ithaca, NY, USA", classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer metatheory; computer programming --- Theory; concurrency; concurrent programs; formal definition; liveness; liveness properties; Programming Theory; programming theory; safety; topological characterization; topology", pubcountry = "Netherlands A03", treatment = "T Theoretical or Mathematical", } @Article{Atkinson:1985:ZPC, author = "M. D. Atkinson", title = "On Zigzag Permutations and Comparisons of Adjacent Elements", journal = j-INFO-PROC-LETT, volume = "21", number = "4", pages = "187--189", day = "7", month = oct, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q20 (05A05 68R05)", MRnumber = "87c:68027", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Carleton Univ, Sch of Computer Science, Ottawa, Ont, Can", classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Sch. of Comput. Sci., Carleton Univ., Ottawa, Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "adjacent elements; algorithm theory; Algorithms; computer programming; elementary algorithm; zigzag permutations", pubcountry = "Netherlands A04", treatment = "T Theoretical or Mathematical", } @Article{Robert:1985:SAL, author = "Yves Robert and Maurice Tchuente", title = "A systolic array for the longest common subsequence problem", journal = j-INFO-PROC-LETT, volume = "21", number = "4", pages = "191--198", day = "7", month = oct, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q35 (68Q20)", MRnumber = "87m:68046", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "CNRS, Lab TIM3, St. Martin d'Heres, Fr", classification = "722; 723; B1130B (Computer-aided circuit analysis and design); B2570 (Semiconductor integrated circuits); C7410D (Electronic engineering computing)", corpsource = "Inst. IMAG, CNRS, Saint Martin d'Heres, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "circuit CAD; computer architecture; computer programming --- Algorithms; longest common subsequence problem; longest common subsequent problem; systolic array; VLSI", pubcountry = "Netherlands A05", treatment = "P Practical", } @Article{Keedy:1985:EUS, author = "J. L. Keedy and B. Freisleben", title = "On the Efficient Use of Semaphore Primitives", journal = j-INFO-PROC-LETT, volume = "21", number = "4", pages = "199--205", day = "7", month = oct, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Technische Hochschule Darmstadt, Inst f{\"u}r Praktische Informatik, Darmstadt, West Ger", affiliationaddress = "Technische Hochschule Darmstadt, Inst f{\"u}r Praktische Informatik, Darmstadt, West Ger", classification = "723; C6150J (Operating systems)", corpsource = "Inst. f{\"u}r Praktische Informatik, Tech. Hochshule Darmstadt, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "commutative queuing routines; computer operating systems; critical block exit problem; event counts; indivisible machine instructions; operating systems (computers); OS; P operations; semaphore primitives; sequencers; simultaneous P operations; synchronization; system kernel; user scheduling; V operations", pubcountry = "Netherlands A06", treatment = "P Practical", } @Article{Hsiao:1985:KBS, author = "Ching C. Hsiao and Nien-Tsu Shen", title = "$k$-Fold Bitonic Sort on a Mesh-Connected Parallel Computer", journal = j-INFO-PROC-LETT, volume = "21", number = "4", pages = "207--212", day = "7", month = oct, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Amdahl Corp, Sunnyvale, CA, USA", classification = "722; 723; C4240 (Programming and algorithm theory); C6130 (Data handling techniques)", corpsource = "Amdahl Corp., Sunnyvale, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "bitonic sort; computational complexity; computer systems programming; computer systems, digital; data folding schemes; data items; k-fold bitonic sort; memory locations; mesh-connected parallel computer; parallel processing; SIMD computer; Sorting; sorting; working registers", pubcountry = "Netherlands A07", treatment = "T Theoretical or Mathematical", } @Article{Marchetti-Spaccamela:1985:DAC, author = "A. Marchetti-Spaccamela and G. Romano", title = "On Different Approximation Criteria for Subset Product Problems", journal = j-INFO-PROC-LETT, volume = "21", number = "4", pages = "213--218", day = "7", month = oct, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (05C35)", MRnumber = "87d:68044", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Univ di Roma 'La Sapienza', Dipartimento d'Informatica e Sistemistica, Rome, Italy", affiliationaddress = "Univ di Roma 'La Sapienza', Dipartimento d'Informatica e Sistemistica, Rome, Italy", classification = "921; C1180 (Optimisation techniques); C4130 (Interpolation and function approximation); C4240 (Programming and algorithm theory)", corpsource = "Dipartimento d'Informatica e Sistematica, Roma Univ., Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm theory; approximation criteria; approximation theory; dominance rule; mathematical techniques --- Approximation Theory; optimisation; optimization; product objective function; subsequent product problems; subset product problems", pubcountry = "Netherlands A08", treatment = "T Theoretical or Mathematical", } @Article{Meyer:1985:ISM, author = "Bertrand Meyer", title = "Incremental String Matching", journal = j-INFO-PROC-LETT, volume = "21", number = "5", pages = "219--227", day = "18", month = nov, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of California, Dep of Computer Science, Santa Barbara, CA, USA", classification = "723; 903; C6120 (File organisation); C6130 (Data handling techniques); C7250 (Information storage and retrieval)", corpsource = "Dept. of Comput. Sci., California Univ., Santa Barbara, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "analysis of algorithms; bibliographic search; computer programming --- Algorithms; data handling; data processing --- Word Processing; data structures; finite automaton; incremental diagram construction; incremental string matching; Information Retrieval; information retrieval; information science; program correctness; string matching; transition diagram", pubcountry = "Netherlands A01", treatment = "T Theoretical or Mathematical", } @Article{Magott:1985:PES, author = "Jan Magott", title = "Performance Evaluation of Systems of Cyclic Sequential Processes with Mutual Exclusion Using {Petri} Nets", journal = j-INFO-PROC-LETT, volume = "21", number = "5", pages = "229--232", day = "18", month = nov, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Technical Univ of Wroclaw, Inst of Engineering Cybernetics, Wroclaw, Pol", classification = "722; 723; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory); C5440 (Multiprocessing systems); C5470 (Performance evaluation and testing)", corpsource = "Inst. of Eng. Cybern., Tech. Univ. of Wroclaw, Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computational complexity; computer systems, digital; concurrent systems; cyclic sequential processes; graph theory; multiprocessing systems; mutual exclusion; Performance; performance evaluation; Petri nets; time factor", pubcountry = "Netherlands A02", treatment = "T Theoretical or Mathematical", } @Article{Kfoury:1985:UPP, author = "A. J. Kfoury", title = "The unwind property for programs with bounded memory", journal = j-INFO-PROC-LETT, volume = "21", number = "5", pages = "233--238", day = "18", month = nov, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q55", MRnumber = "87a:68116", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Boston Univ, Dep of Computer Science, Boston, MA, USA", classification = "723; C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Boston Univ., MA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "bounded memory; computer metatheory --- Programming Theory; computer programming; formal logic; logics of programs; program logic; program schemes; programming theory; programs with bounded memory; Theory; truth-table property; unwind property", pubcountry = "Netherlands A03", treatment = "T Theoretical or Mathematical", } @Article{Dobosiewicz:1985:NNS, author = "W{\l}odzimierz Dobosiewicz", title = "A note on natural selection", journal = j-INFO-PROC-LETT, volume = "21", number = "5", pages = "239--243", day = "18", month = nov, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Guelph, Dep of Computing \& Information Science, Guelph, Ont, Can", classification = "723; C6130 (Data handling techniques)", corpsource = "Dept. of Comput. and Inf. Sci., Guelph Univ., Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "auxiliary memory reservoir; computer programming --- Algorithms; computer systems programming; external sorting; mergesort; merging; natural selection; replacement selection; Sorting; sorting", pubcountry = "Netherlands A04", treatment = "P Practical", } @Article{Duris:1985:TCA, author = "Pavol {\v{D}}uri{\v{s}} and Ondrej S\'ykora and Imrich V{\v{r}}{\soft{t}}o and Clark D. Thompson", title = "Tight Chip Area Lower Bounds for Discrete {Fourier} and {Walsh-Hadamard} Transformations", journal = j-INFO-PROC-LETT, volume = "21", number = "5", pages = "245--247", day = "18", month = nov, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q35 (94A11)", MRnumber = "87d:68052", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Slovak Acad of Sciences, Computing Cent, Bratislava, Czech", classification = "714; 921; B1265B (Logic circuits); B2570 (Semiconductor integrated circuits); C4240 (Programming and algorithm theory)", corpsource = "Comput. Center, Slovak Acad. of Sci., Bratislava, Czechoslovakia", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "chip area; chip area lower bounds; computational complexity; digital arithmetic; discrete Fourier transformations; discrete Fourier transforms; Fourier transforms; integrated circuits, VLSI; integrated logic circuits; mathematical transformations; Theory; tight linear lower bounds; VLSI; VLSI circuits; VLSI complexity; Walsh-Hadamard transformations; Walsh-Hadamard transforms", pubcountry = "Netherlands A05", treatment = "T Theoretical or Mathematical", } @Article{Supowit:1985:DSP, author = "Kenneth J. Supowit", title = "Decomposing a Set of Points into Chains, with Applications to Permutation and Circle Graphs", journal = j-INFO-PROC-LETT, volume = "21", number = "5", pages = "249--252", day = "18", month = nov, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q20 (05C35 68R10 68U05)", MRnumber = "87b:68049", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Princeton Univ, Dep of Electrical Engineering \& Computer Science, Princeton, NJ, USA", affiliationaddress = "Princeton Univ, Dep of Electrical Engineering \& Computer Science, Princeton, NJ, USA", classification = "723; 921; C1160 (Combinatorial mathematics); C4190 (Other numerical methods); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Electr. Eng. and Comput. Sci., Princeton Univ., NJ, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "analysis of algorithms; circle graphs; coloring algorithm; computational complexity; computational geometry; computer programming --- Algorithms; graph coloring; graph colouring; Graph Theory; mathematical techniques; minimum coloring; permutation graphs; time algorithm", pubcountry = "Netherlands A06", treatment = "T Theoretical or Mathematical", } @Article{Derigs:1985:EDL, author = "Ulrich Derigs", title = "An Efficient {Dijkstra}-Like Labeling Method for Computing Shortest Odd\slash Even Paths", journal = j-INFO-PROC-LETT, volume = "21", number = "5", pages = "253--258", day = "18", month = nov, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Rheinische Friedrich-Wilhelms-Univ Bonn, Abteilung Operations Research, Bonn, West Ger", affiliationaddress = "Rheinische Friedrich-Wilhelms-Univ Bonn, Abteilung Operations Research, Bonn, West Ger", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Abteilung Operations Res., Rheinische Friedrich-Wilhelms-Univ. Bonn, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computation theory; computer programming --- Algorithms; Dijkstra-like labeling method; Graph Theory; graph theory; labeling algorithm; matching; matching algorithm; mathematical techniques; shortest odd/even paths; shortest paths", pubcountry = "Netherlands A07", treatment = "T Theoretical or Mathematical", } @Article{Birkhoff:1985:DRA, author = "Ingrid J. M. Birkhoff", title = "A direct routing algorithm for the bit-reversal permutation on a shuffle-exchange network", journal = j-INFO-PROC-LETT, volume = "21", number = "5", pages = "259--268", day = "18", month = nov, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Utrecht, Dep of Computer Science, Utrecht, Neth", classification = "722; 723; C4230 (Switching theory)", corpsource = "Dept. of Comput. Sci., Utrecht Univ., Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "bit-reversal permutation; computer programming --- Algorithms; computer systems, digital; direct routing algorithm; explicit control matrix; interconnection network; interconnection networks; parallel computations; Parallel Processing; parallel processing; perfect shuffle; routing scheme; shuffle-exchange network; switching networks", pubcountry = "Netherlands A08", treatment = "T Theoretical or Mathematical", } @Article{Mannila:1985:FAR, author = "Heikki Mannila and Kurt Mehlhorn", title = "A fast algorithm for renaming a set of clauses as a {Horn} set", journal = j-INFO-PROC-LETT, volume = "21", number = "5", pages = "269--272", day = "18", month = nov, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Helsinki, Dep of Computer Science, Helsinki, Finl", classification = "723; C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Helsinki Univ., Finland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computational complexity; computer metatheory; computer programming --- Algorithms; dense graph; depth-first search; formal logic; horn clause; Horn clause; Horn set; polynomial-time algorithm; positive literal; renaming; renaming clauses", pubcountry = "Netherlands A09", treatment = "T Theoretical or Mathematical", } @Article{Chatelin:1986:TAM, author = "Philippe Chatelin", title = "On Transformations of Algorithms to Multiply $2 \times 2$ Matrices", journal = j-INFO-PROC-LETT, volume = "22", number = "1", pages = "1--5", day = "2", month = jan, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q20", MRnumber = "87c:68028", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "CNRS, Lab d'Informatique Fondamentale et d'Intelligence Artificielle, St. Martin d'Heres, Fr", affiliationaddress = "CNRS, Lab d'Informatique Fondamentale et d'Intelligence Artificielle, St. Martin d'Heres, Fr", classification = "723; 921; C1110 (Algebra); C4140 (Linear algebra)", corpsource = "Lab. d'Inf. Fondamentale et d'Intelligence Artificielle, CNRS, Saint Martin d'Heres, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algebraic calculus; algebraic complexity; algorithms; Algorithms; computer programming; invariant transformation; mathematical techniques --- Matrix Algebra; matrix algebra; matrix multiplication; noncommutative polynomials; optimal algorithm; program transformation; sets of bilinear forms; Strassen algorithm; Winograd algorithm", pubcountry = "Netherlands A01", subject = "F.2.1 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Computations on matrices \\ I.2.2 Computing Methodologies, ARTIFICIAL INTELLIGENCE, Automatic Programming, Program transformation", treatment = "T Theoretical or Mathematical", } @Article{Berstel:1986:EIM, author = "Jean Berstel", title = "Every iterated morphism yields a {co-CFL}", journal = j-INFO-PROC-LETT, volume = "22", number = "1", pages = "7--9", day = "2", month = jan, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q45", MRnumber = "87e:68055", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ Pierre et Marie Curie, LITP, Paris, Fr", classification = "721; C4210 (Formal logic)", corpsource = "LITP, Univ. Pierre et Marie Curie, Paris, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; Context Free Languages; context-free language; context-free languages; iterated morphism; languages; permutation-free ward; permutation-free word; theory; verification", pubcountry = "Netherlands A02", subject = "F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Classes defined by grammars or automata", treatment = "T Theoretical or Mathematical", } @Article{Pan:1986:TBA, author = "Victor Ya. Pan", title = "The Trade-Off Between the Additive Complexity and the Asynchronicity of Linear and Bilinear Algorithms", journal = j-INFO-PROC-LETT, volume = "22", number = "1", pages = "11--14", day = "2", month = jan, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25", MRnumber = "87c:68033", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "State Univ of New York at Albany, Computer Science Dep, Albany, NY, USA", classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., State Univ. of New York, Albany, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "additive complexity; algorithms; Algorithms; asynchronous algorithms; bilinear algorithms; bilinear forms; computational complexity; computer programming; linear algorithm; linear algorithms; linearly independent linear forms; measurement; verification", pubcountry = "Netherlands A03", subject = "F.2.3 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Tradeoffs among Complexity Measures \\ I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms", treatment = "T Theoretical or Mathematical", } @Article{Baumgarten:1986:TPC, author = "Bernd Baumgarten and Peter Ochsenschl{\"a}ger", title = "On termination and phase changes in the presence of unreliable communication", journal = j-INFO-PROC-LETT, volume = "22", number = "1", pages = "15--20", day = "2", month = jan, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Gesellschaft f{\"u}r Mathematik und Datenverarbeitung,Inst f{\"u}r Systemtechnik, Darmstadt, West Ger", affiliationaddress = "Gesellschaft f{\"u}r Mathematik und Datenverarbeitung,Inst f{\"u}r Systemtechnik, Darmstadt, West Ger", classification = "722; 723; C4220 (Automata theory); C5620 (Computer networks and techniques)", corpsource = "Inst. f{\"u}r Systemtech., Gesellschaft f{\"u}r Math. und Datenverarbeitung, Darmstadt, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; computer systems, digital; Distributed; distributed processing; distributed systems; global termination; interprocess communication; parallel processing; phase changes; termination; theory; unreliable communication; verification", pubcountry = "Netherlands A04", subject = "D.4.7 Software, OPERATING SYSTEMS, Organization and Design, Distributed systems \\ F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Automata \\ D.4.1 Software, OPERATING SYSTEMS, Process Management, Synchronization", treatment = "T Theoretical or Mathematical", } @Article{Clarkson:1986:LPT, author = "Kenneth L. Clarkson", title = "Linear Programming in ${O}(n \times 3^{d^2})$ time", journal = j-INFO-PROC-LETT, volume = "22", number = "1", pages = "21--24", day = "2", month = jan, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "90C05 (65K05)", MRnumber = "87h:90126", MRreviewer = "John J. Dinkel", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "AT\&T Bell Lab, Murray Hill, NJ, USA", classification = "723; 921; C1160 (Combinatorial mathematics); C1180 (Optimisation techniques); C4240 (Programming and algorithm theory)", corpsource = "AT and T Bell Labs., Murray Hill, NJ, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; combinational problems; combinatorial mathematics; combinatorial problems; computational complexity; computer programming; linear programming; mathematical programming, linear; multidimensional search problem; theory; time bound", pubcountry = "Netherlands A05", subject = "G.1.6 Mathematics of Computing, NUMERICAL ANALYSIS, Optimization, Linear programming \\ G.2.1 Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics \\ F.1.3 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes", treatment = "T Theoretical or Mathematical", } @Article{Lingas:1986:GDT, author = "Andrzej Lingas", title = "The {Greedy} and {Delauney} triangulations are not bad in the average case", journal = j-INFO-PROC-LETT, volume = "22", number = "1", pages = "25--31", day = "2", month = jan, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Linkoping Univ, Dep of Computer \& Information Science, Linkoping, Swed@", classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. and Inf. Sci., Linkoping Univ., Sweden", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; computation theory; computer programming; Delaunay triangulation; Delauney triangulation; greedy triangulation; Greedy triangulation; minimum weight triangulation; theory; triangulation algorithms; verification; Voronoi diagram", pubcountry = "Netherlands A06", subject = "I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms \\ G.3 Mathematics of Computing, PROBABILITY AND STATISTICS", treatment = "T Theoretical or Mathematical", } @Article{Rosier:1986:NPA, author = "Louis E. Rosier", title = "A Note on {Presburger} Arithmetic with Array Segments, Permutation and Equality", journal = j-INFO-PROC-LETT, volume = "22", number = "1", pages = "33--35", day = "2", month = jan, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q05 (03D35 03F35)", MRnumber = "87f:68024", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Texas at Austin, Dep of Computer Science, Austin, TX, USA", classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Texas Univ., Austin, TX, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "array segments; assertion language; computational complexity; computer metatheory; computer programming languages; decision problem; finite length array segments; languages; PERM; Presburger arithmetic; programming languages; programming theory; satisfiability problem; Theory; validity problem; verification", pubcountry = "Netherlands A07", subject = "F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Decision problems", treatment = "T Theoretical or Mathematical", } @Article{Krivanek:1986:HUN, author = "Mirko K{\v{r}}iv{\'a}nek", title = "Hexagonal unit network---a tool for proving the {NP-completeness} results of geometric problems", journal = j-INFO-PROC-LETT, volume = "22", number = "1", pages = "37--41", day = "2", month = jan, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68U05 (68Q25 90B10)", MRnumber = "87d:68100", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Research Inst of Mathematical Machines, Prague, Czech", classification = "723; 921; C1160 (Combinatorial mathematics); C1180 (Optimisation techniques); C4240 (Programming and algorithm theory)", corpsource = "Res. Inst. of Math. Machines, Praha, Czechoslovakia", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computational complexity; computer metatheory; Euclidean clustering; geometric problems; geometric programming; graph theory; hexagonal unit network; languages; mathematical techniques --- Graph Theory; NP-completeness; polynominal transformations; verification", pubcountry = "Netherlands A08", subject = "F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Decision problems \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory", treatment = "T Theoretical or Mathematical", } @Article{Jacobs:1986:TRT, author = "Christiaan T. M. Jacobs and Peter {Van Emde Boas}", title = "Two Results on Tables", journal = j-INFO-PROC-LETT, volume = "22", number = "1", pages = "43--48", day = "2", month = jan, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (68P10)", MRnumber = "87g:68024", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", abstract = "A. C. Yao has determined the maximal size of a finite universe U such that it is possible to store all subsets A of U with k elements in a table of k slots in such a way that membership in A can be determined in a single probe. In his model it is assumed that all elements of A are physically stored in the table. If this assumption is relaxed and arbitrary elements in U can be stored in order to encode subsets A, then Yao's upper bound is no longer valid. It fails for trivial reasons only: a single probe lookup strategy only exists when it is possible to encode arbitrary subsets of U by a bitmap. Our second results is an improvement of the optimal program size for perfect hash functions, solving an open problem from Slot and Van Emde Boas.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Amsterdam, Dep of Mathematics \& Computer Science, Amsterdam, Neth", annote = "The last author spells his name both as Van and van in the same paper.", classification = "723; C4240 (Programming and algorithm theory); C6120 (File organisation); C6130 (Data handling techniques)", corpsource = "Dept. of Math. and Comput. Sci., Amsterdam Univ., Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computational complexity; computer metatheory; data processing; Data Structures; file organisation; hash function; optimal program size; perfect hashing; single-probe table lookup; table lookup; theory; verification", pubcountry = "Netherlands A09", subject = "E.2 Data, DATA STORAGE REPRESENTATIONS, Hash-table representations \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching", treatment = "T Theoretical or Mathematical", } @Article{Kriauciukas:1986:TPP, author = "V. Kriau{\v{c}}iukas", title = "Tree-Like Parse and Polynomial Subclasses of Search Problems", journal = j-INFO-PROC-LETT, volume = "22", number = "1", pages = "49--54", day = "2", month = jan, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Lithuanian SSR Acad of Sciences, Inst of Mathematics \& Cybernetics, Vilnius, USSR", affiliationaddress = "Lithuanian SSR Acad of Sciences, Inst of Mathematics \& Cybernetics, Vilnius, USSR", classification = "721; 921; C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Inst. of Math. and Cybern., Acad. of Sci., Vilnius, Lithuanian SSR, USSR", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; automata theory; computational complexity; Context Free Grammars; context-free grammars; context-free graph grammar; languages; mathematical techniques --- Graph Theory; NP-complete problems; object structurability; polynomial subclasses; polynomial time; search problems; structured objects; theory; tree-like parse; trees (mathematics); verification", pubcountry = "Netherlands A10", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching \\ I.2.8 Computing Methodologies, ARTIFICIAL INTELLIGENCE, Problem Solving, Control Methods, and Search, Graph and tree search strategies \\ F.4.2 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems, Grammar types \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees \\ F.4.2 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems, Parsing", treatment = "T Theoretical or Mathematical", } @Article{Stojmenovic:1986:NAC, author = "Ivan Stojmenovi{\'{c}} and Eljas Soisalon-Soininen", title = "A Note on Approximate Convex Hulls", journal = j-INFO-PROC-LETT, volume = "22", number = "2", pages = "55--56", day = "18", month = jan, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68U05", MRnumber = "87e:68109", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Novi Sad, Novi Sad, Yugosl", classification = "723; C4130 (Interpolation and function approximation); C4240 (Programming and algorithm theory)", corpsource = "Inst. of Math., Novi Sad Univ., Yugoslavia", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; approximate convex hulls; approximation algorithms; approximation scheme; computation theory; computer programming; curve fitting; linear time algorithm; verification", pubcountry = "Netherlands A01", subject = "G.1.2 Mathematics of Computing, NUMERICAL ANALYSIS, Approximation, Minimax approximation and algorithms", treatment = "T Theoretical or Mathematical", } @Article{Israeli:1986:IPA, author = "Amos Israeli and Y. Shiloach", title = "An Improved Parallel Algorithm for Maximal Matching", journal = j-INFO-PROC-LETT, volume = "22", number = "2", pages = "57--60", day = "18", month = jan, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (68R10)", MRnumber = "87g:68023", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Technion-Israel Inst of Technology, Haifa, Isr", classification = "722; 723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; computational complexity; computer programming; computer systems, digital --- Parallel Processing; CRCW-PRAM; graph matching; graph theory; graphs; mathematical techniques --- Graph Theory; maximal matching; parallel algorithm; performance; undirected graphs; verification", pubcountry = "Netherlands A02", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms \\ G.1.0 Mathematics of Computing, NUMERICAL ANALYSIS, General, Parallel algorithms \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Pattern matching", treatment = "T Theoretical or Mathematical", } @Article{Dai:1986:ELM, author = "Ke-Chang Dai", title = "{EDISON-80}, a language for modular programming of parallel processes", journal = j-INFO-PROC-LETT, volume = "22", number = "2", pages = "61--72", day = "18", month = jan, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Jiao-Tung Univ, Shanghai, China", classification = "722; 723; C6115 (Programming support); C6140D (High level languages)", corpsource = "Jiao-Tung Univ., Shanghai, China", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "compilation facility; computer programming languages; computer systems, digital --- Parallel Processing; design; EDISON-80; high level languages; high-level languages; Intel development system; interpreted language; languages; modular programming; nontrivial system software; parallel processing; programming environment; programming environments; programming language; separate compilation", pubcountry = "Netherlands A03", review = "ACM CR 8609-0798", subject = "D.3.2 Software, PROGRAMMING LANGUAGES, Language Classifications, EDISON \\ D.3.3 Software, PROGRAMMING LANGUAGES, Language Constructs, Concurrent programming structures \\ D.2.2 Software, SOFTWARE ENGINEERING, Tools and Techniques, Modules and interfaces \\ D.3.4 Software, PROGRAMMING LANGUAGES, Processors", treatment = "P Practical", } @Article{Grigoriadis:1986:LBC, author = "M. D. Grigoriadis and B. Kalantari", title = "A Lower Bound to the Complexity of {Euclidean} and Rectilinear Matching Algorithms", journal = j-INFO-PROC-LETT, volume = "22", number = "2", pages = "73--76", day = "18", month = jan, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (68P10)", MRnumber = "87d:68040", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Rutgers Univ, New Brunswick, NJ, USA", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Rutgers Univ., New Brunswick, NJ, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; complexity; computational complexity; computer programming; Euclidean matching; Euclidean matching algorithms; graph theory; graphs; heuristic algorithm; lower bound; lower bounds; mathematical techniques --- Graph Theory; performance; rectilinear matching; rectilinear matching algorithms; spanning trees; time complexity; undirected graphs; verification", pubcountry = "Netherlands A04", review = "ACM CR 8611-1025", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Pattern matching \\ I.2.8 Computing Methodologies, ARTIFICIAL INTELLIGENCE, Problem Solving, Control Methods, and Search, Heuristic methods", treatment = "T Theoretical or Mathematical", } @Article{Israeli:1986:FSR, author = "Amos Israeli and A. Itai", title = "A fast and simple randomized parallel algorithm for maximal matching", journal = j-INFO-PROC-LETT, volume = "22", number = "2", pages = "77--80", day = "18", month = jan, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25", MRnumber = "87d:68041", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Technion-Israel Inst of Technology, Haifa, Isr", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; computational complexity; computer programming; CRCW-PRAM; graph theory; graphs; input graph; mathematical techniques --- Graph Theory; maximal matching; parallel algorithm; parallel processing; parallel randomized algorithm; randomized parallel algorithm; undirected graphs; verification", pubcountry = "Netherlands A05", subject = "G.1.0 Mathematics of Computing, NUMERICAL ANALYSIS, General, Parallel algorithms \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Pattern matching", treatment = "T Theoretical or Mathematical", } @Article{Martel:1986:LBP, author = "Charles U. Martel", title = "Lower bounds on parallel algorithms for finding the first maximal independent set", journal = j-INFO-PROC-LETT, volume = "22", number = "2", pages = "81--85", day = "18", month = jan, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25", MRnumber = "87d:68045", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of California, Davis, CA, USA", classification = "722; 723; C4240 (Programming and algorithm theory)", corpsource = "Div. of Comput. Sci., California Univ., CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; computational complexity; computer programming; computer systems, digital --- Parallel Processing; deterministic algorithm; first maximal independent set; lower bound; lower bounds; maximal independent set; oracles; parallel algorithm; parallel algorithms; parallel processing; performance; sequential structure; theory", pubcountry = "Netherlands A06", review = "ACM CR 8705-0388", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures \\ F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism \\ F.1.3 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms", treatment = "T Theoretical or Mathematical", } @Article{Cialdea:1986:SRP, author = "Marta Cialdea", title = "Some remarks on the possibility of extending resolution proof procedures to intuitionistic logic", journal = j-INFO-PROC-LETT, volume = "22", number = "2", pages = "87--90", day = "18", month = jan, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "03B45 (03B20 03B35 68T15)", MRnumber = "87j:03016", MRreviewer = "G. E. Mints", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "CNRS, Toulouse, Fr", classification = "723; C1230 (Artificial intelligence); C4210 (Formal logic)", corpsource = "Langages et Syst. Inf., Univ. Paul Sabatier, Toulouse, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer metatheory; computer science; constructive logic; formal languages; Formal Logic; formal logic; formal semantics; intuitionistic logic; languages; modal logic; resolution proof procedures; theorem proving; theory; verification", pubcountry = "Netherlands A07", subject = "I.2.3 Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Nonmonotonic reasoning and belief revision \\ F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages", treatment = "T Theoretical or Mathematical", } @Article{Goralcik:1986:VN, author = "Pavel Goral{\v{c}}{\'\i}k and V{\'{a}}clav Koubek", title = "Verifying nonrigidity", journal = j-INFO-PROC-LETT, volume = "22", number = "2", pages = "91--95", day = "18", month = jan, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (05C99 08A35 68Q15 68Q40)", MRnumber = "88a:68051", MRreviewer = "H.-J. Hoehnke", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Charles Univ, Prague, Czech", classification = "921; C4240 (Programming and algorithm theory)", corpsource = "Fac. of Math. and Phys., Charles Univ., Praha, Czechoslovakia", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algebra; algorithms; computational complexity; finite algebra; homomorphisms; languages; mathematical techniques; nonrigid; nonrigidity problem; NP-complete; NP-completeness; rigidity; theory; verification", pubcountry = "Netherlands A08", subject = "G.1.3 Mathematics of Computing, NUMERICAL ANALYSIS, Numerical Linear Algebra \\ F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Algebraic language theory", treatment = "T Theoretical or Mathematical", } @Article{Snir:1986:EBA, author = "Marc Snir", title = "Exact Balancing is not Always Good", journal = j-INFO-PROC-LETT, volume = "22", number = "2", pages = "97--102", day = "18", month = jan, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25", MRnumber = "87i:68031", MRreviewer = "Colin J. H. McDiarmid", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Hebrew Univ of Jerusalem, Jerusalem, Isr", classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Inst. of Math. and Comput. Sci., Hebrew Univ. of Jerusalem, Israel", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm theory; Algorithms; algorithms; binary tree; computer programming; divide-and-conquer algorithms; exact balancing; optimum tree; recurrence relations; trees (mathematics); verification", pubcountry = "Netherlands A09", review = "ACM CR 8612-1108", subject = "G.2.1 Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics, Recurrences and difference equations", treatment = "T Theoretical or Mathematical", } @Article{Webster:1986:CDE, author = "Max B. Webster and Paul W. Baker", title = "A Class of Differential Equations for Testing Variable Step-Size Integration", journal = j-INFO-PROC-LETT, volume = "22", number = "2", pages = "103--107", day = "18", month = jan, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of New South Wales, Kensington, Aust", classification = "723; 921; C1120 (Mathematical analysis); C4160 (Numerical integration and differentiation); C4170 (Differential equations)", corpsource = "Sch. of Electr. Eng. and Comput. Sci., New South Wales Univ., Kensington, NSW, Australia", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer programming; differential equations; experimentation; harmonic equation; integration; integration subroutines; mathematical techniques --- Differential Equations; nonlinear differential equations; performance; Subroutines; testing; variable step-size numerical integration; variable-step-size integration", pubcountry = "Netherlands A10", review = "ACM CR 8608-0729", subject = "G.1.7 Mathematics of Computing, NUMERICAL ANALYSIS, Ordinary Differential Equations", treatment = "T Theoretical or Mathematical", } @Article{Kumar:1986:PFQ, author = "P. {Srinivas Kumar} and M. Manohar", title = "On Probability of Forest of Quadtrees Reducing to Quadtrees", journal = j-INFO-PROC-LETT, volume = "22", number = "3", pages = "109--111", day = "3", month = mar, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "ISRO Satellite Cent, Bangalore, India", classification = "723; 921; C1140Z (Other topics in statistics); C6120 (File organisation); C6130B (Graphics techniques)", corpsource = "ISRO Satellite Center, Bangalore, India", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "binary image; computer graphics; data processing --- Data Structures; data structures; design; forest of quadtrees; FQT; image data structures; image processing; mathematical techniques --- Trees; probability; QT; quadtrees; space efficiency; theory", pubcountry = "Netherlands A01", subject = "I.3.m Computing Methodologies, COMPUTER GRAPHICS, Miscellaneous \\ E.1 Data, DATA STRUCTURES, Trees", treatment = "T Theoretical or Mathematical", } @Article{Ambos-Spies:1986:IPT, author = "Klaus Ambos-Spies", title = "Inhomogeneities in the polynomial-time degrees: the degrees of super sparse sets", journal = j-INFO-PROC-LETT, volume = "22", number = "3", pages = "113--117", day = "3", month = mar, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q15", MRnumber = "88e:68036", MRreviewer = "Ronald V. Book", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ Dortmund, Dortmund, West Ger", classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Lehrstuhl f{\"u}r Inf. II, Dortmund Univ., West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "complexity; computational complexity; computer metatheory; many-one reducibility; NP; NP-sets; polynomial-time degrees; polynomial-time reducibilities; relative complexity; super sparse sets; theory; verification", pubcountry = "Netherlands A02", subject = "G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous \\ F.1.3 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Reducibility and completeness", treatment = "T Theoretical or Mathematical", } @Article{Aurenhammer:1986:ODW, author = "Franz Aurenhammer", title = "The one-dimensional weighted {Vorono{\u{\i}}diagram}", journal = j-INFO-PROC-LETT, volume = "22", number = "3", pages = "119--123", day = "3", month = mar, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68U05", MRnumber = "87h:68140", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Technical Univ of Graz, Graz, Aust", classification = "723; C4190 (Other numerical methods); C4240 (Programming and algorithm theory)", corpsource = "Inst. for Inf. Processing, IIG, Tech. Univ. of Graz, Austria", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; collinear WVDs; computation theory; computational geometry; computer metatheory; computer programming --- Algorithms; Euclidean plane; geometric interpretation; optimal algorithm; theory; upper bounds; verification; weighted points; weighted Voronoi diagram", pubcountry = "Netherlands A03", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations \\ G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous", treatment = "T Theoretical or Mathematical", } @Article{Carpi:1986:SWP, author = "Arturo Carpi and Aldo {De Luca}", title = "Square-free words of partially commutative free monoids", journal = j-INFO-PROC-LETT, volume = "22", number = "3", pages = "125--131", day = "3", month = mar, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q45 (20M05 20M35)", MRnumber = "87g:68035", MRreviewer = "Andr{\'e} Lentin", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Rome, Rome, Italy", annote = "Cannot tell if second author name is `de Luca' or `De Luca'; title and author on first page are all caps, and index has `De Luca, A.'.", classification = "721; C4290 (Other computer theory)", corpsource = "Inst. of Fundamental Math., Rome Univ., Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; computational linguistics; decidability; Formal Languages; languages; partially commutative free monoids; square-free elements; square-free words; theory; verification", pubcountry = "Netherlands A04", subject = "G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous \\ F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Algebraic language theory", treatment = "T Theoretical or Mathematical", } @Article{Hattori:1986:NGS, author = "Yoshio Hattori", title = "Nonisomorphic graphs with the same {$T$}-polynomial", journal = j-INFO-PROC-LETT, volume = "22", number = "3", pages = "133--134", day = "3", month = mar, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "05C50 (15A15)", MRnumber = "87g:05157", MRreviewer = "E. J. Farrell", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Kyoto Univ, Kyoto, Jpn", classification = "921; C1160 (Combinatorial mathematics)", corpsource = "Inst. of Atomic Energy, Kyoto Univ., Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Graph Theory; graph theory; graphs; mathematical techniques; nonisomorphic graphs; spanning trees; t-polynomial; T-polynomial; theory; undirected graph", pubcountry = "Netherlands A05", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory", treatment = "T Theoretical or Mathematical", } @Article{Gire:1986:TDP, author = "F. Gire", title = "Two decidability problems for infinite words", journal = j-INFO-PROC-LETT, volume = "22", number = "3", pages = "135--140", day = "3", month = mar, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q45 (03D05)", MRnumber = "87f:68044", MRreviewer = "Karel Culik II", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "LITP, Paris, Fr", classification = "721; C4210 (Formal logic); C4290 (Other computer theory)", corpsource = "LITP, Paris 7 Univ., France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; computational linguistics; decidability; decidability problems; emptiness problem; Formal Languages; infinitary language; infinitary rational relation; infinite words; languages; omega-equality set; omega-post correspondence problem; post correspondence problem; theory; verification", pubcountry = "Netherlands A06", subject = "F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Algebraic language theory", treatment = "T Theoretical or Mathematical", } @Article{Hughes:1986:NRL, author = "R. John Muir Hughes", title = "A Novel Representation of Lists and its Application to the Function `Reverse'", journal = j-INFO-PROC-LETT, volume = "22", number = "3", pages = "141--144", day = "3", month = mar, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Chalmers Technical Univ, Goteborg, Swed", classification = "723; C6130 (Data handling techniques)", corpsource = "Inst. for Dataprocessing, Chalmers Tech. Univ., Goteborg, Sweden", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer programming; data processing; data representation; Data Structures; first-class functions; functional programming; list processing; naive reverse; program transformation; programming; reverse function; theory", pubcountry = "Netherlands A07", subject = "D.1.m Software, PROGRAMMING TECHNIQUES, Miscellaneous \\ E.1 Data, DATA STRUCTURES, Lists \\ I.1.1 Computing Methodologies, ALGEBRAIC MANIPULATION, Expressions and Their Representation, Representations (General and Polynomial)", treatment = "P Practical", } @Article{Schwer:1986:RPN, author = "Sylvianne R. Schwer", title = "On the rationality of {Petri} net languages", journal = j-INFO-PROC-LETT, volume = "22", number = "3", pages = "145--146", day = "3", month = mar, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q45 (68Q90)", MRnumber = "87f:68051", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "CNRS, Talence, Fr", classification = "721; C1160 (Combinatorial mathematics)", corpsource = "Bordeaux 1 Univ., Talence, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; graph theory; languages; Petri net; Petri net languages; pumping lemma; rationality; theory; verification", pubcountry = "Netherlands A08", subject = "F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Unbounded-action devices \\ F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Algebraic language theory", treatment = "T Theoretical or Mathematical", } @Article{Chen:1986:SCD, author = "Lin Chen", title = "{$O(1)$} space complexity deletion for {AVL} trees", journal = j-INFO-PROC-LETT, volume = "22", number = "3", pages = "147--149", day = "3", month = mar, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Fudan Univ, Shanghai, China", classification = "723; 921; C1160 (Combinatorial mathematics); C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Fudan Univ., Shanghai, China", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithmic complexity; Algorithms; algorithms; AVL trees; binary search tree; computational complexity; computer metatheory; computer programming; data structures; mathematical techniques --- Trees; node deletion; space complexity; space complexity deletion; theory; trees (mathematics)", pubcountry = "Netherlands A09", subject = "I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms \\ E.1 Data, DATA STRUCTURES, Trees", treatment = "T Theoretical or Mathematical", } @Article{Cockayne:1986:ECS, author = "E. J. Cockayne and D. E. Hewgill", title = "Exact computation of {Steiner} Minimal Trees in the plane", journal = j-INFO-PROC-LETT, volume = "22", number = "3", pages = "151--156", day = "3", month = mar, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q20 (05C05 68Q25 68R10)", MRnumber = "87m:68027", MRreviewer = "D. T. Lee", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Victoria, Victoria, BC, Can", classification = "723; 921; C1160 (Combinatorial mathematics); C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Math., Victoria Univ., BC, Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; computability; computational complexity; computer programming; mathematical techniques --- Trees; Steiner minimal tree; Steiner Minimal Trees; Steiner points; theory; trees (mathematics); verification", pubcountry = "Netherlands A10", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees", treatment = "T Theoretical or Mathematical", } @Article{Shock:1986:CMC, author = "Robert C. Shock", title = "Computing the minimum cover of functional dependencies", journal = j-INFO-PROC-LETT, volume = "22", number = "3", pages = "157--159", day = "3", month = mar, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Wright State Univ, Dayton, OH, USA", classification = "723; C4240 (Programming and algorithm theory); C4250 (Database theory)", corpsource = "Dept. of Comput. Sci., Wright State Univ., Dayton, OH, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; computability; computer programming --- Algorithms; database systems; database theory; functional dependencies; minimum cover; nonredundant cover; Relational; theory; verification", pubcountry = "Netherlands A11", subject = "G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous", treatment = "T Theoretical or Mathematical", } @Article{Kallay:1986:CHM, author = "Michael Kallay", title = "Convex hull made easy", journal = j-INFO-PROC-LETT, volume = "22", number = "3", pages = "161--161", day = "3", month = mar, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Israel Aircraft Industries Ltd, Isr", classification = "921; C1180 (Optimisation techniques)", corpsource = "Div. of Eng., Israel Aircraft Ind. Ltd., Israel", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "convex hull; linear program; linear programming; linear-time preprocessing; mathematical programming, linear; theory; verification", pubcountry = "Netherlands A12", subject = "G.1.6 Mathematics of Computing, NUMERICAL ANALYSIS, Optimization, Linear programming", treatment = "T Theoretical or Mathematical", } @Article{Jaumard:1986:EAT, author = "Brigitte Jaumard and Michel Minoux", title = "An Efficient Algorithm for the Transitive Closure and a Linear Worst-Case Complexity Result for a Class of Sparse Graphs", journal = j-INFO-PROC-LETT, volume = "22", number = "4", pages = "163--169", day = "17", month = apr, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (05-04 68R10)", MRnumber = "87g:68025", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Rutgers State Univ of New Jersey, New Brunswick, NJ, USA", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Hill Center for the Math. Sci., Rutgers State Univ. of New Jersey, New Brunswick, NJ, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; arcs; circuit-free graph; complexity of algorithms; computational complexity; computer programming; computer programming languages --- List Processing; data processing --- Data Structures; data structures; directed graph; efficient algorithm; graph theory; in-degrees; linear worst-case complexity result; list processing; low density circuitless graphs; low density graphs; mathematical techniques --- Graph Theory; sparse graphs; theory; transitive closure; transitive closure of A graph; vertices", pubcountry = "Netherlands A01", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory \\ F.1.3 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes", treatment = "T Theoretical or Mathematical", } @Article{Keil:1986:TDI, author = "J. Mark Keil", title = "Total domination in interval graphs", journal = j-INFO-PROC-LETT, volume = "22", number = "4", pages = "171--174", day = "17", month = apr, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Saskatchewan, Saskatoon, Sask, Can", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Saskatchewan Univ., Sask., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; complexity of algorithm; computational complexity; computer programming; graph theory; intersection graph; interval graph; interval graphs; linear algorithm; mathematical techniques --- Graph Theory; one-to-one correspondence; theory; total domination problem; verification; vertices", pubcountry = "Netherlands A02", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms", treatment = "T Theoretical or Mathematical", } @Article{Panny:1986:NHM, author = "Wolfgang Panny", title = "A note on the higher moments of the expected behavior of straight insertion sort", journal = j-INFO-PROC-LETT, volume = "22", number = "4", pages = "175--177", day = "17", month = apr, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Wirtschaftsuniversitaet Wien, Vienna, Austria", classification = "723; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Abteilung for Math. Methoden der Stat., Wirtschaftsuniv. Wien, Austria", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm analysis; algorithm theory; algorithms; analysis of algorithms; asymptotic behaviour; computer programming --- Algorithms; computer systems programming; higher moments; insertion sort; inversions; permutations; random variable; runtime; RV; Sorting; sorting; sorting algorithms; straight insertion sort; theory", pubcountry = "Netherlands A03", subject = "G.4 Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm analysis \\ I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms \\ G.2.1 Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics, Permutations and combinations \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching", treatment = "T Theoretical or Mathematical", } @Article{Hamburg:1986:TTV, author = "Mark C. Hamburg", title = "Two Tagless Variations on the {Deutsch--Schorr--Waite} Algorithm", journal = j-INFO-PROC-LETT, volume = "22", number = "4", pages = "179--183", day = "17", month = apr, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Michigan, Ann Arbor, MI, USA", classification = "723; 921; C1160 (Combinatorial mathematics); C6120 (File organisation)", corpsource = "Michigan Univ., Ann Arbor, MI, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; computer programming; computer programming languages --- List Processing; data management; data processing --- Data Structures; data structures; Deutsch--Schorr--Waite algorithm; Deutsch-Schorr-Wait algorithm; directed graphs; list processing; loop invariants; mathematical techniques --- Graph Theory; storage management; tag bit; tag-free marking algorithms; theory", pubcountry = "Netherlands A04", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms \\ G.4 Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm analysis \\ I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms", treatment = "T Theoretical or Mathematical", } @Article{Loui:1986:ECN, author = "Michael C. Loui and Teresa A. Matsushita and Douglas B. West", title = "Election in a Complete Network with a Sense of Direction", journal = j-INFO-PROC-LETT, volume = "22", number = "4", pages = "185--187", day = "17", month = apr, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See corrigendum \cite{Loui:1988:CEC}.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Illinois at Urbana-Champaign, Urbana, IL, USA", classification = "718; 722; 723; C1140E (Game theory); C1160 (Combinatorial mathematics)", corpsource = "Coll. of Eng., Illinois Univ., Urbana, IL, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; asynchronous processors; bidirectional link; communication complexity; complete network; computer networks; computer programming --- Algorithms; computer systems, digital --- Distributed; computers, digital --- Data Communication Systems; decision theory; distributed algorithm; distributed algorithms; Electron Problem; graph theory; Hamiltonian cycle; message complexity; sense of direction; theory", pubcountry = "Netherlands A05", subject = "F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Unbounded-action devices \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Network problems", treatment = "T Theoretical or Mathematical", } @Article{Carlsson:1986:SFS, author = "Svante Carlsson", title = "{{\sc Splitmerge}}: a fast stable merging algorithm", journal = j-INFO-PROC-LETT, volume = "22", number = "4", pages = "189--192", day = "17", month = apr, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Lund Univ, Lund, Swed", classification = "723; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Lund Univ., Sweden", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm analysis; algorithms; analysis of algorithms; average-case behaviour; computational complexity; computer programming --- Algorithms; computer systems programming; Merging; merging; merging algorithm; ordered lists; SPLITMERG; stable merging; stable merging algorithms; stable way; theory; worst-case behaviour", pubcountry = "Netherlands A06", subject = "G.4 Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm analysis \\ I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching", treatment = "T Theoretical or Mathematical", } @Article{Codenotti:1986:NVC, author = "B. Codenotti and G. Lotti", title = "A note on the {VLSI} counter", journal = j-INFO-PROC-LETT, volume = "22", number = "4", pages = "193--195", day = "17", month = apr, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Istituto di Elaborazione dell'Informazione, Pisa, Italy", classification = "713; 714; B1265B (Logic circuits); B2570 (Semiconductor integrated circuits); C4240 (Programming and algorithm theory)", corpsource = "Istituto di Elaborazione, Pisa, Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "area-time complexity; area-time complexity of VLSI circuits; computational complexity; counting circuits; delay time; Design; design; electronic circuits, counting; integrated circuits, VLSI --- Design; lower bound; number of elements; parallel counter; theory; upper bound; VLSI; VLSI counter; VLSI model; VLSI network", pubcountry = "Netherlands A07", subject = "F.1.3 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes \\ C.5.4 Computer Systems Organization, COMPUTER SYSTEM IMPLEMENTATION, VLSI Systems", treatment = "T Theoretical or Mathematical", } @Article{Gajewska:1986:DHO, author = "Hania Gajewska and Robert E. Tarjan", title = "Deques with heap order", journal = j-INFO-PROC-LETT, volume = "22", number = "4", pages = "197--200", day = "17", month = apr, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "AT\&T Bell Lab, Murray Hill, NJ, USA", classification = "723; 922; C1140C (Queueing theory)", corpsource = "AT and T Bell Labs., Murray Hill, NJ, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "auxiliary heap; complexity of algorithms; computer programming --- Algorithms; data processing; Data Structures; data structures; deque; double-ended queue; heap order; priority queue; priority queues; probability --- Queueing Theory; queueing theory; real-valued key; theory; verification; worst-case time", pubcountry = "Netherlands A08", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching \\ E.4 Data, CODING AND INFORMATION THEORY, Data compaction and compression", treatment = "T Theoretical or Mathematical", } @Article{Richards:1986:DCG, author = "Dana Richards", title = "Data compression and {Gray}-code sorting", journal = j-INFO-PROC-LETT, volume = "22", number = "4", pages = "201--205", day = "17", month = apr, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Virginia, Charlottesville, VA, USA", classification = "723; 731; C1160 (Combinatorial mathematics); C6120 (File organisation)", corpsource = "Dept. of Comput. Sci., Virginia Univ., Charlottesville, VA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "codes, symbolic; comparison based sorting; comparison-based sorting; computer systems programming --- Sorting; data compression; data processing --- File Organization; differencing; full mixed-radix case; gray codes; Gray-code sorting; radix sorting; sorting; storage management; theory; verification", pubcountry = "Netherlands A09", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching \\ E.4 Data, CODING AND INFORMATION THEORY, Data compaction and compression", treatment = "T Theoretical or Mathematical", } @Article{Choi:1986:CQP, author = "Key-Sun S. Choi and Gil Chang Kim", title = "A Controlled Quantification in Parsing of {Montague} Grammar", journal = j-INFO-PROC-LETT, volume = "22", number = "4", pages = "207--216", day = "17", month = apr, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Korea Advanced Inst of Science \& Technology, Seoul, South Korea", classification = "721; 723; C4210 (Formal logic); C4290 (Other computer theory)", corpsource = "Dept. of Comput. Sci., Korea Adv. Inst. of Sci. and Technol., Seoul, South Korea", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; automata theory; Computational Linguistics; computational linguistics; computer programming --- Algorithms; context-free rule; controlled quantification; controlled semantic equivalence parsing; CSEP; English sentence; grammars; intensional logical formulas; languages; logical translation; Montague grammar; natural language processing; parsing; parsing algorithm; parsing algorithms; PTQ; syntactic rules; theory", pubcountry = "Netherlands A10", subject = "F.4.2 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems, Parsing", treatment = "T Theoretical or Mathematical", } @Article{Highnam:1986:OAF, author = "P. T. Highnam", title = "Optimal Algorithms for Finding the Symmetries of a Planar Point Set", journal = j-INFO-PROC-LETT, volume = "22", number = "5", pages = "219--222", day = "??", month = apr, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68U05", MRnumber = "87h:68144", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Carnegie-Mellon Univ, Pittsburgh, PA, USA", classification = "723; C4190 (Other numerical methods)", corpsource = "Dept. of Comput. Sci., Carnegie-Mellon Univ., Pittsburgh, PA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; asymptotically optimal algorithm; computational geometry; computer programming; linear pattern-matching; mirror symmetry; optimal algorithms; planar point set; rotational symmetries; string matching; symmetry; theory; verification", pubcountry = "Netherlands A01", subject = "G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations", treatment = "T Theoretical or Mathematical", } @Article{Pawagi:1986:APU, author = "Shaunak Pawagi and I. V. Ramakrishnan", title = "An {$O(\log n)$} algorithm for parallel update of minimum spanning trees", journal = j-INFO-PROC-LETT, volume = "22", number = "5", pages = "223--229", day = "??", month = apr, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (05C05 68R10 90B10)", MRnumber = "87h:68072", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Maryland, College Park, MD, USA", classification = "723; 921; B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics)", corpsource = "Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; computer programming --- Algorithms; computer systems, digital --- Parallel Processing; graph algorithms; Graph Theory; graph theory; mathematical techniques; minimum spanning trees; O(log n) algorithm; parallel algorithms; parallel processing; parallel random access machine; parallel update; theory; trees (mathematics); verification", pubcountry = "Netherlands A02", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms \\ G.1.0 Mathematics of Computing, NUMERICAL ANALYSIS, General, Parallel algorithms", treatment = "T Theoretical or Mathematical", } @Article{Li:1986:SMC, author = "Ming Li and Yaacov Yesha", editor = "G. R. Andrews", title = "String-Matching Cannot Be Done by a Two-Head One-Way Deterministic Finite Automaton", journal = j-INFO-PROC-LETT, volume = "22", number = "5", pages = "231--235", day = "??", month = apr, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q20", MRnumber = "87h:68058", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", series = "22", acknowledgement = ack-nhfb, affiliationaddress = "Cornell Univ, Ithaca, NY, USA", classification = "721; C4220 (Automata theory)", corpsource = "Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; finite automata; k-head finite automata; Kolmogorov complexity; lower bounds; string-matching; theory; Turning machine; two-head one-way deterministic finite automaton; verification", pubcountry = "Netherlands A03", subject = "F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Automata \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching", treatment = "T Theoretical or Mathematical", } @Article{Evans:1986:ETS, author = "John B. Evans", title = "Experiments with Trees for the Storage and Retrieval of Future Events", journal = j-INFO-PROC-LETT, volume = "22", number = "5", pages = "237--242", day = "??", month = apr, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Hong Kong, Hong Kong", classification = "723; 921; C1160 (Combinatorial mathematics); C6120 (File organisation); C6130 (Data handling techniques)", corpsource = "Centre of Comput. Studies and Applications, Hong Kong Univ., Hong Kong", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer programming --- Algorithms; computer simulation; data handling; data processing; Data Structures; data structures; discrete event simulation; discrete-event simulation; event scheduling; events retrieval; events storage; experimentation; mathematical techniques --- Trees; theory; tree-balancing; trees; trees (mathematics)", pubcountry = "Netherlands A04", subject = "I.6.1 Computing Methodologies, SIMULATION AND MODELING, Simulation Theory, Types of simulation (continuous and discrete) \\ I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms \\ I.2.8 Computing Methodologies, ARTIFICIAL INTELLIGENCE, Problem Solving, Control Methods, and Search, Graph and tree search strategies", treatment = "T Theoretical or Mathematical", } @Article{Gupta:1986:ASU, author = "G. K. Gupta and B. Srinivasan", title = "Approximate storage utilization of {$B$}-trees", journal = j-INFO-PROC-LETT, volume = "22", number = "5", pages = "243--246", day = "??", month = apr, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Monash Univ, Clayton, Aust", classification = "723; 921; C1160 (Combinatorial mathematics); C6120 (File organisation)", corpsource = "Dept. of Comput. Sci., Monash Univ., Clayton, Vic., Australia", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "approximate storage utilisation; b-trees; B-trees; data processing; Data Structures; data structures; mathematical techniques --- Trees; storage management; storage utilization; theory; trees (mathematics)", pubcountry = "Netherlands A05", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees", treatment = "T Theoretical or Mathematical", } @Article{Bourret:1986:LUB, author = "Paul Bourret and R. {Souza de Oliveira}", title = "Lower and upper bounds of the sizes of domains: estimates and experiments", journal = j-INFO-PROC-LETT, volume = "22", number = "5", pages = "247--253", day = "??", month = apr, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "ONERA, Toulouse, Fr", classification = "723; 922; C6160D (Relational databases)", corpsource = "ONERA, Centre d'Etudes et de Recherches en Inf., Toulouse, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "database systems; domain size; estimates computation; experimentation; lower bounds; Relational; relational databases; statistical method; statistical methods; theory; upper bounds", pubcountry = "Netherlands A06", subject = "H.2.m Information Systems, DATABASE MANAGEMENT, Miscellaneous \\ G.3 Mathematics of Computing, PROBABILITY AND STATISTICS", treatment = "T Theoretical or Mathematical", } @Article{Bernstein:1986:DSC, author = "Herbert J. Bernstein", title = "Determining the shape of a convex $n$-sided polygon by using $2n+k$ tactile probes", journal = j-INFO-PROC-LETT, volume = "22", number = "5", pages = "255--260", day = "??", month = apr, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68U05 (68Q20)", MRnumber = "87h:68141", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "New York Univ, New York, NY, USA", classification = "723; C4190 (Other numerical methods); C4240 (Programming and algorithm theory)", corpsource = "Courant Inst. of Math. Sci., New York Univ., NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; computational complexity; computational geometry; computer programming --- Algorithms; computer vision; convex n-sided polygon; convex polygons; design; robotics; tactile probes; theory; verification", pubcountry = "Netherlands A07", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations \\ I.2.9 Computing Methodologies, ARTIFICIAL INTELLIGENCE, Robotics, Sensors", treatment = "T Theoretical or Mathematical", } @Article{Keller:1986:STP, author = "Arthur M. Keller", title = "Set-Theoretic Problems of Null Completion in Relational Databases", journal = j-INFO-PROC-LETT, volume = "22", number = "5", pages = "261--265", day = "??", month = apr, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68P15", MRnumber = "87h:68026", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", abstract = "When considering using databases to represent information, the relationship between two facts where one may imply the other needs to be addressed. In relational databases, this question becomes whether null completion is assumed. That is, does a (possibly partially-defined) tuple imply the existence of tuples that are ``less informative'' than the original tuple. We show that no relational algebra, that assumes equivalence under null completion, can include set-theoretic operators that are compatible with ordinary set theory. Thus, the approach of x-relations is incompatible with the axioms of a boolean algebra.", acknowledgement = ack-nhfb, affiliationaddress = "Stanford Univ, Stanford, CA, USA", classification = "723; 921; C1160 (Combinatorial mathematics); C6160D (Relational databases)", corpsource = "Dept. of Comput. Sci., Stanford Univ., CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Boolean algebra; database systems; incomplete information; mathematical techniques --- Set Theory; null completion; null values; Relational; relational databases; set theory; set-theoretic operators; theory; verification; x-relation", pubcountry = "Netherlands A08", subject = "G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous \\ H.2.m Information Systems, DATABASE MANAGEMENT, Miscellaneous \\ H.2.1 Information Systems, DATABASE MANAGEMENT, Logical Design", treatment = "T Theoretical or Mathematical", } @Article{Manolopoulos:1986:BSI, author = "Yannis Manolopoulos", title = "Batched Search of Index Sequential Files", journal = j-INFO-PROC-LETT, volume = "22", number = "5", pages = "267--272", day = "??", month = apr, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Thessaloniki, Thessaloniki, Greece", classification = "723; 903; C6160 (Database management systems (DBMS))", corpsource = "Dept. of Electr. Eng., Thessaloniki Univ., Greece", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "batched search; database management systems; database systems; index sequential files; information retrieval systems --- Online Searching; on-line search; Performance; performance; query; theory; verification", pubcountry = "Netherlands A09", subject = "H.2.m Information Systems, DATABASE MANAGEMENT, Miscellaneous \\ H.3.3 Information Systems, INFORMATION STORAGE AND RETRIEVAL, Information Search and Retrieval, Search process \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Pattern matching", treatment = "P Practical", } @Article{Alanko:1986:CCT, author = "Timo O. Alanko and R. L. Smelianski", title = "On the calculation of control transition probabilities in a program", journal = j-INFO-PROC-LETT, volume = "22", number = "5", pages = "273--276", day = "??", month = apr, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Helsinki, Helsinki, Finl", classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Helsinki Univ., Finland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer metatheory --- Programming Theory; computer programming; control transition probabilities; control-flow analysis; control-flow graph; program behavior; program behaviour; programming theory; Theory; theory", pubcountry = "Netherlands A10", subject = "F.3.3 Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs", treatment = "T Theoretical or Mathematical", } @Article{Lickteig:1986:GEO, author = "Thomas Lickteig", title = "{Gaussian} elimination is optimal for solving linear equations in dimension two", journal = j-INFO-PROC-LETT, volume = "22", number = "6", pages = "277--279", day = "30", month = may, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "65F10 (12-04 68Q25)", MRnumber = "87k:65040", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ T{\"u}bingen, T{\"u}bingen, West Ger", classification = "723; 921; C4140 (Linear algebra); C4240 (Programming and algorithm theory)", corpsource = "Math. Inst., T{\"u}bingen Univ., West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computational complexity; dimension two; Gaussian elimination; linear equations; mathematical programming; mathematical techniques; matrix algebra; matrix operations; straight-line programs; theory; verification", pubcountry = "Netherlands A01", subject = "F.2.1 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Computations on matrices \\ F.1.3 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Reducibility and completeness", treatment = "T Theoretical or Mathematical", } @Article{Hanatani:1986:SCD, author = "Yoshito Hanatani and Ronald Fagin", title = "A Simple Characterization of Database Dependency Implication", journal = j-INFO-PROC-LETT, volume = "22", number = "6", pages = "281--283", day = "30", month = may, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68P15", MRnumber = "87h:68025", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ de Paris-Sud, Orsay, Fr", classification = "723; C4250 (Database theory)", corpsource = "Lab. de Recherche en Inf., Univ. de Paris-Sud, Orsay, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "database dependency implication; database systems; database theory; functional dependency; logical implication; multivalued dependency; Relational; relational database; relational databases; set-theoretic characterization; theory; verification", pubcountry = "Netherlands A02", subject = "H.2.m Information Systems, DATABASE MANAGEMENT, Miscellaneous \\ G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous", treatment = "T Theoretical or Mathematical", } @Article{Parberry:1986:RRI, author = "Ian Parberry", title = "On recurrent and recursive interconnection patterns", journal = j-INFO-PROC-LETT, volume = "22", number = "6", pages = "285--289", day = "30", month = may, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q35 (68R10)", MRnumber = "87h:68078", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Pennsylvania State Univ, University Park, PA, USA", classification = "722; 723; 921; C4220 (Automata theory); C5440 (Multiprocessing systems)", corpsource = "Dept. of Comput. Sci., Pennsylvania State Univ., University Park, PA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; computer systems, digital; cube-connected cycles; finite automata; graph theory; mathematical techniques --- Graph Theory; Parallel Processing; parallel processing; recurrent interconnection pattern; recurrent interconnection patterns; recursive interconnection patterns; shuffle-exchange; synchronous parallel computers; theory; trivalent graphs; verification", pubcountry = "Netherlands A03", subject = "F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms", treatment = "T Theoretical or Mathematical", } @Article{Gusfield:1986:EAA, author = "Dan Gusfield and Leonard Pitt", title = "Equivalent approximation algorithms for node cover", journal = j-INFO-PROC-LETT, volume = "22", number = "6", pages = "291--294", day = "30", month = may, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q20 (05-04 05C70 68R10)", MRnumber = "87m:68029", MRreviewer = "Mukkai S. Krishnamoorthy", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Yale Univ, New Haven, CT, USA", classification = "723; 921; C1160 (Combinatorial mathematics)", corpsource = "Dept. of Comput. Sci., Yale Univ., New Haven, CT, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; computer programming; equivalent approximation algorithms; graph theory; heuristic approach; linear time factor-of-two approximation algorithm; mathematical techniques --- Graph Theory; node cover; node cover problem; theory; undirected graph; verification", pubcountry = "Netherlands A04", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms \\ G.1.2 Mathematics of Computing, NUMERICAL ANALYSIS, Approximation", treatment = "T Theoretical or Mathematical", } @Article{Aizawa:1986:DIA, author = "Kunio Aizawa and Akira Nakamura", title = "Direction-independent application of productions on two-dimensional arrays", journal = j-INFO-PROC-LETT, volume = "22", number = "6", pages = "295--301", day = "30", month = may, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q50", MRnumber = "88a:68068", MRreviewer = "Rani Siromoney", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Hiroshima Univ, Higashi-Hiroshima, Jpn", classification = "721; C4210 (Formal logic); C4220 (Automata theory)", corpsource = "Dept. of Appl. Math., Hiroshima Univ., Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "array grammars; automata theory; context free grammars; context-free grammars; direction-independent 2-D grammars; direction-independent grammars; finite automata; generative powers; Grammars; graph grammars; languages; parallel grammars; parallel processing; production rule; productions; theory; two-dimensional arrays; verification", pubcountry = "Netherlands A05", subject = "F.4.2 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems, Grammar types \\ F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Classes defined by grammars or automata", treatment = "T Theoretical or Mathematical", } @Article{Dehne:1986:AME, author = "Frank Dehne", title = "{$O(n^{1/2})$} algorithms for the maximal elements and {ECDF} searching problem on a mesh-connected parallel computer", journal = j-INFO-PROC-LETT, volume = "22", number = "6", pages = "303--306", day = "30", month = may, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Wuerzburg, Wuerzburg, West Ger", classification = "722; 723; C4190 (Other numerical methods); C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "Lehrstuhl f{\"u}r Inf. I, Wurzburg Univ., West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; computational complexity; computational geometry; computer programming; computers, digital --- Parallel Processing; ECDF searching; ECDF searching problem; Euclidean plane; finite automata; mech-connected parallel computer; mesh-connected parallel computer; parallel algorithms; parallel complexity; parallel processing; theory; verification", pubcountry = "Netherlands A06", subject = "G.1.0 Mathematics of Computing, NUMERICAL ANALYSIS, General, Parallel algorithms \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching", treatment = "T Theoretical or Mathematical", } @Article{Apt:1986:LAV, author = "Krzysztof R. Apt and Dexter C. Kozen", title = "Limits for automatic verification of finite-state concurrent systems", journal = j-INFO-PROC-LETT, volume = "22", number = "6", pages = "307--309", day = "30", month = may, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q10 (03B70)", MRnumber = "87m:68018", MRreviewer = "L{\'a}szl{\'o} Csirmaz", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "IBM, Thomas J. Watson Research Cent, Yorktown Heights, NY, USA", classification = "723; C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automatic verification; computer metatheory --- Programming Theory; computer programming; finite automata; finite-state concurrent program; finite-state concurrent systems; logics of programs; parallel processing; program correctness; program verification; programming theory; schematic programs; Theory; theory; verification", pubcountry = "Netherlands A07", subject = "D.2.4 Software, SOFTWARE ENGINEERING, Program Verification \\ F.3.1 Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs, Logics of programs \\ F.3.1 Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs, Mechanical verification \\ D.4.1 Software, OPERATING SYSTEMS, Process Management, Concurrency", treatment = "T Theoretical or Mathematical", } @Article{Arora:1986:DTD, author = "R. K. Arora and S. P. Rana and M. N. Gupta", title = "Distributed termination detection algorithm for distributed computations", journal = j-INFO-PROC-LETT, volume = "22", number = "6", pages = "311--314", day = "30", month = may, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q10", MRnumber = "87j:68034a", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See also comments \cite{Tan:1986:CDT,Arora:1988:MCD}.", acknowledgement = ack-nhfb, affiliationaddress = "Indian Inst of Technology, Hauz Khas, India", classification = "722; 723; C4240 (Programming and algorithm theory); C5620 (Computer networks and techniques)", corpsource = "Dept. of Comput. Sci. and Engng., Indian Inst. of Technol., New Delhi, India", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; computer programming; computer systems, digital --- Distributed; correctness arguments; detection algorithm; distributed computations; distributed processing; distributed program; distributed termination; distributed termination detection; programming theory; symmetric algorithm; theory; verification", pubcountry = "Netherlands A08", subject = "D.4.4 Software, OPERATING SYSTEMS, Communications Management \\ D.4.7 Software, OPERATING SYSTEMS, Organization and Design, Distributed systems \\ H.2.4 Information Systems, DATABASE MANAGEMENT, Systems, Distributed systems", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Sattolo:1986:AGR, author = "Sandra Sattolo", title = "An Algorithm to Generate a Random Cyclic Permutation", journal = j-INFO-PROC-LETT, volume = "22", number = "6", pages = "315--317", day = "30", month = may, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q20 (05-04 05A05 68R05)", MRnumber = "87g:68022", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ di Udine, Udine, Italy", classification = "723; 922; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Istituto di Matematica, Udine Univ., Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm correctness; algorithms; Algorithms; chi-square distribution test; combinational problems; combinatorial mathematics; complexity; computational complexity; computer programming; probability --- Random Processes; random cyclic permutation; theory; verification", pubcountry = "Netherlands A09", subject = "G.2.1 Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics, Combinatorial algorithms", treatment = "T Theoretical or Mathematical", } @Article{Leiss:1986:HVB, author = "Ernst L. Leiss and Chamaiporn Jitmedha", title = "Horizontally and vertically bounded propagation of privileges", journal = j-INFO-PROC-LETT, volume = "22", number = "6", pages = "319--327", day = "30", month = may, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Houston, Houston, TX, USA", classification = "723; C4250 (Database theory); C6160 (Database management systems (DBMS))", corpsource = "Dept. of Comput. Sci., Houston Univ., TX, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; authorization systems; bounded propagation of privileges; data processing --- Security of Data; database management systems; database systems; database theory; horizontal bounds; security of data; theory; vertical bounds", pubcountry = "Netherlands A10", subject = "H.2.0 Information Systems, DATABASE MANAGEMENT, General, Security, integrity, and protection \\ D.4.6 Software, OPERATING SYSTEMS, Security and Protection", treatment = "T Theoretical or Mathematical", } @Article{Takaoka:1986:OPM, author = "Tadao Takaoka", title = "An On-Line Pattern Matching Algorithm", journal = j-INFO-PROC-LETT, volume = "22", number = "6", pages = "329--330", day = "30", month = may, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Ibaraki, Hitachi, Jpn", classification = "723; C6130 (Data handling techniques)", corpsource = "Dept. of Inf. Sci., Ibaraki Univ., Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; computer programming; data handling; on-line editor; on-line pattern matching algorithm; pattern input; pattern matching algorithm; reading input symbols; response time; text editor; text editors; theory", pubcountry = "Netherlands A11", subject = "I.7.1 Computing Methodologies, TEXT PROCESSING, Text Editing \\ I.5.4 Computing Methodologies, PATTERN RECOGNITION, Applications, Computer vision", treatment = "G General Review", } @Article{Rytter:1986:SCU, author = "Wojciech Rytter", title = "The Space Complexity of the Unique Decipherability Problem", journal = j-INFO-PROC-LETT, volume = "23", number = "1", pages = "1--3", day = "20", month = jul, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Salerno, Italy", classification = "723; C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Inst. of Inf., Warsaw Univ., Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; alphabet; code-set; codewords; computational complexity; computer metatheory; decomposition; formal languages; graph accessibility problem; languages; nonunique decipherability; space complexity; theory; unique decipherability problem; uniquely decipherable; verification", pubcountry = "Netherlands A01", subject = "F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Automata \\ F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Algebraic language theory \\ D.3.3 Software, PROGRAMMING LANGUAGES, Language Constructs, Abstract data types", treatment = "T Theoretical or Mathematical", } @Article{Lin:1986:LEL, author = "Ferng-Ching Lin and Wei Kuan Shih", title = "Long edges in the layouts of shuffle-exchange and cube-connected cycles graphs", journal = j-INFO-PROC-LETT, volume = "23", number = "1", pages = "5--9", day = "20", month = jul, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68R10", MRnumber = "87i:68061", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Natl Taiwan Univ, Taipei, Taiwan", classification = "714; 723; 921; B1130B (Computer-aided circuit analysis and design); C4210 (Formal logic); C7410D (Electronic engineering computing)", corpsource = "Dept. of Comput. Sci. and Inf. Eng., Nat. Taiwan Univ., Taipei, Taiwan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "circuit layout CAD; Computer Aided Design; cube-connected cycles; cube-connected cycles graphs; graph layout; graph theory; integrated circuits, VLSI; layouts; mathematical techniques --- Graph Theory; shuffle exchange cycles graphs; shuffle-exchange; theory; verification; VLSI; VLSI layout", pubcountry = "Netherlands A02", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Routing and layout \\ C.5.4 Computer Systems Organization, COMPUTER SYSTEM IMPLEMENTATION, VLSI Systems", treatment = "T Theoretical or Mathematical", } @Article{Tinhofer:1986:BSS, author = "G. Tinhofer and H. Schreck", title = "The Bounded Subset Sum Problem is Almost Everywhere Randomly Decidable in {$O(N)$}", journal = j-INFO-PROC-LETT, volume = "23", number = "1", pages = "11--17", day = "20", month = jul, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Technische Univ M{\"u}nchen, Munich, West Ger", classification = "723; 921; C4210 (Formal logic)", corpsource = "Inst. f{\"u}r Math., Tech. Univ. Munchen, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; bounded subset sum problem; computer programming --- Algorithms; decidability; dynamic programming; dynamic programming algorithm; general knapsack problems; mathematical programming; probabilistic algorithm; randomised greedy algorithm; verification", pubcountry = "Netherlands A03", subject = "G.3 Mathematics of Computing, PROBABILITY AND STATISTICS, Probabilistic algorithms (including Monte Carlo)", treatment = "T Theoretical or Mathematical", } @Article{Schmeck:1986:MEL, author = "Hartmut Schmeck", title = "On the maximum edge length in {VLSI} layouts of complete binary trees", journal = j-INFO-PROC-LETT, volume = "23", number = "1", pages = "19--23", day = "20", month = jul, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Christian-Albrechts-Univ, Kiel, West Ger", classification = "714; 723; 921; B0250 (Combinatorial mathematics); B1130B (Computer-aided circuit analysis and design); B2570 (Semiconductor integrated circuits); C1160 (Combinatorial mathematics); C7410D (Electronic engineering computing)", corpsource = "Inst. f{\"u}r Inf. und Praktische Math., Christian-Albrechts-Univ., Kiel, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "asymptotically optimal layout; circuit layout CAD; complete binary trees; Computer Aided Design; computer programming --- Algorithms; H-tree layout; integrated circuits, VLSI; mathematical techniques --- Trees; maximum edge length; theory; trees (mathematics); verification; VLSI; VLSI layouts", pubcountry = "Netherlands A04", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Routing and layout \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees \\ B.7.2 Hardware, INTEGRATED CIRCUITS, Design Aids, Layout", treatment = "T Theoretical or Mathematical", } @Article{Balcazar:1986:I, author = "Jos{\'e} L. Balc{\'a}zar", title = "On {$\Delta^{\rm P}_2$}-immunity", journal = j-INFO-PROC-LETT, volume = "23", number = "1", pages = "25--28", day = "20", month = jul, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q15 (03D15)", MRnumber = "87i:68024", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ Politecnica de Cataluna, Barcelona, Spain", classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Fac. de Inf., Univ. Politecnica de Cataluna, Barcelona, Spain", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "complexity; complexity classes; computational complexity; computer metatheory; Delta /sub 2//sup P/-immunity; immune sets; polynomial-time hierarchy; set theory; theory; verification", pubcountry = "Netherlands A05", subject = "F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Relativized computation", treatment = "T Theoretical or Mathematical", } @Article{Culik:1986:NEP, author = "Karel {Culik, II} and Juhani Karhum{\"a}ki", title = "A Note on the Equivalence Problem of Rational Formal Power Series", journal = j-INFO-PROC-LETT, volume = "23", number = "1", pages = "29--31", day = "20", month = jul, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q70 (03D35 16A78)", MRnumber = "88b:68138", MRreviewer = "Dani{\`e}le Beauquier", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Waterloo, Waterloo, Ont, Can", classification = "723; C4220 (Automata theory)", corpsource = "Dept. of Comput. Sci., Waterloo Univ., Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; communicative semiring; computer metatheory; decidability; equality theorem; equivalence problem; K-Sigma-automata; languages; rational formal power series; theory; verification", pubcountry = "Netherlands A06", subject = "F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Algebraic language theory \\ F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Automata", treatment = "T Theoretical or Mathematical", } @Article{Kakuta:1986:PRC, author = "K. Kakuta and H. Nakamura and S. Iida", title = "A Parallel Reference Counting Algorithm", journal = j-INFO-PROC-LETT, volume = "23", number = "1", pages = "33--37", day = "20", month = jul, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Toyahashi Univ of Technology, Toyohashi, Jpn", classification = "722; 723; C4240 (Programming and algorithm theory)", corpsource = "Dept. of Inf. and Comput. Sci., Toyohashi Univ. of Technol., Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm theory; algorithms; Algorithms; computer programming; computer programming languages --- lisp; computer systems, digital --- Parallel Processing; garbage collection; languages; parallel processing; parallel reference counting algorithm; theory", pubcountry = "Netherlands A07", subject = "G.1.0 Mathematics of Computing, NUMERICAL ANALYSIS, General, Parallel algorithms \\ D.3.2 Software, PROGRAMMING LANGUAGES, Language Classifications, LISP", treatment = "T Theoretical or Mathematical", } @Article{Falkowski:1986:NQP, author = "Bernd-J{\"u}rgen J. Falkowski and Lothar Schmitz", title = "A Note on the Queens' Problem", journal = j-INFO-PROC-LETT, volume = "23", number = "1", pages = "39--46", day = "20", month = jul, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ der Bundeswehr M{\"u}nchen, West Ger", classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Fakultat f{\"u}r Inf., Munchen Univ., West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm theory; algorithms; Algorithms; computer programming; eight queens; queens' problem; theory; verification", pubcountry = "Netherlands A08", subject = "G.2.1 Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics, Permutations and combinations \\ G.2.1 Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics, Combinatorial algorithms", treatment = "T Theoretical or Mathematical", } @Article{Vikas:1986:DAA, author = "O. M. Vikas and Suresh Kumar Basandra", title = "Data algebra and its application in database design", journal = j-INFO-PROC-LETT, volume = "23", number = "1", pages = "47--54", day = "20", month = jul, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68P15", MRnumber = "87h:68028", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Indian Inst of Technology, Kanpur, India", classification = "723; C6120 (File organisation); C6160 (Database management systems (DBMS))", corpsource = "Dept. of Comput. Sci. and Eng., Indian Inst. of Technol., Kanpur, India", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "binary mappings; canonical form; data algebra; data items; data models; data structures; database design; database management systems; database systems; Design; design; hierarchical models; network models; relational models; theory", pubcountry = "Netherlands A09", subject = "H.2.1 Information Systems, DATABASE MANAGEMENT, Logical Design, Data models", treatment = "P Practical", } @Article{Lavallee:1986:FDM, author = "Ivan Lavall{\'e}e and G{\'e}rard Roucairol", title = "A Fully Distributed (Minimal) Spanning Tree Algorithm", journal = j-INFO-PROC-LETT, volume = "23", number = "2", pages = "55--62", day = "20", month = aug, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q20 (05C05 68R10)", MRnumber = "87k:68055", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ Paris-Sud, Orsay, Fr", classification = "722; 723; 921; C1160 (Combinatorial mathematics); C5620 (Computer networks and techniques)", corpsource = "LRI, Univ. Paris-Sud, Orsay, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; asynchronous distributed algorithm; communication; computer programming --- Algorithms; computer systems, digital --- Distributed; concurrency; connected undirected graph; cooperation; distributed algorithm; distributed network; distributed processing; edges; fully distributed spanning tree algorithm; Graph Theory; mathematical techniques; measurement; minimum spanning tree; minimum spanning tree algorithm; minimum-weighted spanning tree; nodes; performance; processes; theory; trees (mathematics)", pubcountry = "Netherlands A01", subject = "I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms", treatment = "T Theoretical or Mathematical", } @Article{Apostolico:1986:IWC, author = "Alberto Apostolico", title = "Improving the worst-case performance of the {Hunt-Szymanski} strategy for the longest common subsequence of two strings", journal = j-INFO-PROC-LETT, volume = "23", number = "2", pages = "63--69", day = "20", month = aug, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q20", MRnumber = "87j:68043", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Purdue Univ, West Lafayette, IN, USA", classification = "723; C4240 (Programming and algorithm theory); C6120 (File organisation)", corpsource = "Dept. of Comput. Sci., Purdue Univ., West Lafayette, IN, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "(a,b)-trees; Algorithms; algorithms; cardinality; computational complexity; computer programming; computer systems programming --- Merging; data processing --- Data Structures; data structures; design; dictionaries; dominant matches; finger-trees; Hunt-Szymanski algorithm; Hunt-Szymanski strategy; linear; linear lists; longest common subsequence; merging; minimal candidates; performance; primitive operations; strings; theory; time bound; verification; worst-case performance", pubcountry = "Netherlands A02", subject = "I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms \\ D.3.3 Software, PROGRAMMING LANGUAGES, Language Constructs, Data types and structures", treatment = "T Theoretical or Mathematical", } @Article{Rohnert:1986:SPP, author = "Hans Rohnert", title = "Shortest paths in the plane with convex polygonal obstacles", journal = j-INFO-PROC-LETT, volume = "23", number = "2", pages = "71--76", day = "20", month = aug, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68U05 (68Q25)", MRnumber = "87j:68106", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Saarbr{\"u}cken, Saarbr{\"u}cken, West Ger", classification = "723; 921; C4190 (Other numerical methods); C4240 (Programming and algorithm theory)", corpsource = "Saarbrucken Univ., West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; computational complexity; computational geometry; computer programming; convex polygonal obstacles; Euclidean plane; mathematical techniques --- Geometry; preprocessing time; query points; shortest paths; theory; verification; vertices", pubcountry = "Netherlands A03", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Path and circuit problems \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations", treatment = "T Theoretical or Mathematical", } @Article{Hoogerwoord:1986:IMI, author = "Rob R. Hoogerwoord", title = "An Implementation of Mutual Inclusion", journal = j-INFO-PROC-LETT, volume = "23", number = "2", pages = "77--80", day = "20", month = aug, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Eindhoven Univ of Technology, Eindhoven, Neth", classification = "722; 723; C6150J (Operating systems)", corpsource = "Dept. of Math., Eindhoven Univ. of Technol., Eindhoven, Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer metatheory --- Programming Theory; computer programming; computer systems, digital --- Parallel Processing; cyclic programs; deadlock; multiprocessing programs; mutual inclusion; parallel composition; semaphore operations; synchronisation; synchronization; theory; Theory; verification", pubcountry = "Netherlands A04", subject = "D.4.1 Software, OPERATING SYSTEMS, Process Management, Synchronization \\ D.2.4 Software, SOFTWARE ENGINEERING, Program Verification, Correctness proofs", treatment = "P Practical", } @Article{Rytter:1986:AMA, author = "Wojciech Rytter", title = "An Application of {Mehlhorn}'s Algorithm for Bracket Languages to {$\log(N)$} Space Recognition of Input-Driven Languages", journal = j-INFO-PROC-LETT, volume = "23", number = "2", pages = "81--84", day = "20", month = aug, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Warsaw Univ, Warsaw, Pol", classification = "721; 723; C4210 (Formal logic)", corpsource = "Inst. of Inf., Warsaw Univ., Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; automata theory; bracket languages; computer programming --- Algorithms; context-free languages; deterministic log(n) space; Formal Languages; idls; input-driven languages; languages; log(n) space recognition; Mehlhorn algorithm; Mehlhorn's algorithm; parse tree; pushdown store; recursion elimination; space complexity; theory; trees (mathematics)", pubcountry = "Netherlands A05", subject = "F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Classes defined by grammars or automata", treatment = "T Theoretical or Mathematical", } @Article{Laski:1986:ADC, author = "Janusz Laski", title = "An Algorithm for the Derivation of Codefinitions in Computer Programs", journal = j-INFO-PROC-LETT, volume = "23", number = "2", pages = "85--90", day = "20", month = aug, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Oakland Univ, Rochester, MI, USA", classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Sch. of Eng. and Comput. Sci., Oakland Univ., Rochester, MI, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; codefinitions; computer programming --- Algorithms; computer programs; computer software; data flow testing; data-based program testing; definition-use chain; full context; intraprocedural iterative algorithm; iterative algorithms; liveness; program testing; simple context; Testing; theory; verification", pubcountry = "Netherlands A06", subject = "D.2.5 Software, SOFTWARE ENGINEERING, Testing and Debugging \\ I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms", treatment = "T Theoretical or Mathematical", } @Article{Annot:1986:CMS, author = "J. K. Annot and M. D. Janssens and A. J. {Van De Goor}", title = "Comments on {Morris}'s starvation-free solution to the mutual exclusion problem {[Inform. Process. Lett. {\bf 8}(2), 15 February 1979, pp. 76--80]}", journal = j-INFO-PROC-LETT, volume = "23", number = "2", pages = "91--97", day = "20", month = aug, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See \cite{Morris:1979:SSM}.", acknowledgement = ack-nhfb, affiliationaddress = "Delft Univ of Technology, Delft, Neth", classification = "722; 723; C6150J (Operating systems)", corpsource = "Dept. of Electr. Eng., Delft Univ. of Technol., Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; binary semaphores; computer programming --- Algorithms; computer systems, digital; correctness; critical section; Distributed; Morris starvation-free solution; multiprocessing programs; multiprocessor system; mutual exclusion problem; starvation-free solution; theory; verification", pubcountry = "Netherlands A07", subject = "I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms \\ D.2.4 Software, SOFTWARE ENGINEERING, Program Verification, Correctness proofs", treatment = "P Practical", } @Article{Ntafos:1986:GWG, author = "Simeon Ntafos", title = "On gallery watchmen in grids", journal = j-INFO-PROC-LETT, volume = "23", number = "2", pages = "99--102", day = "20", month = aug, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Texas at Dallas, Richardson, TX, USA", classification = "723; 921; C4190 (Other numerical methods); C4240 (Programming and algorithm theory)", corpsource = "Texas Univ., Dallas, TX, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "2D grids; 3D grids; Algorithms; algorithms; computational complexity; computational geometry; computer programming; corridors; gallery watchman problem; mathematical techniques --- Geometry; polygon decomposition; polynomial-time solution; theory; verification", pubcountry = "Netherlands A08", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations", treatment = "T Theoretical or Mathematical", } @Article{Franco:1986:PPA, author = "John Franco", title = "On the probabilistic performance of algorithms for the satisfiability problem", journal = j-INFO-PROC-LETT, volume = "23", number = "2", pages = "103--106", day = "20", month = aug, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Indiana Univ, Bloomington, IN, USA", classification = "723; C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Indiana Univ., Bloomington, IN, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; average analysis; boolean literals; clauses; computational complexity; computer metatheory; computer programming; constant-density models; Davis--Putnam procedure; disjunctions; NP-complete; NP-complete problems; NP-completeness; performance; probabilistic analysis; probabilistic logic; probabilistic performance; random graphs; SAT; satisfiability problem; theory; truth values", pubcountry = "Netherlands A09", subject = "G.3 Mathematics of Computing, PROBABILITY AND STATISTICS, Probabilistic algorithms (including Monte Carlo) \\ G.4 Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm analysis \\ I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms \\ F.1.3 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Reducibility and completeness", treatment = "T Theoretical or Mathematical", } @Article{Codenotti:1986:ATB, author = "Bruno Codenotti and Grazia Lotti", title = "Area-time tradeoffs for bilinear forms computations in {VLSI}", journal = j-INFO-PROC-LETT, volume = "23", number = "2", pages = "107--109", day = "20", month = aug, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "CNR, Pisa, Italy", classification = "714; 921; B1110 (Network topology); B2570 (Semiconductor integrated circuits); C4240 (Programming and algorithm theory)", corpsource = "Istituto di Elaborazione dell'Inf., CNR, Pisa, Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "area-time complexity; area-time tradeoffs; bilinear forms; bilinear forms computations; circulant matrix; computational complexity; integrated circuits, VLSI; lower bound; mathematical techniques --- Matrix Algebra; network topology; outer vector product; Theory; theory; triangular Toeplitz matrix; VLSI; VLSI complexity; VLSI model", pubcountry = "Netherlands A10", subject = "C.5.4 Computer Systems Organization, COMPUTER SYSTEM IMPLEMENTATION, VLSI Systems \\ F.2.m Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Miscellaneous", treatment = "T Theoretical or Mathematical", } @Article{Codenotti:1986:VFS, author = "Bruno Codenotti and Grazia Lotti", title = "A {VLSI} Fast Solver for Tridiagonal Linear Systems", journal = j-INFO-PROC-LETT, volume = "23", number = "3", pages = "111--114", day = "22", month = oct, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "CNR, Pisa, Italy", classification = "714; 723; B1130B (Computer-aided circuit analysis and design); B2570 (Semiconductor integrated circuits); C4230 (Switching theory)C7410D (Electronic engineering)", corpsource = "Istituto di Elaborazione dell'Informazione, CNR, Pisa, Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "add even reduction; algorithms; area-time complexity; circuit layout CAD; computational complexity; Computer Aided Design; computer programming --- Algorithms; integrated circuits, VLSI; minimisation of switching nets; theory; tridiagonal linear systems; VLSI; VLSI fast solver", pubcountry = "Netherlands A01", subject = "C.5.4 Computer Systems Organization, COMPUTER SYSTEM IMPLEMENTATION, VLSI Systems \\ G.1.3 Mathematics of Computing, NUMERICAL ANALYSIS, Numerical Linear Algebra, Linear systems (direct and iterative methods)", treatment = "T Theoretical or Mathematical", } @Article{Makarov:1986:NAM, author = "O. M. Makarov", title = "A Noncommutative Algorithm for Multiplying $5 \times 5$ Matrices Using 102 Multiplications", journal = j-INFO-PROC-LETT, volume = "23", number = "3", pages = "115--117", day = "22", month = oct, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Inst of Biology of South Seas, Sevastopol, USSR", classification = "723; 921; C4140 (Linear algebra); C4240 (Programming and algorithm theory)", corpsource = "Inst. of Biol. of South Seas, Sevastopol, Ukrainian SSR, USSR", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; complexity of computation; computational complexity; computer programming --- Algorithms; mathematical techniques; matrices; matrix algebra; Matrix Algebra; matrix multiplication; multiplications; noncommutative algorithm; theory", pubcountry = "Netherlands A02", subject = "F.2.1 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Computations on matrices", treatment = "T Theoretical or Mathematical", } @Article{Lai:1986:NAP, author = "Ten-Hwang H. Lai and Alan Sprague", title = "A Note on Anomalies in Parallel Branch-And-Bound Algorithms with One-To-One Bounding Functions", journal = j-INFO-PROC-LETT, volume = "23", number = "3", pages = "119--122", day = "22", month = oct, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Ohio State Univ, Columbus, OH, USA", classification = "722; 723; C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. and Inf. Sci., Ohio State Univ., Columbus, OH, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm theory; algorithms; Algorithms; bounding function; branch-and-bound algorithms; computer programming; computer systems, digital --- Parallel Processing; parallel branch-and-bound algorithms; parallel processing; theory", pubcountry = "Netherlands A03", subject = "G.1.0 Mathematics of Computing, NUMERICAL ANALYSIS, General, Parallel algorithms \\ I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms \\ F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism", treatment = "T Theoretical or Mathematical", } @Article{Cooper:1986:ESB, author = "Jack Cooper and Selim G. Akl", title = "Efficient selection on a binary tree", journal = j-INFO-PROC-LETT, volume = "23", number = "3", pages = "123--126", day = "22", month = oct, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Queen's Univ, Kingston, Ont, Can", classification = "722; 723; 922; C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. and Inf. Sci., Queen's Univ., Kingston, Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "adaptive algorithm; algorithm theory; algorithms; Algorithms; b-bit integers; binary tree; binary trees; computer programming; computer systems, digital --- Parallel Processing; cost-optimal algorithm; data structures; mathematical techniques --- Trees; parallel algorithm; selection; simple processors; theory; trees (mathematics)", pubcountry = "Netherlands A04", subject = "G.1.0 Mathematics of Computing, NUMERICAL ANALYSIS, General, Parallel algorithms \\ F.2.3 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Tradeoffs among Complexity Measures \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching \\ F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism", treatment = "T Theoretical or Mathematical", } @Article{Poblete:1986:AFT, author = "Patricio V. Poblete", title = "Approximating functions by their {Poisson} transform", journal = j-INFO-PROC-LETT, volume = "23", number = "3", pages = "127--130", day = "22", month = oct, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", abstract = "When analyzing the performance of hashing algorithms, it is usually assumed that the hash function distributes the n keys randomly over the m table positions. In this exact filling model, all the m**n possible arrangements are equally likely. In some cases, the analysis under this model becomes too difficult, and a Poisson filling model is used instead. It has been shown that a Poisson result can be interpreted as a transform of the exact one, and this transform can be inverted to recover the exact result, and that the intuitive notion of using a Poisson result to approximate the corresponding exact result can be formalized, by means of an asymptotic expansion. A stronger version of the approximation theorem, together with a detailed proof, is presented. An explicit form is found for all the terms of the asymptotic expansion, and it is proved that they satisfy a recurrence relation.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Chile, Santiago, Chile", classification = "723; 921; B0290F (Interpolation and function approximation); C4130 (Interpolation and function approximation)", corpsource = "Faculty of Phys. Sci. and Math., Chile Univ., Santiago, Chile", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; approximation theorem; asymptotic expansion; computer programming --- Algorithms; data processing; exact model; File Organization; function approximation; hashing; hashing algorithm performance; mathematical techniques --- Approximation Theory; Poisson transform; recurrence relation; theory; transforms", pubcountry = "Netherlands A05", subject = "I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching", treatment = "T Theoretical or Mathematical", } @Article{Bertossi:1986:TDI, author = "Alan A. Bertossi", title = "Total domination in interval graphs", journal = j-INFO-PROC-LETT, volume = "23", number = "3", pages = "131--134", day = "22", month = oct, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q20 (05C35 68R10)", MRnumber = "88a:68044", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ di Pisa, Pisa, Italy", classification = "723; 921; B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics)", corpsource = "Dipartimento di Informatica, Pisa Univ., Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "acyclic directed network; algorithms; computer programming --- Algorithms; Graph Theory; graph theory; interval graphs; mathematical techniques; minimum cardinality; polynomial time algorithm; polynomial-time algorithm; shortest path problem; theory; total dominating set; verification", pubcountry = "Netherlands A06", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory", treatment = "T Theoretical or Mathematical", } @Article{Szpankowski:1986:AAT, author = "Wojciech Szpankowski", title = "On an asymptotic analysis of a tree-type algorithm for broadcast communications", journal = j-INFO-PROC-LETT, volume = "23", number = "3", pages = "135--142", day = "22", month = oct, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Purdue Univ, West Lafayette, IN, USA", classification = "723; B6110 (Information theory); B6150 (Communication system theory)", corpsource = "Dept. of Comput. Sci., Purdue Univ., West Lafayette, IN, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; asymptotic analysis; broadcast communications; common communication channel; computer networks; computer programming --- Algorithms; conflict resolution algorithms; conflict resolution intervals; conflicting packets; Gallager-Tsybakov-Mikhailov; information theory; interval-searching algorithms; packet collision; packet collisions; packet switching; packet switching network; performance; recurrence equation; theory; tree-type algorithm; trees (mathematics)", pubcountry = "Netherlands A07", subject = "I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms \\ C.2.0 Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, General, Data communications \\ C.2.1 Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Architecture and Design, Packet networks", treatment = "T Theoretical or Mathematical", } @Article{Wagner:1986:ICL, author = "Klaus W. Wagner", title = "On the intersection of the class of linear context-free languages and the class of single-reset languages", journal = j-INFO-PROC-LETT, volume = "23", number = "3", pages = "143--146", day = "22", month = oct, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q45 (68Q05)", MRnumber = "88b:68111", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ Passau, Passau, West Ger", classification = "721; C4210 (Formal logic)", corpsource = "Fakultat f{\"u}r Math. und Inf., Passau Univ., West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; context-free languages; Formal Languages; formal languages; languages; linear context-free languages; one-reversal one-counter languages; pushdowns; queues; single-reset languages; single-reversal machines; theory; verification", pubcountry = "Netherlands A08", subject = "F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Classes defined by grammars or automata", treatment = "T Theoretical or Mathematical", } @Article{Mints:1986:SDL, author = "G. Mints and E. Tyugu", title = "Semantics of a declarative language", journal = j-INFO-PROC-LETT, volume = "23", number = "3", pages = "147--151", day = "22", month = oct, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q55 (03B20 03B70)", MRnumber = "88e:68079a", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See also corrigendum \cite{Mints:1987:CSD}.", acknowledgement = ack-nhfb, affiliationaddress = "Estonian Acad of Sciences, Tallinn, USSR", classification = "721; C4210 (Formal logic)", corpsource = "Inst. of Cybernet., Estonian Acad. of Sci., Tallinn, Estonian SSR, USSR", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; computational linguistics; data semantics; declarative language; Formal Languages; formal languages; intuitionistic propositional calculus; languages; logic programming; PR17 system; program synthesis; semantics; theory", pubcountry = "Netherlands A09", subject = "I.2.3 Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Logic programming \\ I.2.2 Computing Methodologies, ARTIFICIAL INTELLIGENCE, Automatic Programming, Program synthesis \\ F.3.2 Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages", treatment = "T Theoretical or Mathematical", } @Article{Taghva:1986:SCF, author = "Kazem Taghva", title = "Some characterizations of finitely specifiable implicational dependency families", journal = j-INFO-PROC-LETT, volume = "23", number = "3", pages = "153--158", day = "22", month = oct, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68P15", MRnumber = "88c:68020", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "New Mexico Inst of Mining \& Technology, Socorro, NM, USA", classification = "723; C4210 (Formal logic)", corpsource = "Dept. of Comput. Sci., New Mexico Inst. of Min. and Technol., Socorro, NM, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "database systems; finitely specifiable ID-families; finitely specifiable implicational dependency families; formal logic; implicational dependencies; logic; relation scheme; Relational; relational model; relational models; Tarski-Fraisse-Vaught characterization; theory; universal classes; verification", pubcountry = "Netherlands A10", subject = "F.4.1 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Logic programming", treatment = "T Theoretical or Mathematical", } @Article{Udding:1986:AIS, author = "Jan Tijmen Udding", title = "Absence of individual starvation using weak semaphores", journal = j-INFO-PROC-LETT, volume = "23", number = "3", pages = "159--162", day = "22", month = oct, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Washington Univ, St. Louis, MO, USA", classification = "722; 723; C6150J (Operating systems)", corpsource = "Inst. for Biomed. Comput., Washington Univ., St. Louis, MO, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; computer operating systems; computer programming; computer systems programming --- Multiprogramming; computer systems, digital; critical section; deadlock; Distributed; individual starvation; multiprogramming; mutual exclusion; mutual exclusion problems; operating systems (computers); OS; scheduling; synchronization primitives; theory; weak semaphores", pubcountry = "Netherlands A11", subject = "I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sequencing and scheduling", treatment = "P Practical", } @Article{Tan:1986:CDT, author = "R. B. Tan and G. Tel and J. {van Leeuwen}", title = "Comments on: {``Distributed termination detection algorithm for distributed computations'' [Inform. Process. Lett. {\bf 22} (1986), no. 6, 311--314; MR 87j:68034a] by R. K. Arora, S. P. Rana and M. N. Gupta}", journal = j-INFO-PROC-LETT, volume = "23", number = "3", pages = "163--163", day = "22", month = oct, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q10", MRnumber = "87j:68034b", bibdate = "Sat Apr 11 12:24:20 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See \cite{Arora:1986:DTD,Arora:1988:MCD}.", acknowledgement = ack-nhfb, fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", } @Article{Dehornoy:1986:TCO, author = "Patrick Dehornoy", title = "{Turing} complexity of the ordinals", journal = j-INFO-PROC-LETT, volume = "23", number = "4", pages = "167--170", day = "8", month = nov, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "03D15 (03D20 03F15 68Q15)", MRnumber = "88h:03053", MRreviewer = "R. A. Di Paola", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Caen, Caen, Fr", classification = "723; C4220 (Automata theory)", corpsource = "Dept. of Math., Caen Univ., France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory --- Turing Machines; computer metatheory; construction schemes; logic; measurement; ordinals; recursion theory; recursive level; theory; tools; Turing complexity; Turing machine; Turing machines; verification", pubcountry = "Netherlands A01", subject = "F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Bounded-action devices \\ F.1.3 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes", treatment = "T Theoretical or Mathematical", } @Article{Latteux:1986:FGL, author = "M. Latteux and E. Timmerman", title = "Finitely Generated $\omega$-Languages", journal = j-INFO-PROC-LETT, volume = "23", number = "4", pages = "171--175", day = "8", month = nov, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q45 (03D05 20M05 20M35)", MRnumber = "88h:68045", MRreviewer = "Ludwig Staiger", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Lille, Villeneuve d'Ascq, Fr", classification = "721; C4210 (Formal logic)", corpsource = "Lab. de Recherche en Inf. Fondamentale, Lille I Univ., Villeneuve d'Ascq, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; finite set; finitely generated; finitely generated omega languages; formal languages; Formal Languages; languages; omega languages; rational language; regular; theory; verification", pubcountry = "Netherlands A02", subject = "F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Algebraic language theory \\ F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Classes defined by grammars or automata", treatment = "T Theoretical or Mathematical", } @Article{Alpern:1986:SS, author = "Bowen Alpern and Alan J. Demers and Fred B. Schneider", title = "Safety without stuttering", journal = j-INFO-PROC-LETT, volume = "23", number = "4", pages = "177--180", day = "8", month = nov, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Cornell Univ, Ithaca, NY, USA", classification = "723; C6150J (Operating systems)", corpsource = "Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer metatheory; computer programming; concurrency; formalization; languages; multiprocessing programs; operating systems (computers); safety properties; safety property; semantics; stuttering; system recovery; Theory; theory; verification", pubcountry = "Netherlands A03", subject = "F.3.2 Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages", treatment = "T Theoretical or Mathematical", } @Article{OHallaron:1986:GDP, author = "David R. O'Hallaron and Paul F. {Reynolds, Jr.}", title = "A Generalized Deadlock Predicate", journal = j-INFO-PROC-LETT, volume = "23", number = "4", pages = "181--188", day = "8", month = nov, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Virginia, Charlottesville, VA, USA", classification = "722; 723; C6150J (Operating systems)", corpsource = "Dept. of Comput. Sci., Virginia Univ., Charlottesville, VA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algebraic manipulation; computer operating systems; computer software --- Reliability; computer systems, digital --- Parallel Processing; fixed point functional; generalized deadlock predicate; multiprocessing programs; necessary condition; nonnumerical mathematics; operating system; operating systems (computers); parallel processing; partial deadlock; predicate transformer; PV programs; reliability; resource invariants; satisfiability; semaphore invariant method; software reliability; sufficient condition; system recovery; theory; total deadlock; verification", pubcountry = "Netherlands A04", subject = "D.4.1 Software, OPERATING SYSTEMS, Process Management, Deadlocks \\ D.2.4 Software, SOFTWARE ENGINEERING, Program Verification, Reliability", treatment = "T Theoretical or Mathematical", } @Article{Blum:1986:TAA, author = "Lenore Blum", title = "Towards an asymptotic analysis of {Karmarkar}'s algorithm", journal = j-INFO-PROC-LETT, volume = "23", number = "4", pages = "189--194", day = "8", month = nov, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "90C05 (68Q25)", MRnumber = "88a:90124", MRreviewer = "K. G. Murty", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Mills Coll, Oakland, CA, USA", classification = "723; 921; C1180 (Optimisation techniques); C4240 (Programming and algorithm theory)", corpsource = "Mills Coll., Oakland, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm analysis; algorithms; asymptotic analysis; computational complexity; computer programming --- Algorithms; dynamical properties; geometric quantity; iterative process; iterative steps; Karmarkar algorithm; Karmarkar's algorithm; linear programming; mathematical programming, linear; theoretical analysis; theory; verification; worst case", pubcountry = "Netherlands A05", subject = "G.4 Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm analysis \\ I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms \\ G.1.6 Mathematics of Computing, NUMERICAL ANALYSIS, Optimization, Linear programming", treatment = "T Theoretical or Mathematical", } @Article{Bertossi:1986:HCI, author = "Alan A. Bertossi and Maurizio A. Bonuccelli", title = "{Hamiltonian} circuits in interval graph generalizations", journal = j-INFO-PROC-LETT, volume = "23", number = "4", pages = "195--200", day = "8", month = nov, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "05C45 (68Q25 68R10 90B10 94C15)", MRnumber = "88b:05095", MRreviewer = "J. R. Griggs", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ di Pisa, Pisa, Italy", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dipartimento di Inf., Pisa Univ., Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "chordal graph; chordal graphs; computational complexity; computer programming --- Algorithms; double interval graphs; Graph Theory; graph theory; Hamiltonian circuits; intersection graph; intersection graphs; interval graph generalizations; mathematical techniques; NP-complete; rectangle graphs; theory; undirected path graph; undirected path graphs", pubcountry = "Netherlands A06", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Path and circuit problems", treatment = "T Theoretical or Mathematical", } @Article{Yamasaki:1986:RDD, author = "Susumu Yamasaki and Shuji Doshita", title = "Resolution deduction to detect satisfiability for another class including {non-Horn} sentences in propositional logic", journal = j-INFO-PROC-LETT, volume = "23", number = "4", pages = "201--207", day = "8", month = nov, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68T15 (03B05 03B35 68Q15)", MRnumber = "88b:68173", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Kyoto Univ, Kyoto, Jpn", classification = "723; C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Inf. Sci., Kyoto Univ., Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; computational complexity; computer metatheory; formal logic; inference rule; languages; linear layered resolution deduction based on input deductions; LLRI deduction; NLRI deduction; nonHorn sentences; nonlinear layered resolution deduction based on input deductions; polynomial time; propositional formula; propositional Horn sentences; propositional logic; resolution deduction; satisfiability; theory", pubcountry = "Netherlands A07", subject = "F.4.1 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Computational logic \\ F.4.1 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Logic programming \\ F.1.3 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes", treatment = "T Theoretical or Mathematical", } @Article{Gordon:1986:EFT, author = "Dan Gordon", title = "Eliminating the flag in threaded binary search trees", journal = j-INFO-PROC-LETT, volume = "23", number = "4", pages = "209--214", day = "8", month = nov, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Cincinnati, Cincinnati, OH, USA", classification = "722; 723; 921; C1160 (Combinatorial mathematics); C6120 (File organisation); C6130 (Data handling techniques)", corpsource = "Dept. of Comput. Sci., Cincinnati Univ., OH, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer systems, digital --- Multiprocessing; constant extra space; data handling; data processing; Data Structures; data structures; doubly-threaded binary search trees; flags; inorder predecessor; inorder traversal; inorder traversal without flags; insertion; left threads; mathematical techniques --- Trees; multiprocessing environment; node; preorder traversal; right threads; right-son pointer; searching; shared memory; theory; threaded binary search trees; time complexity; trees (mathematics); verification", pubcountry = "Netherlands A08", subject = "I.2.8 Computing Methodologies, ARTIFICIAL INTELLIGENCE, Problem Solving, Control Methods, and Search, Graph and tree search strategies", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Murphy:1986:EUT, author = "O. J. Murphy and S. M. Selkow", title = "The Efficiency of Using $k$-$d$ Trees for Finding Nearest Neighbors in Discrete Space", journal = j-INFO-PROC-LETT, volume = "23", number = "4", pages = "215--218", day = "8", month = nov, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Syracuse Univ, Syracuse, NY, USA", classification = "723; 921; C1160 (Combinatorial mathematics); C6120 (File organisation); C6130 (Data handling techniques)", corpsource = "Sch. of Comput. and Inf. Sci., Syracuse Univ., NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "$k$-$d$ trees; $K$-$D$ trees; best match; data handling; data processing; data structures; Data Structures; discrete space; efficiency; exhaustive search; file retrieval; fixed-length binary key records; input word; mathematical techniques --- Trees; multi-key searching; nearest neighbors; theory; tree search; trees (mathematics); verification", pubcountry = "Netherlands A09", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees \\ I.2.8 Computing Methodologies, ARTIFICIAL INTELLIGENCE, Problem Solving, Control Methods, and Search, Graph and tree search strategies \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Tarjan:1986:SAM, author = "R. E. Tarjan", title = "Corrigendum: {``Sensitivity analysis of minimum spanning trees and shortest path trees''} {[Inform. Process. Lett. {\bf 14}(1), 27 March 1982, pp. 30--33]}", journal = j-INFO-PROC-LETT, volume = "23", number = "4", pages = "219--219", day = "8", month = nov, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See \cite{Tarjan:1982:SAM}.", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics)", corpsource = "Dept. of Comput. Sci., Princeton Univ., NJ, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "minimum spanning trees; sensitivity analysis algorithm; shortest path trees; tree edge; trees (mathematics)", pubcountry = "Netherlands A10", treatment = "T Theoretical or Mathematical", } @Article{Sommerhalder:1986:PAD, author = "R. Sommerhalder and S. C. {Van Westrhenen}", title = "A Parallel ${O}(\log n)$ Algorithm for the Drawing of Algebraic Curves in an $n \times n$ Square", journal = j-INFO-PROC-LETT, volume = "23", number = "5", pages = "221--226", day = "24", month = nov, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Technical Univ Delft, Delft, Neth", classification = "721; 722; 723; C4240 (Programming and algorithm theory)", corpsource = "Dept. of Math. and Inf., Tech. Univ., Delft, Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algebraic curves; algorithms; Algorithms; automata theory; circles; computational complexity; computer programming; computer systems, digital --- Parallel Processing; conics; parallel algorithms; parallel computer structure; parallel O(log n) algorithm; pyramid cellular automaton; systolic algorithm; theory", pubcountry = "Netherlands A01", subject = "F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism \\ F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Unbounded-action devices", treatment = "T Theoretical or Mathematical", } @Article{Ambos-Spies:1986:NCP, author = "Klaus Ambos-Spies", title = "A Note on Complete Problems for Complexity Classes", journal = j-INFO-PROC-LETT, volume = "23", number = "5", pages = "227--230", day = "24", month = nov, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "03D15 (03D30 68Q15)", MRnumber = "88h:03052", MRreviewer = "John T. Gill", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ Dortmund, Dortmund, West Ger", classification = "723; 921; C1160 (Combinatorial mathematics); C4210 (Formal logic); C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "Lehrstuhl f{\"u}r Inf. II, Dortmund Univ., West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; complete set; complete sets; complexity classes; computational complexity; computer metatheory; decidability; equivalence classes; mathematical techniques --- Set Theory; NP; p-Turing equivalence; polynomial hierarchy; polynomial-time reducibility; recursive sets; theory; verification", pubcountry = "Netherlands A02", subject = "G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous \\ F.1.3 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Reducibility and completeness", treatment = "T Theoretical or Mathematical", } @Article{VandeSnepscheut:1986:AIC, author = "Jan L. A. {Van de Snepscheut} and Jan Tijmen Udding", title = "An Alternative Implementation of Communication Primitives", journal = j-INFO-PROC-LETT, volume = "23", number = "5", pages = "231--238", day = "24", month = nov, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Groningen Univ, Groningen, Neth", classification = "722; 723; C4210 (Formal logic); C4230 (Switching theory); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Math. and Comput. Sci., Groningen Univ., Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "alternative complete implementation; boolean functions; Boolean functions; communicating sequential processes; communication primitives; computer metatheory; computer systems, digital --- Distributed; CSP; deadlock; program correctness; program verification; switching theory; synchronous communication actions; theory; verification", pubcountry = "Netherlands A03", subject = "D.2.4 Software, SOFTWARE ENGINEERING, Program Verification, Correctness proofs \\ F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Unbounded-action devices", treatment = "T Theoretical or Mathematical", } @Article{Evans:1986:MPJ, author = "David John Evans and Nadia Y. Yousif", title = "Merging by the parallel jump searching algorithm", journal = j-INFO-PROC-LETT, volume = "23", number = "5", pages = "239--246", day = "24", month = nov, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Loughborough Univ of Technology, Loughborough, Engl", classification = "722; 723; C4240 (Programming and algorithm theory); C6130 (Data handling techniques)", corpsource = "Dept. of Comput. Studies, Loughborough Univ. of Technol., UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; bubble sort; complexity analysis; computational complexity; computer programming --- Algorithms; computer systems programming; computer systems, digital --- Parallel Processing; experimentation; measurement; merging; MIMD computers; neighbour sort; Neptune computer; NEPTUNE MIMD system; parallel algorithms; parallel jump searching algorithm; parallel merging; sorted file; Sorting; sorting; theory", pubcountry = "Netherlands A04", subject = "C.1.2 Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors), Multiple-instruction-stream, multiple-data-stream processors (MIMD) \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching \\ G.1.0 Mathematics of Computing, NUMERICAL ANALYSIS, General, Parallel algorithms", treatment = "T Theoretical or Mathematical", } @Article{Chen:1986:VAF, author = "G. Chen and M. H. Williams", title = "The Value of an Array Facility in {Prolog}", journal = j-INFO-PROC-LETT, volume = "23", number = "5", pages = "247--251", day = "24", month = nov, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Heriot-Watt Univ, Edinburgh, Scotl", classification = "723; C6110 (Systems analysis and programming); C6120 (File organisation); C6140D (High level languages)", corpsource = "Dept. of Comput. Sci., Heriot-Watt Univ., Edinburgh, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "applicative semantics; array data type; C-Prolog interpreter; computer programming languages; data processing --- Data Structures; data structures; destructive update operations; flow analysis; languages; logic programming; performance; Prolog; PROLOG; theory; update operations", pubcountry = "Netherlands A05", subject = "D.3.2 Software, PROGRAMMING LANGUAGES, Language Classifications, Prolog \\ E.1 Data, DATA STRUCTURES, Arrays \\ D.3.3 Software, PROGRAMMING LANGUAGES, Language Constructs, Data types and structures", treatment = "X Experimental", } @Article{Broy:1986:DSC, author = "Manfred Broy", title = "Denotational semantics of communicating sequential programs", journal = j-INFO-PROC-LETT, volume = "23", number = "5", pages = "253--259", day = "24", month = nov, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q55 (68Q10)", MRnumber = "88a:68072", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ Passau, Passau, West Ger", classification = "722; 723; C4230 (Switching theory); C4240 (Programming and algorithm theory)", corpsource = "Fakultat f{\"u}r Math. und Inf., Passau Univ., West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "communicating sequential processes; communicating sequential programs; computer programming; computer systems, digital --- Distributed; denotational semantics; functions mapping; handshake communication; languages; program verification; synchronisation; theory; verification methods", pubcountry = "Netherlands A06", subject = "F.3.2 Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Denotational semantics \\ F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Unbounded-action devices \\ D.1.3 Software, PROGRAMMING TECHNIQUES, Concurrent Programming, CSP", treatment = "T Theoretical or Mathematical", } @Article{Stojanovski:1986:NIP, author = "Jordan Stojanovski", title = "A note on implementing {Prolog} in {Lisp}", journal = j-INFO-PROC-LETT, volume = "23", number = "5", pages = "261--264", day = "24", month = nov, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Jozef Stefan Inst, Ljubljana, Yugosl", classification = "723; C6110 (Systems analysis and programming); C6140D (High level languages); C6150C (Compilers, interpreters and other processors)", corpsource = "Dept. of Comput. Sci., Jozef Stefan Inst., Ljubljana, Yugoslavia", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; computer programming; computer programming languages; cut primitive; languages; last call optimisation; last call optimization; lisp; LISP; Lisp; logic programming; optimization; program interpreters; Prolog; PROLOG; Prolog programs; tail recursion optimisation; theory", pubcountry = "Netherlands A07", subject = "D.3.2 Software, PROGRAMMING LANGUAGES, Language Classifications, Prolog \\ D.3.2 Software, PROGRAMMING LANGUAGES, Language Classifications, LISP", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Handley:1986:SDS, author = "C. C. Handley", title = "An in situ distributive sort", journal = j-INFO-PROC-LETT, volume = "23", number = "5", pages = "265--270", day = "24", month = nov, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Natal, Durban, S Afr", classification = "723; C4240 (Programming and algorithm theory); C6130 (Data handling techniques)", corpsource = "Dept. of Comput. Sci., Natal Univ., Durban, South Africa", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; Clocksort algorithm; complexity; computational complexity; computer programming --- Algorithms; computer systems programming; distributive sort; distributive sorting; measurement; Pascal listings; performance; Sorting; sorting; theory; verification", pubcountry = "Netherlands A08", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Makinen:1986:NPG, author = "Erkki M{\"a}kinen", title = "A Note on Pure Grammars", journal = j-INFO-PROC-LETT, volume = "23", number = "5", pages = "271--274", day = "24", month = nov, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q50", MRnumber = "88b:68118", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Tampere, Tampere, Finl", classification = "721; C4210 (Formal logic)", corpsource = "Dept. of Math. Sci. and Comput. Sci., Tampere Univ., Finland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "arbitrary length-increasing productions; automata theory; Context Free Grammars; context-free grammar; context-free grammars; generative capacity of pure grammars; languages; left Szilard language; pure context-free grammar; pure length-increasing grammar; theory; verification", pubcountry = "Netherlands A09", subject = "F.4.2 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems, Grammar types", treatment = "T Theoretical or Mathematical", } @Article{Leiss:1986:ISC, author = "Ernst L. Leiss", title = "The Inaccessible Set: a Classification by Query Type of Security Risks in Statistical Databases", journal = j-INFO-PROC-LETT, volume = "23", number = "6", pages = "275--279", day = "3", month = dec, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68P15", MRnumber = "88a:68016", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Houston, Houston, TX, USA", classification = "723; C4250 (Database theory)", corpsource = "Dept. of Comput. Sci., Houston Univ., University Park, TX, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "classification; data processing --- Security of Data; database systems; database theory; inaccessible set; query type; security; security risks; statistical databases; theory; verification", pubcountry = "Netherlands A01", subject = "G.3 Mathematics of Computing, PROBABILITY AND STATISTICS \\ H.2.8 Information Systems, DATABASE MANAGEMENT, Database applications \\ H.2.0 Information Systems, DATABASE MANAGEMENT, General, Security, integrity, and protection", treatment = "T Theoretical or Mathematical", } @Article{Benois:1986:CSE, author = "Mich{\`e}le Benois and Jacques Sakarovitch", title = "On the Complexity of Some Extended Word Problems Defined by Cancellation Rules", journal = j-INFO-PROC-LETT, volume = "23", number = "6", pages = "281--287", day = "3", month = dec, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q45 (03D03 03D15 03D40 20M05 68Q25)", MRnumber = "88d:68046", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "IMAG Grenoble, St. Martin d'Heres, Fr", classification = "721; 723; C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "IMAG Grenoble, St. Martin d'Heres, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm; algorithms; automata theory; automaton recognising; cancellation rules; complexity bounds; computational complexity; computer programming --- Algorithms; cryptography; descendants; extended word problems; Formal Languages; languages; public key encryption; regular set; theory; Thue systems; verification", pubcountry = "Netherlands A02", subject = "F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Automata \\ F.4.2 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems, Thue systems", treatment = "T Theoretical or Mathematical", } @Article{Edelsbrunner:1986:HRS, author = "Herbert Edelsbrunner and Emo Welzl", title = "Halfplanar range search in linear space and ${O}(n^{0.695})$ query time", journal = j-INFO-PROC-LETT, volume = "23", number = "6", pages = "289--293", day = "3", month = dec, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Technical Univ of Graz, Graz, Austria", classification = "723; C4190 (Other numerical methods); C4240 (Programming and algorithm theory)", corpsource = "Inst. for Inf. Processing., Tech. Univ. of Graz, Austria", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; computational complexity; computational geometry; computer programming; data processing --- Data Structures; data structure; Euclidean plane; halfplanar range query; halfplanar range search; linear space; query time; theory; verification; worst case", pubcountry = "Netherlands A03", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching", treatment = "T Theoretical or Mathematical", } @Article{Martin:1986:NGD, author = "Alain J. Martin", title = "A New Generalization of {Dekker}'s Algorithm for Mutual Exclusion", journal = j-INFO-PROC-LETT, volume = "23", number = "6", pages = "295--297", day = "3", month = dec, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "California Inst of Technology, Pasadena, CA, USA", classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., California Inst. of Technol., Pasadena, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; atomic actions; Booleans; bounded integer; computer programming; computer systems programming; Dekker algorithm; Dekker's algorithm; mutual exclusion; mutual exclusion problem; programming theory; shared variables; theory; verification", pubcountry = "Netherlands A04", subject = "H.2.2 Information Systems, DATABASE MANAGEMENT, Physical Design, Deadlock avoidance", treatment = "T Theoretical or Mathematical", } @Article{Holenderski:1986:CNP, author = "Leszek Holenderski", title = "The Correctness of Nondeterministic Programs Revisited", journal = j-INFO-PROC-LETT, volume = "23", number = "6", pages = "299--303", day = "3", month = dec, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C4210 (Formal logic)", corpsource = "Dept. of Comput., Imperial Coll., London, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "breadth-first execution method; computer metatheory --- Programming Theory; computer programming; depth first strategy; first-order formulas; formal logic; nondeterministic programs; program correctness; satisfiability; searching; theory; Theory; total correctness; validity; verification", pubcountry = "Netherlands A05", subject = "F.3.1 Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs \\ F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Alternation and nondeterminism \\ D.2.4 Software, SOFTWARE ENGINEERING, Program Verification, Correctness proofs", treatment = "T Theoretical or Mathematical", } @Article{Allison:1986:BLA, author = "Lloyd Allison and Trevor I. Dix", title = "A Bit-String Longest-Common-Subsequence Algorithm", journal = j-INFO-PROC-LETT, volume = "23", number = "6", pages = "305--310", day = "3", month = dec, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Western Australia, Nedlands, Aust", classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Western Australia Univ., Nedlands, WA, Australia", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; bit-string longest-common-subsequence algorithm; bit-string operations; computational complexity; computer programming; conventional computer; edit distance; longest-common-subsequence algorithm; theory; word-length", pubcountry = "Netherlands A06", subject = "D.3.3 Software, PROGRAMMING LANGUAGES, Language Constructs, Data types and structures \\ G.2.1 Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics, Combinatorial algorithms", treatment = "T Theoretical or Mathematical", } @Article{Choe:1986:ECL, author = "Kwang-Moo M. Choe and Chun-Hyon H. Chang", title = "Efficient computation of the locally least-cost insertion string for the {LR} error repair", journal = j-INFO-PROC-LETT, volume = "23", number = "6", pages = "311--316", day = "3", month = dec, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Korea Advanced Inst of Science \& Technology, Seoul, South Korea", classification = "721; 723; C4110 (Error analysis in numerical methods); C4210 (Formal logic)", corpsource = "Dept. of Comput. Sci., Korea Adv. Inst. of Sci. and Technol., Seoul, South Korea", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithmic error repairing parser; algorithms; automata theory; compiler designers; computer operating systems --- Program Compilers; computer programming --- Algorithms; error analysis; expected vocabulary string; Formal Languages; grammars; languages; locally least-cost error repair scheme; locally least-cost insertion string; LR error repair; program compilers; table-driven; theory", pubcountry = "Netherlands A07", subject = "F.4.2 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems, Parsing", treatment = "T Theoretical or Mathematical", } @Article{Harary:1986:LAC, author = "Frank Harary and Peter J. Slater", title = "A Linear Algorithm for the Cutting Center of a Tree", journal = j-INFO-PROC-LETT, volume = "23", number = "6", pages = "317--319", day = "3", month = dec, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Michigan, Ann Arbor, MI, USA", classification = "723; 921; C1160 (Combinatorial mathematics); C4210 (Formal logic)", corpsource = "Dept. of Math., Michigan Univ., Ann Arbor, MI, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; computer programming; connected graph; cutting center; cutting number; linear algorithm; mathematical techniques --- Trees; node; theory; tree; trees (mathematics)", pubcountry = "Netherlands A08", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees", treatment = "T Theoretical or Mathematical", } @Article{Kieburtz:1986:WCY, author = "Richard B. Kieburtz", title = "When chasing your tail saves time graph theory", journal = j-INFO-PROC-LETT, volume = "23", number = "6", pages = "321--324", day = "3", month = dec, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Oregon Graduate Cent, Beaverton, OR, USA", classification = "723; 921; C1160 (Combinatorial mathematics); C4210 (Formal logic); C4240 (Programming and algorithm theory); C6120 (File organisation)", corpsource = "Dept. of Comput. Sci. and Eng., Oregon Graduate Center, Beaverton, OR, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computational complexity; computer metatheory --- Programming Theory; computer programs; cyclic data structures; data structures; formal languages; functional language programs; functional programming; graph reduction; graph theory; mathematical techniques --- Graph Theory; recursively defined expressions; Theory; theory", pubcountry = "Netherlands A09", subject = "D.1.m Software, PROGRAMMING TECHNIQUES, Miscellaneous \\ G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous", treatment = "T Theoretical or Mathematical", } @Article{Nakata:1986:LLL, author = "Ikuo Nakata and Masataka Sassa", title = "{L}-attributed {LL}(1)-grammars are {LR}-attributed", journal = j-INFO-PROC-LETT, volume = "23", number = "6", pages = "325--328", day = "3", month = dec, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Tsukuba, Sakuramura, Jpn", classification = "721; C4210 (Formal logic)", corpsource = "Inst. of Inf. Sci. and Electron., Tsukuba Univ., Ibaraki, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "attributed grammars; automata theory; context-free grammars; Grammars; l-attributed grammars; L-attributed LL(1)-grammars; languages; LL(1)-parsers; LR-attributed LR(1)-grammars; programming languages; semantics; syntax; theory; verification", pubcountry = "Netherlands A10", subject = "F.4.2 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems, Grammar types", treatment = "T Theoretical or Mathematical", } @Article{Alexandrakis:1987:WGK, author = "Athanasios Alexandrakis and Symeon Bozapalidis", title = "Weighted grammars and {Kleene}'s theorem", journal = j-INFO-PROC-LETT, volume = "24", number = "1", pages = "1--4", day = "15", month = jan, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q50 (03D05 68Q45)", MRnumber = "88k:68052", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Aristotle Univ of Thessaloniki, Thessaloniki, Greece", classification = "721; 921; C1160 (Combinatorial mathematics); C4210 (Formal logic)", corpsource = "Dept. of Math., Aristotle Univ., Thessaloniki, Greece", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; automata theory; formal languages; formal tree power series; Grammars; grammars; Kleene's theorem; languages; mathematical techniques --- Trees; regular tree grammars; series (mathematics); trees (mathematics); verification; weighted grammars", pubcountry = "Netherlands A01", subject = "F.4.2 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems, Decision problems \\ F.4.2 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems, Grammar types \\ F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Classes defined by grammars or automata", treatment = "T Theoretical or Mathematical", } @Article{Kurtz:1987:HPR, author = "Stuart A. Kurtz and Michael J. O'Donnell and James S. Royer", title = "How to prove representation-independent independence results", journal = j-INFO-PROC-LETT, volume = "24", number = "1", pages = "5--10", day = "15", month = jan, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "03D10 (68Q15)", MRnumber = "88g:03058", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Chicago, Chicago, IL, USA", classification = "721; 723; C4210 (Formal logic); C4220 (Automata theory)", corpsource = "Dept. of Comput. Sci., Chicago Univ., IL, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; computer metatheory --- Formal Logic; formal logic; independence results; input-output behavior; representation-independent independence results; subrecursive complexity classes; theory; Turing machine; Turing Machines; Turing machines; verification", pubcountry = "Netherlands A02", subject = "F.1.3 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Reducibility and completeness \\ F.1.3 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Machine-independent complexity", treatment = "T Theoretical or Mathematical", } @Article{Feijen:1987:IIC, author = "W. H. J. Feijen and A. J. M. {Van Gasteren} and David Gries", title = "In-situ inversion of a cyclic permutation", journal = j-INFO-PROC-LETT, volume = "24", number = "1", pages = "11--14", day = "15", month = jan, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Technology, Eindhoven, Neth", classification = "723; 921; C4240 (Programming and algorithm theory)", corpsource = "Dept. of Math. and Comput. Sci., Univ. of Technol., Eindhoven, Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; computer programming; cyclic permutation; in-situ inversion; mathematical techniques --- Combinatorial Mathematics; program development; programming methodology; programming theory", pubcountry = "Netherlands A03", subject = "I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms \\ I.1.1 Computing Methodologies, ALGEBRAIC MANIPULATION, Expressions and Their Representation, Representations (General and Polynomial)", treatment = "T Theoretical or Mathematical", } @Article{Kim:1987:PMM, author = "Taenam Kim and Kyung-Yong Y. Chwa", title = "An ${O}(n \log n \log \log n)$ Parallel Maximum Matching Algorithm for Bipartite Graphs", journal = j-INFO-PROC-LETT, volume = "24", number = "1", pages = "15--17", day = "15", month = jan, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Korea Advanced Inst of Science \& Technology, Seoul, South Korea", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Korea Adv. Inst. of Sci. and Technol., Seoul, South Korea", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; bipartite graphs; computational complexity; computer metatheory; computer programming; computer systems, digital --- Parallel Processing; graph theory; graphs; mathematical techniques --- Graph Theory; maximum matching algorithm; parallel algorithms; parallel machine model; parallel maximum matching algorithm; time bound; time bounds; verification", pubcountry = "Netherlands A04", subject = "G.1.0 Mathematics of Computing, NUMERICAL ANALYSIS, General, Parallel algorithms \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms", treatment = "T Theoretical or Mathematical", } @Article{Hochschild:1987:MCI, author = "Peter Hochschild", title = "Multiple cuts, input repetition, and {VLSI} complexity", journal = j-INFO-PROC-LETT, volume = "24", number = "1", pages = "19--24", day = "15", month = jan, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q35", MRnumber = "88b:68093", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Stanford Univ, Stanford, CA, USA", classification = "714; 723; B2570 (Semiconductor integrated circuits); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Stanford Univ., CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "area-time complexity; codes, symbolic --- Encoding; computational complexity; information content; input bits; input repetition; integrated circuits, VLSI; multiple cut methods; multiple cuts; output bits; redundant encodings; theory; VLSI; VLSI circuits; VLSI complexity", pubcountry = "Netherlands A05", subject = "F.1.3 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes", treatment = "T Theoretical or Mathematical", } @Article{Finkel:1987:EDA, author = "Raphael Finkel and Hari H. Madduri", title = "An Efficient Deadlock Avoidance Algorithm", journal = j-INFO-PROC-LETT, volume = "24", number = "1", pages = "25--30", day = "15", month = jan, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Wisconsin, Madison, WI, USA", classification = "722; 723; C6120 (File organisation); C6150J (Operating systems)", corpsource = "Dept. of Comput. Sci., Wisconsin Univ., Madison, WI, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; allocation state; banker's algorithm; Banker's algorithm; computer programming --- Algorithms; computer systems, digital; concurrency; data structure; data structures; deadlock avoidance; deadlock avoidance algorithm; Distributed; job completions; measurement; operating systems (computers); resource allocation; safe sequences; safety test; system recovery", pubcountry = "Netherlands A06", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sequencing and scheduling \\ D.4.1 Software, OPERATING SYSTEMS, Process Management, Deadlocks \\ D.4.1 Software, OPERATING SYSTEMS, Process Management, Concurrency", treatment = "P Practical", } @Article{Sassa:1987:EGP, author = "Masataka Sassa and Harushi Ishizuka and Ikuo Nakata", title = "{ECLR}-attributed grammars: a practical class of {LR}-attributed grammars", journal = j-INFO-PROC-LETT, volume = "24", number = "1", pages = "31--41", day = "15", month = jan, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Tsukuba, Sakura-mura, Jpn", classification = "721; 723; C4210 (Formal logic); C6150C (Compilers, interpreters and other processors)", corpsource = "Tsukuba Univ., Ibaraki, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; attribute grammars; automata theory; compiler generators; compilers; computer operating systems --- Program Compilers; ECLR-attributed grammars; Grammars; grammars; languages; LR parsing; LR-attributed grammars; program compilers", pubcountry = "Netherlands A07", subject = "F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Classes defined by grammars or automata", treatment = "T Theoretical or Mathematical", } @Article{Bernstein:1987:PTT, author = "A. J. Bernstein", title = "Predicate transfer and timeout in message passing systems", journal = j-INFO-PROC-LETT, volume = "24", number = "1", pages = "43--52", day = "15", month = jan, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "SUNY at Stony Brook, Stony Brook, NY, USA", classification = "722; 723; C5620 (Computer networks and techniques); C6150J (Operating systems)", corpsource = "Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer systems, digital; Distributed; distributed processing; message passing systems; predicate transfer; semantics; timeout; verification", pubcountry = "Netherlands A08", subject = "D.4.4 Software, OPERATING SYSTEMS, Communications Management, Message sending", treatment = "T Theoretical or Mathematical", } @Article{Bird:1987:AAE, author = "R. S. Bird and John Hughes", title = "The Alpha-Beta Algorithm: an Exercise in Program Transformation", journal = j-INFO-PROC-LETT, volume = "24", number = "1", pages = "53--57", day = "15", month = jan, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Oxford Univ Computing Lab, Oxford, Engl", classification = "723; 921; C4240 (Programming and algorithm theory)", corpsource = "Oxford Univ. Comput. Lab., UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; alpha-beta algorithm; alpha-beta pruning; computer metatheory --- Programming Theory; computer programming; minimaxing; optimization; program transformation; programming theory", pubcountry = "Netherlands A09", subject = "I.2.2 Computing Methodologies, ARTIFICIAL INTELLIGENCE, Automatic Programming, Program transformation \\ G.1.2 Mathematics of Computing, NUMERICAL ANALYSIS, Approximation, Minimax approximation and algorithms", treatment = "T Theoretical or Mathematical", } @Article{Yuba:1987:BSN, author = "Toshitsugu Yuba and Mamoru Hoshi", title = "Binary search networks: a new method for key searching", journal = j-INFO-PROC-LETT, volume = "24", number = "1", pages = "59--65", day = "15", month = jan, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Electrotechnical Lab, Sakura-mura, Jpn", classification = "723; 921; C6120 (File organisation); C6150J (Operating systems)", corpsource = "Electrotech. Lab., Ibaraki, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; binary search networks; binary search tree; computer programming; data storage; data structures; deletion; information retrieval; insertion; key searching; minimizing; optimization; performance; search cost; storage allocation; storage management; trees (mathematics)", pubcountry = "Netherlands A10", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching \\ D.2.1 Software, SOFTWARE ENGINEERING, Requirements/Specifications", treatment = "T Theoretical or Mathematical", } @Article{Arvind:1987:ASP, author = "V. Arvind and S. Biswas", title = "An ${O}(n^2)$ Algorithm for the Satisfiability Problem of a Subset of Propositional Sentences in {CNF} That Includes All {Horn} Sentences", journal = j-INFO-PROC-LETT, volume = "24", number = "1", pages = "67--69", day = "15", month = jan, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (03B05 03B35 03D15)", MRnumber = "88e:68047", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Indian Inst of Technology, Kanpur, Kanpur, India", classification = "723; C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci. and Eng., Indian Inst. of Technol., Kanpur, India", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; CNF; computational complexity; computer metatheory; computer programming --- Algorithms; formal languages; formal logic; Horn sentences; horn sentences; linear-time reduction; propositional sentences; satisfiability problem; unit resolution", pubcountry = "Netherlands A11", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems", treatment = "T Theoretical or Mathematical", } @Article{Slusarek:1987:OSA, author = "Maciej Slusarek", title = "An Off-Line Storage Allocation Algorithm", journal = j-INFO-PROC-LETT, volume = "24", number = "2", pages = "71--75", day = "30", month = jan, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Jagiellonian Univ, Cracow, Pol", classification = "723; C4240 (Programming and algorithm theory); C6150J (Operating systems)", corpsource = "Dept. of Comput. Sci., Jagiellonian Univ., Krakow, Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; block sizes; combinatorial mathematics; computability; computational complexity; computer operating systems; computer programming --- Algorithms; NP-hard; off-line dynamic storage allocation; off-line storage allocation; optimal allocation; polynomial approximation strategy; polynomial-time algorithm; resource allocation; Storage Allocation; storage allocation; worst-case performance ratio", pubcountry = "Netherlands A01", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems \\ D.4.2 Software, OPERATING SYSTEMS, Storage Management, Allocation/deallocation strategies", treatment = "T Theoretical or Mathematical", } @Article{Emerson:1987:UIT, author = "E. Allen Emerson", title = "Uniform inevitability is tree automaton ineffable", journal = j-INFO-PROC-LETT, volume = "24", number = "2", pages = "77--79", day = "30", month = jan, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q60 (03D05 68Q05)", MRnumber = "88h:68061", MRreviewer = "David Harel", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Texas at Austin, Austin, TX, USA", classification = "721; 921; C1160 (Combinatorial mathematics); C4210 (Formal logic); C4220 (Automata theory)", corpsource = "Dept. of Comput. Sci., Texas Univ., Austin, TX, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; correctness property; expressive power; Finite Automata; finite automata; finite automaton; formal logic; infinite trees; mathematical techniques --- Trees; temporal logic; tree automation; tree automaton; trees (mathematics); uniform inevitability; verification", pubcountry = "Netherlands A02", subject = "F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Automata \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees", treatment = "T Theoretical or Mathematical", } @Article{Grazon:1987:IWL, author = "Anne Grazon", title = "An Infinite Word Language Which is Not {co-CFL}", journal = j-INFO-PROC-LETT, volume = "24", number = "2", pages = "81--85", day = "30", month = jan, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q45 (03D05)", MRnumber = "88d:68051", MRreviewer = "Christine Charretton", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Cent Universitaire d'Avignon, Avignon, Fr", classification = "721; C4210 (Formal logic)", corpsource = "Dept. d'Inf. et Math. Appliqu{\'e}es, Centre Univ. d'Avignon, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; Context Free Languages; context-free languages; infinite word; infinite word language; iteration lemma; languages; left factors; verification", pubcountry = "Netherlands A03", subject = "F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Classes defined by grammars or automata", treatment = "T Theoretical or Mathematical", } @Article{Wolfson:1987:CET, author = "Ouri Wolfson", title = "Concurrent execution of transaction copies", journal = j-INFO-PROC-LETT, volume = "24", number = "2", pages = "87--93", day = "30", month = jan, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68P15", MRnumber = "88c:68023", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Technion-Israel Inst of Technology, Haifa, Isr", classification = "723; C4250 (Database theory); C6160B (Distributed DBMS)", corpsource = "Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "concurrency control; concurrent execution; database systems; database theory; deadlock; deadlock-free; Distributed; distributed database; distributed databases; multiple database users; serializability; supervisory programs; transaction copies; transaction execution; verification", pubcountry = "Netherlands A04", subject = "H.2.4 Information Systems, DATABASE MANAGEMENT, Systems, Distributed systems \\ H.2.4 Information Systems, DATABASE MANAGEMENT, Systems, Query processing", treatment = "T Theoretical or Mathematical", } @Article{Field:1987:NND, author = "Dan Field", title = "A note on a new data structure for in-the-past queries", journal = j-INFO-PROC-LETT, volume = "24", number = "2", pages = "95--96", day = "30", month = jan, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Waterloo, Waterloo, Ont, Can", classification = "723; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory); C6120 (File organisation); C6160 (Database management systems (DBMS))", corpsource = "Dept. of Comput. Sci., Waterloo Univ., Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computational complexity; data processing; data structure; Data Structures; data structures; database systems; forests; in-the-past queries; past queries; trees (mathematics)", pubcountry = "Netherlands A05", subject = "E.1 Data, DATA STRUCTURES \\ H.3.3 Information Systems, INFORMATION STORAGE AND RETRIEVAL, Information Search and Retrieval, Query formulation", treatment = "T Theoretical or Mathematical", } @Article{Rey:1987:DLM, author = "Claudio Rey and Rabab Ward", title = "On determining the on-line minimax linear fit to a discrete point set in the plane", journal = j-INFO-PROC-LETT, volume = "24", number = "2", pages = "97--101", day = "30", month = jan, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68U05 (65D10 68Q25)", MRnumber = "88e:68105", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of British Columbia, Vancouver, BC, Can", classification = "723; 921; C1180 (Optimisation techniques); C4130 (Interpolation and function approximation); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Electr. Eng., British Columbia Univ., Vancouver, BC, Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; computational complexity; computer programming; convex hull; discrete point set; hull edge; mathematical programming, linear; maximum vertical distance; minimax techniques; on-line minimax linear fit; verification; vertices", pubcountry = "Netherlands A06", subject = "G.1.2 Mathematics of Computing, NUMERICAL ANALYSIS, Approximation, Minimax approximation and algorithms \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations", treatment = "T Theoretical or Mathematical", } @Article{Korel:1987:PDG, author = "Bogdan Korel", title = "The program dependence graph in static program testing", journal = j-INFO-PROC-LETT, volume = "24", number = "2", pages = "103--108", day = "30", month = jan, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Oakland Univ, Rochester, MI, USA", classification = "723; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory); C6110 (Systems analysis and programming)", corpsource = "Sch. of Eng. and Comput. Sci., Oakland Univ., Rochester, MI, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer programming; computer software --- Testing; control dependencies; data dependence; data dependencies; detectable errors; directed graphs; error detection; input-output relation; input-output relationship analysis; program dependence graph; program testing; redundant code; redundant code detection; static analysis; static program testing; Testing", pubcountry = "Netherlands A07", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory \\ G.4 Mathematics of Computing, MATHEMATICAL SOFTWARE, Certification and testing", treatment = "T Theoretical or Mathematical", } @Article{Gottlob:1987:SI, author = "Georg Gottlob", title = "Subsumption and implication", journal = j-INFO-PROC-LETT, volume = "24", number = "2", pages = "109--111", day = "30", month = jan, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68T15 (03B35)", MRnumber = "88f:68126", MRreviewer = "Alexander Leitsch", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Comput. Sci., Stanford Univ., CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "algorithms; formal logic; implication; subsumption; sufficient conditions; verification", pubcountry = "Netherlands A08", subject = "F.4.1 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic", treatment = "T Theoretical or Mathematical", } @Article{Sassa:1987:SRL, author = "Masataka Sassa and Ikuo Nakata", title = "A simple realization of {LR}-parsers for regular right part grammars", journal = j-INFO-PROC-LETT, volume = "24", number = "2", pages = "113--120", day = "30", month = jan, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Tsukuba, Sakura-mura, Jpn", classification = "721; C4210 (Formal logic)", corpsource = "Inst. of Inf. Sci. and Electron., Tsukuba Univ., Ibaraki, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; Context Free Grammars; context-free grammars; ELR-grammar; ELR-grammars; ELR-parser; ELR-parsing; extended context-free grammar; languages; lookahead; LR-parsers; LR-parsing; regular right part grammars", pubcountry = "Netherlands A09", subject = "F.4.2 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems, Grammar types \\ F.4.2 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems, Parsing", treatment = "T Theoretical or Mathematical", } @Article{Anderson:1987:PMP, author = "Richard Anderson and Ernst W. Mayr", title = "Parallelism and the maximal path problem", journal = j-INFO-PROC-LETT, volume = "24", number = "2", pages = "121--126", day = "30", month = jan, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q20 (05C35 05C38 90B10)", MRnumber = "88d:68031", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Stanford Univ, Stanford, CA, USA", classification = "722; 723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Stanford Univ., CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; computability; computational complexity; computer programming --- Algorithms; computer systems, digital --- Parallel Processing; Graph Theory; graph theory; lexicographically minimal maximal path; mathematical techniques; maximal path problem; NC algorithm; P-complete; p-completeness; parallel algorithms; planar graphs; verification", pubcountry = "Netherlands A10", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Path and circuit problems \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Complexity of proof procedures \\ F.1.3 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Reducibility and completeness \\ G.1.0 Mathematics of Computing, NUMERICAL ANALYSIS, General, Parallel algorithms", treatment = "T Theoretical or Mathematical", } @Article{Hoare:1987:WP, author = "C. A. R. Hoare and Jifeng He", title = "The weakest prespecification", journal = j-INFO-PROC-LETT, volume = "24", number = "2", pages = "127--132", day = "30", month = jan, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q99 (68N05)", MRnumber = "88f:68118", MRreviewer = "Bernhard Josko", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Oxford Univ, Computing Lab, Oxford, Engl", classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Comput. Lab., Oxford Univ., UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algebraic properties of prespecification; calculus of relations; computer metatheory; guarded command; program components; program correctness; programming language; programming theory; sequential composition; specification; theory; weakest precondition; weakest prespecification", pubcountry = "Netherlands A11", subject = "F.3.1 Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs", treatment = "T Theoretical or Mathematical", } @Article{Yannakakis:1987:MCS, author = "Mihalis Yannakakis and F{\u{a}}nic{\u{a}} Gavril", title = "The maximum $k$-colorable subgraph problem for chordal graphs", journal = j-INFO-PROC-LETT, volume = "24", number = "2", pages = "133--137", day = "30", month = jan, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (05C15 68R10)", MRnumber = "88f:68064", MRreviewer = "Charles J. Colbourn", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "AT\&T Bell Lab, Murray Hill, NJ, USA", classification = "723; 921; C1160 (Combinatorial mathematics); C1180 (Optimisation techniques); C4240 (Programming and algorithm theory)", corpsource = "AT and T Bell Labs., Murray Hill, NJ, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; chordal graphs; computability; computer programming --- Algorithms; connected maximum k-colorable subgraphs; graph colouring; Graph Theory; interval graphs; mathematical techniques; maximum induced tree; maximum k-colorable subgraph; maximum k-colorable subgraph problem; NP-hard; polynomial time; polynomially solvable; theory; trees (mathematics)", pubcountry = "Netherlands A12", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations", treatment = "T Theoretical or Mathematical", } @Article{Pujari:1987:CWC, author = "A. K. Pujari and S. Gupta", title = "Comment on: {``Worst-case choice for the stable marriage problem'' [Inform. Process. Lett. {\bf 21} (1985), no. 1, 27--30; MR 87b:68081] by D. Kapur and M. S. Krishnamoorthy}", journal = j-INFO-PROC-LETT, volume = "24", number = "2", pages = "139--139", day = "30", month = jan, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "90D35 (05A05 90C39)", MRnumber = "88f:90218", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See \cite{Kapur:1985:WCC}.", acknowledgement = ack-nhfb, classification = "C1140E (Game theory); C4240 (Programming and algorithm theory)", corpsource = "Sch. of Math. and Comput./Inf. Sci., Hyderabad Univ., India", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "arbitrary preferences; computational complexity; decision theory; notations; numbering; roles; stable marriage problem", pubcountry = "Netherlands A13", treatment = "T Theoretical or Mathematical", } @Article{Kubale:1987:CSI, author = "Marek Kubale", title = "The complexity of scheduling independent two-processor tasks on dedicated processors", journal = j-INFO-PROC-LETT, volume = "24", number = "3", pages = "141--147", day = "13", month = feb, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "90B35 (68N25 68Q15)", MRnumber = "89d:90119", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Technical Univ of Gdansk, Gdansk, Pol", classification = "722; 723; 913; C4240 (Programming and algorithm theory)", corpsource = "Inst. of Inf., Tech. Univ. of Gdansk, Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; approximation algorithms; computational complexity; computer programming --- Algorithms; computer systems, digital; dedicated processors; edge coloring; interval edge coloring; non-preemptive scheduling; nonpreemptable tasks; NP-completeness; NP-hard; parallel processing; polynomially solvable subcases; schedule length; Scheduling; scheduling; scheduling model; scheduling two-processor tasks; theory; two-processor task scheduling; verification", pubcountry = "Netherlands A01", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Complexity of proof procedures \\ F.1.3 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Reducibility and completeness \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sequencing and scheduling \\ G.1.2 Mathematics of Computing, NUMERICAL ANALYSIS, Approximation", treatment = "T Theoretical or Mathematical", } @Article{Krentel:1987:NTB, author = "Mark W. Krentel", title = "A note on the transaction backout problem", journal = j-INFO-PROC-LETT, volume = "24", number = "3", pages = "149--152", day = "13", month = feb, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68P15", MRnumber = "88d:68013", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Cornell Univ, Ithaca, NY, USA", classification = "723; 921; C1180 (Optimisation techniques); C4240 (Programming and algorithm theory); C4250 (Database theory); C6160B (Distributed DBMS)", corpsource = "Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; data-redundant distributed database; database fault tolerance; database systems; Distributed; distributed databases; dynamic programming; failures; fault tolerant computing; fixed-size database; mathematical programming, dynamic; mathematical techniques --- Graph Theory; NP-complete; polynomial time; theory; transaction backout problem; verification", pubcountry = "Netherlands A02", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Network problems \\ C.2.4 Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Distributed Systems, Distributed databases", treatment = "T Theoretical or Mathematical", } @Article{Anstee:1987:PAM, author = "Richard P. Anstee", title = "A polynomial algorithm for $b$-matchings: an alternative approach", journal = j-INFO-PROC-LETT, volume = "24", number = "3", pages = "153--157", day = "13", month = feb, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q20 (05C70 90B10 90C27)", MRnumber = "88d:68032", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of British Columbia, Vancouver, BC, Can", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Math., British Columbia Univ., Vancouver, BC, Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; b-matching problem; b-matchings; computational complexity; computer programming; graph theory; half-integral optimal solution; mathematical techniques --- Graph Theory; polynomial algorithm; strongly polynomial minimum cost flow algorithm", pubcountry = "Netherlands A03", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms", treatment = "T Theoretical or Mathematical", } @Article{Roussille:1987:GCP, author = "M. Roussille and P. Dufour", title = "Generation of convex polygons with individual angular constraints", journal = j-INFO-PROC-LETT, volume = "24", number = "3", pages = "159--164", day = "13", month = feb, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68U05", MRnumber = "88d:68101", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Ministere de l'Education Natl et de la Culture Fran{\c{c}}aise, Mons, Belg", classification = "723; 921; C4190 (Other numerical methods); C4240 (Programming and algorithm theory)", corpsource = "Fac. des Sci., Univ. de l'Etat, Mons, Belgium", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; angular constraints; complexity; computational complexity; computational geometry; computer programming; convex polygon generation; convex polygons; geometry; mathematical techniques --- Geometry; theory", pubcountry = "Netherlands A04", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations \\ I.3.5 Computing Methodologies, COMPUTER GRAPHICS, Computational Geometry and Object Modeling, Geometric algorithms, languages, and systems", treatment = "T Theoretical or Mathematical", } @Article{McColl:1987:PRB, author = "W. F. McColl and M. S. Paterson", title = "The planar realization of {Boolean} functions", journal = j-INFO-PROC-LETT, volume = "24", number = "3", pages = "165--170", day = "13", month = feb, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "94C10 (06E30 68Q15)", MRnumber = "88c:94031", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Oxford Univ, Oxford, Engl", classification = "721; 723; C4230 (Switching theory)", corpsource = "Programming Res. Group, Oxford Univ., UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Boolean function; Boolean Functions; Boolean functions; computer metatheory; logic circuits; planar circuit; planar realization; planar realization of Boolean functions; theory; upper bounds; verification", pubcountry = "Netherlands A05", subject = "F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Unbounded-action devices \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Path and circuit problems", treatment = "T Theoretical or Mathematical", } @Article{Huynh:1987:SHP, author = "D{\~u}ng T. Hu{\`y}nh", title = "On solving hard problems by polynomial-size circuits", journal = j-INFO-PROC-LETT, volume = "24", number = "3", pages = "171--176", day = "13", month = feb, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q15 (03D15)", MRnumber = "89a:68072", MRreviewer = "Norbert Blum", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Iowa State Univ, Ames, IA, USA", annote = "The original paper has no accents on the author name, but MathSciNet does. Perhaps the journal typesetting system lacked the needed accents.", classification = "721; 723; C4210 (Formal logic); C4220 (Automata theory); C4230 (Switching theory); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Iowa State Univ., Ames, IA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; boolean circuits; Boolean functions; Church-randomness; complexity core; computational complexity; computer metatheory; formal languages; generalized Kolmogorov complexity theory; immunity; Kolmogorov complexity; languages; logic circuits; nonuniform complexity class of languages; polynomial-size circuit families; polynomial-size circuits; switching circuits; theory; verification; VLSI complexity", pubcountry = "Netherlands A06", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Path and circuit problems \\ F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Classes defined by grammars or automata \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Complexity of proof procedures", treatment = "T Theoretical or Mathematical", } @Article{Grune:1987:HCI, author = "Dick Grune", title = "How to compare the incomparable", journal = j-INFO-PROC-LETT, volume = "24", number = "3", pages = "177--181", day = "13", month = feb, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Free Univ, Amsterdam, Neth", classification = "723; C1160 (Combinatorial mathematics); C4200 (Computer theory)", corpsource = "Dept. of Math. and Comput. Sci., Free Univ., Amsterdam, Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "compiler construction; computer operating systems --- Program Compilers; computer programming; decision making; decision theory; dimension theory; gauge-theory; source languages; theory", pubcountry = "Netherlands A07", subject = "F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Decision problems", treatment = "T Theoretical or Mathematical", } @Article{Castan:1987:SCA, author = "M. Castan and M.-H. Durand and M. {Lema{\^i} tre}", title = "A set of combinators for abstraction in linear space", journal = j-INFO-PROC-LETT, volume = "24", number = "3", pages = "183--188", day = "13", month = feb, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68N05 (03B40 68Q55)", MRnumber = "88d:68004", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "ONERA, Toulouse, Fr", classification = "723; C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "Dept. d'Etudes et de Recherches en Inf., ONERA-CERT, Toulouse, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "abstraction algorithms; Algorithms; automata theory; combinator code; combinator expression; combinator graph reduction machine; combinatorial mathematics; combinators; compiler theory combinator code; complexity; computational complexity; computer metatheory --- Programming Theory; computer programming; functional programming; graph reduction machine instructions; indexed combinators; linear abstraction algorithm; program compilers; programming theory; reduction machine instruction set", pubcountry = "Netherlands A08", subject = "G.2.1 Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics, Combinatorial algorithms \\ F.1.3 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Reducibility and completeness", treatment = "T Theoretical or Mathematical", } @Article{vanLeijenhorst:1987:RCT, author = "D. C. {Van Leijenhorst} and Th. P. {Van der Weide}", title = "On a recursion connected with tree balancing algorithms", journal = j-INFO-PROC-LETT, volume = "24", number = "3", pages = "189--192", day = "13", month = feb, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68P10 (68Q25)", MRnumber = "88d:68006", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Catholic Univ, Nijmegen, Neth", classification = "723; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Fac. of Math. and Natural Sci., Catholic Univ., Nijmegen, Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; balanced trees; binary search trees; computational complexity; computer programming --- Algorithms; data processing; Data Structures; dynamic tree balancing; median sort; recurrence relation; recursions; theory; time complexity; tree balancing algorithms; trees (mathematics); verification", pubcountry = "Netherlands A09", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees \\ F.3.3 Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Program and recursion schemes", treatment = "T Theoretical or Mathematical", } @Article{Akman:1987:ADO, author = "Varol Akman", title = "An algorithm for determining an opaque minimal forest of a convex polygon", journal = j-INFO-PROC-LETT, volume = "24", number = "3", pages = "193--198", day = "13", month = feb, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68U05 (05C05 68Q20)", MRnumber = "88d:68094", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Utrecht, Utrecht, Neth", classification = "723; 921; C1160 (Combinatorial mathematics); C1180 (Optimisation techniques); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Utrecht Univ., Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; complexity; computational complexity; computational geometry; computer programming; convex polygon; dynamic programming; Euclidean plane; line segments; mathematical techniques --- Geometry; minimal spanning tree; minimum weight triangulation; opaque minimal forest; spanning trees; Steiner trees; theory; trees (mathematics); triangulation; verification", pubcountry = "Netherlands A10", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations", treatment = "T Theoretical or Mathematical", } @Article{Raynal:1987:DAP, author = "Michel Raynal", title = "A distributed algorithm to prevent mutual drift between $n$ logical clocks", journal = j-INFO-PROC-LETT, volume = "24", number = "3", pages = "199--202", day = "13", month = feb, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "IRISA, Rennes, Fr", classification = "723; C4230 (Switching theory); C4240 (Programming and algorithm theory)", corpsource = "IRISA, Rennes I Univ., France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; computer programming; computer systems, digital --- Distributed; correctness; distributed algorithm; distributed algorithms; distributed processing; logical clock pulse; logical clocks pulse control; logical time; performance; synchronisation; verification", pubcountry = "Netherlands A11", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems", treatment = "T Theoretical or Mathematical", } @Article{Pitt:1987:NEK, author = "Leonard Pitt", title = "A Note on Extending {Knuth}'s Tree Estimator to Directed Acyclic Graphs", journal = j-INFO-PROC-LETT, volume = "24", number = "3", pages = "203--206", day = "13", month = feb, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68P10", MRnumber = "88e:68020", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Harvard Univ, Cambridge, MA, USA", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Aiken Comput. Lab., Harvard Univ., Cambridge, MA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm theory; algorithms; Algorithms; backtrack search; backtrack-search; computer programming; directed acyclic graphs; directed graphs; Knuth tree estimation; mathematical techniques --- Graph Theory; performance; random walk; tree estimates; trees (mathematics)", pubcountry = "Netherlands A12", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms", treatment = "T Theoretical or Mathematical", } @Article{Evans:1987:ESB, author = "D. J. Evans and W. S. Yousif", title = "Explicit solution of block tridiagonal systems of linear equations", journal = j-INFO-PROC-LETT, volume = "24", number = "3", pages = "207--209", day = "13", month = feb, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "65F05 (65L10 65W05)", MRnumber = "88b:65044", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Loughborough Univ of Technology, Loughborough, Engl", classification = "723; 921; C4130 (Interpolation and function approximation); C4140 (Linear algebra); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Studies, Loughborough Univ. of Technol., UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; block tridiagonal matrix; block tridiagonal solver; block tridiagonal systems; boundary-value problems; computer programming --- Algorithms; explicit solution; finite element analysis; finite element discretisation; finite elements; Linear Algebra; linear equations; mathematical techniques; matrix algebra; parallel algorithms; two-point boundary value problem", pubcountry = "Netherlands A13", subject = "F.2.1 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Computations on matrices \\ G.1.3 Mathematics of Computing, NUMERICAL ANALYSIS, Numerical Linear Algebra, Linear systems (direct and iterative methods) \\ G.1.7 Mathematics of Computing, NUMERICAL ANALYSIS, Ordinary Differential Equations, Boundary value problems", treatment = "T Theoretical or Mathematical", } @Article{Bazewicz:1987:MMW, author = "J. Bazewicz and G. Finke", title = "Minimizing mean weighted execution time loss on identical and uniform processors", journal = j-INFO-PROC-LETT, volume = "24", number = "4", pages = "A259--A263", day = "??", month = mar, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4230 (Switching theory); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Tech. Univ. of Poznan, Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "complexity analysis; computational complexity; deterministic scheduling; linear programming; minimizing mean weighted execution time loss; network flow technique; parallel algorithms; scheduling; scheduling with deadlines; strongly polynomial algorithm; upper bounds", pubcountry = "Netherlands A11", treatment = "T Theoretical or Mathematical", } @Article{VanDeSnepscheut:1987:AFG, author = "Jan L. A. {Van De Snepscheut}", title = "{``Algorithms for on-the-fly garbage collection''} revisited", journal = j-INFO-PROC-LETT, volume = "24", number = "4", pages = "211--216", day = "2", month = mar, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Groningen Univ, Groningen, Neth", classification = "722; 723; C4240 (Programming and algorithm theory); C6120 (File organisation); C6150J (Operating systems)", corpsource = "Dept. of Math. and Comput. Sci., Groningen Univ., Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; computer programming; computer systems, digital --- Parallel Processing; invariant; on-the-fly garbage collection; parallel algorithms; parallel program; program verification; storage management; verification", pubcountry = "Netherlands A01", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems \\ D.3.3 Software, PROGRAMMING LANGUAGES, Language Constructs, Concurrent programming structures", treatment = "T Theoretical or Mathematical", } @Article{Pawagi:1987:CDP, author = "Shaunak R. Pawagi and P. S. Gopalakrishnan and I. V. Ramakrishnan", title = "Computing dominators in parallel", journal = j-INFO-PROC-LETT, volume = "24", number = "4", pages = "217--221", day = "2", month = mar, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q20 (05-04 05C20 68R10)", MRnumber = "88e:68045a", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See also corrigendum \cite{Pawagi:1987:CCD}.", acknowledgement = ack-nhfb, affiliationaddress = "State Univ of New York at Stony Brook, Stony Brook, NY, USA", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; computational complexity; computer programming; computer systems, digital --- Parallel Processing; directed acyclic graph; directed acyclic graphs; directed graphs; dominators; fast parallel algorithm; mathematical techniques --- Graph Theory; n-vertex directed graph; O(P/sub t/(n)) processors; parallel algorithms; parallel random access machine; processor complexity; simultaneous reads; theory; time complexity; transitive closure; verification", pubcountry = "Netherlands A02", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms \\ G.1.0 Mathematics of Computing, NUMERICAL ANALYSIS, General, Parallel algorithms \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Complexity of proof procedures", treatment = "T Theoretical or Mathematical", } @Article{vanLeijenhorst:1987:NFS, author = "D. C. {Van Leijenhorst}", title = "A note on the formula size of the `$\bmod k$' functions", journal = j-INFO-PROC-LETT, volume = "24", number = "4", pages = "223--224", day = "2", month = mar, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q20 (11T99 11Y99 94C10)", MRnumber = "88f:68048", MRreviewer = "Ingo Wegener", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Catholic Univ of Nijmegen, Nijmegen, Neth", classification = "723; C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Math., Catholic Univ. of Nijmegen, Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Boolean Functions; Boolean functions; computational complexity; computer metatheory; finite fields; formula complexity; formula size; mod K functions; short proof; symmetric Boolean functions; theory", pubcountry = "Netherlands A03", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures", treatment = "T Theoretical or Mathematical", } @Article{Zubair:1987:TES, author = "M. Zubair and B. B. Madan", title = "Time efficient systolic architecture for matrix*vector multiplication", journal = j-INFO-PROC-LETT, volume = "24", number = "4", pages = "225--231", day = "2", month = mar, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C5120 (Logic and switching circuits); C5220 (Computer architecture); C5230 (Digital arithmetic methods)", corpsource = "Centre for Appl. Res. in Electron., Indian Inst. of Technol., New Delhi, India", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "carry-save adder stages; computational complexity; data throughput; digital arithmetic; matrix algebra; matrix*vector multiplication; modified systolic array architecture; multiplier; parallel architectures; pipelining; throughput rate; vector size; word length", pubcountry = "Netherlands A04", treatment = "T Theoretical or Mathematical", } @Article{Bini:1987:LBT, author = "Dario Bini and Victor Ya. Pan", title = "A logarithmic {Boolean} time algorithm for parallel polynomial division", journal = j-INFO-PROC-LETT, volume = "24", number = "4", pages = "233--237", day = "2", month = mar, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (11Y16 12-04 65W05)", MRnumber = "88e:68048", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Pisa, Pisa, Italy", classification = "723; 921; C4240 (Programming and algorithm theory); C5230 (Digital arithmetic methods)", corpsource = "Dept. of Math., Pisa Univ., Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; binary segmentation; Boolean circuit complexity; Boolean logarithmic time; circuit complexity; computational complexity; computer programming; computer systems, digital --- Parallel Processing; digital arithmetic; integer division; integer polynomials; interpolation; logarithmic boolean time algorithm; mathematical techniques --- Polynomials; matrix algebra; parallel algorithms; parallel computational complexity; parallel polynomial division; parallel time complexity; polynomial quotient; polynomial remainder; polynomials; sequential time complexity; theory; triangular Toeplitz matrix inversion; verification", pubcountry = "Netherlands A05", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Complexity of proof procedures \\ F.2.1 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Computations on polynomials \\ G.1.1 Mathematics of Computing, NUMERICAL ANALYSIS, Interpolation", treatment = "P Practical", } @Article{Edenbrandt:1987:CGR, author = "Anders Edenbrandt", title = "Chordal graph recognition is in {NC}", journal = j-INFO-PROC-LETT, volume = "24", number = "4", pages = "239--241", day = "2", month = mar, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (05C99 68R10)", MRnumber = "88e:68049", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Dartmouth Coll, Hanover, NH, USA", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Math. and Comput. Sci., Dartmouth Coll., Hanover, NH, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; chordal graph recognition; computational complexity; computer programming; computer systems, digital --- Parallel Processing; fast parallel recognition algorithm; graph separator; graph theory; mathematical techniques --- Graph Theory; parallel algorithms; separator; theory; undirected graph; verification", pubcountry = "Netherlands A06", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms \\ I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms", treatment = "T Theoretical or Mathematical", } @Article{Ramanan:1987:OLB, author = "Prakash Ramanan", title = "Obtaining lower bounds using artificial components (fixed order algebraic decision tree model)", journal = j-INFO-PROC-LETT, volume = "24", number = "4", pages = "243--246", day = "2", month = mar, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (68U05)", MRnumber = "88c:68052", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of California, Santa Barbara, CA, USA", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., California Univ., Santa Barbara, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algebraic decision tree; computational complexity; computer metatheory; connected components; convex polygon inclusion problem; decision theory; fixed order algebraic decision tree model; geometric decision problems; lower bound; lower bounds; mathematical techniques --- Trees; Max gap problem; path testing problem; theory; trees (mathematics); verification", pubcountry = "Netherlands A07", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms", treatment = "T Theoretical or Mathematical", } @Article{Carlsson:1987:VHA, author = "Svante Carlsson", title = "A variant of {Heapsort} with almost optimal number of comparisons", journal = j-INFO-PROC-LETT, volume = "24", number = "4", pages = "247--250", day = "2", month = mar, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Lund Univ, Lund, Swed", classification = "723; C4240 (Programming and algorithm theory); C6130 (Data handling techniques)", corpsource = "Dept. of Comput. Sci., Lund Univ., Sweden", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; computational complexity; computer programming; computer systems programming --- Sorting; heapsort; in-place sorting algorithm; performance; sorting", pubcountry = "Netherlands A08", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching", treatment = "T Theoretical or Mathematical", } @Article{Golumbic:1987:GMA, author = "Martin Charles Golumbic", title = "A general method for avoiding cycling in a network", journal = j-INFO-PROC-LETT, volume = "24", number = "4", pages = "251--253", day = "2", month = mar, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "AT\&T Bell Lab, USA", classification = "718; 723; 921; B0250 (Combinatorial mathematics); B6150 (Communication system theory); C1160 (Combinatorial mathematics); C4230 (Switching theory)", corpsource = "Meyer Adv. Technol. Center, IBM Israel Sci. Center, Haifa, Israel", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; computer networks; computer programming; cycling; dynamic nonhierarchical routing; dynamic routing; Euclidean plane; finding alternative routes; graph theory; limited locals search; mathematical techniques --- Graph Theory; message routing; partially damaged communications network; simple path; sparse network; switching theory; telecommunication systems; theory; verification", pubcountry = "Netherlands A09", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Routing and layout \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Network problems", treatment = "T Theoretical or Mathematical", } @Article{deLemosMeira:1987:SCF, author = "Silvio Romero {de Lemos Meira}", title = "Strict Combinators", journal = j-INFO-PROC-LETT, volume = "24", number = "4", pages = "255--258", day = "2", month = mar, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Federal Univ of Pernambuco, Recife, Braz", classification = "723; C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Federal Univ. of Pernambuco, Recife, Brazil", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; bc-chains; combinator machine performance; computer metatheory; computer programming languages; function parameter passing Turner combinators; functional programming languages; Miranda; performance; programming languages; programming theory; purely functional programming languages; strict combinators; strictness analysis; Theory; theory", pubcountry = "Netherlands A10", subject = "G.2.1 Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics, Combinatorial algorithms", treatment = "T Theoretical or Mathematical", } @Article{Blazewicz:1987:MMW, author = "J. B{\l}a\.zewicz and G. Finke", title = "Minimizing mean weighted execution time loss on identical and uniform processors", journal = j-INFO-PROC-LETT, volume = "24", number = "4", pages = "259--263", day = "2", month = mar, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68N25 (68Q25 90B35 90C35)", MRnumber = "88e:68015", bibdate = "Sat Apr 11 12:24:20 MDT 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Technical Univ of Poznan, Poznan, Pol", classification = "722; 723; 913; 921", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "complexity analysis; computer programming --- Algorithms; computer systems, digital; deterministic scheduling; mathematical programming, linear; mean weighted execution time loss; Scheduling; theory; verification", subject = "D.4.1 Software, OPERATING SYSTEMS, Process Management, Scheduling \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sequencing and scheduling", } @Article{Horspool:1987:CEO, author = "R. Nigel Horspool and Michael R. Levy", title = "Correctness of an extended operator-precedence parsing algorithm", journal = j-INFO-PROC-LETT, volume = "24", number = "4", pages = "265--273", day = "2", month = mar, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Victoria, Victoria, BC, Can", classification = "721; 723; C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Victoria Univ., BC, Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; computer programming --- Algorithms; context-free grammars; expression grammar; extended operator-precedence parsing algorithm; Grammars; languages; operator-precedence parser; operator-precedence parsing; parsing algorithms; program verification; theory; verification; verification algorithm", pubcountry = "Netherlands A12", subject = "F.4.2 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems, Parsing", treatment = "T Theoretical or Mathematical", } @Article{Ruby:1987:LPP, author = "Jonathan Ruby", title = "A liveness property of a parallel algorithm", journal = j-INFO-PROC-LETT, volume = "24", number = "4", pages = "275--277", day = "2", month = mar, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "AEP Software, Brookline, MA, USA", classification = "723; C4240 (Programming and algorithm theory); C6120 (File organisation); C6150J (Operating systems)", corpsource = "AEP Software, Brookline, MA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; computer programming; computer systems, digital --- Parallel Processing; concurrent garbage collection; data structures; DMLSS algorithm; garbage; garbage collection; Lisp-like environment; liveness; liveness properties; mutator; nodes; parallel algorithms; reachable; reachable nodes; storage management; theory; unreachable node; verification", pubcountry = "Netherlands A13", subject = "G.1.0 Mathematics of Computing, NUMERICAL ANALYSIS, General, Parallel algorithms", treatment = "T Theoretical or Mathematical", } @Article{Szwarcfiter:1987:NCC, author = "Jayme Luiz Szwarcfiter", title = "A note on the computation of the $k$-closure of a graph", journal = j-INFO-PROC-LETT, volume = "24", number = "4", pages = "279--280", day = "2", month = mar, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (05C99 68R10)", MRnumber = "88e:68054", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ Federal do Rio de Janeiro, Rio de Janeiro, Braz", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Nucleo de Computacao Electronica, Univ. Federal do Rio de Janeiro, Brazil", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; complexity; computational complexity; computer programming; graph; graph theory; Hamilton cycles; k-closure; mathematical techniques --- Graph Theory; theory", pubcountry = "Netherlands A14", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms", treatment = "T Theoretical or Mathematical", } @Article{Madlener:1987:USR, author = "Klaus Madlener and Friedrich Otto", title = "Using string-rewriting for solving the word problem for finitely presented groups", journal = j-INFO-PROC-LETT, volume = "24", number = "5", pages = "281--284", day = "16", month = mar, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q50 (03D03 03D40 20F10)", MRnumber = "88m:68036", MRreviewer = "Ronald V. Book", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ Kaiserslautern, Kaiserslautern, West Ger", classification = "721; 723; C4210 (Formal logic)", corpsource = "Fachbereich Inf., Kaiserslautern Univ., West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; computer programming languages --- Theory; confluence; finitely presented groups; formal languages; Formal Languages; languages; monoid presentation; Noetherian; string-rewriting; theory; verification; word problem", pubcountry = "Netherlands A01", subject = "F.4.2 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems, Decision problems", treatment = "T Theoretical or Mathematical", } @Article{Asano:1987:SPB, author = "Takao Asano and Tetsuo Asano and Hiroshi Imai", title = "Shortest path between two simple polygons", journal = j-INFO-PROC-LETT, volume = "24", number = "5", pages = "285--288", day = "16", month = mar, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68U05 (52-04 68Q25)", MRnumber = "88b:68177", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Sophia Univ, Tokyo, Jpn", classification = "714; 723; 921; C4190 (Other numerical methods); C4240 (Programming and algorithm theory)", corpsource = "Sophia Univ., Tokyo, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; computational complexity; computational geometry; computer metatheory; computer programming --- Algorithms; disjoint simple polygons; Geometry; integrated circuits, LSI --- Computer Aided Design; large scale integration; layout design; linear-time algorithm; LSI; mathematical techniques; mutually disjoint simple polygons; shortest path; source polygon; target polygon; theory; verification; wire routing design", pubcountry = "Netherlands A02", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Path and circuit problems", treatment = "T Theoretical or Mathematical", } @Article{Atkinson:1987:CNM, author = "M. D. Atkinson and H. W. Chang", title = "Computing the number of mergings with constraints", journal = j-INFO-PROC-LETT, volume = "24", number = "5", pages = "289--292", day = "16", month = mar, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Carleton Univ, Ottawa, Ont, Can", classification = "723; C4240 (Programming and algorithm theory); C6130 (Data handling techniques)", corpsource = "Sch. of Comput. Sci., Carleton Univ., Ottawa, Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; Catalan numbers; computational complexity; computer metatheory; computer programming --- Algorithms; computer systems programming; Fibonacci numbers; list merging; list processing; Merging; merging; mergings; mergings with constraints; time complexity; verification", pubcountry = "Netherlands A03", subject = "G.1.6 Mathematics of Computing, NUMERICAL ANALYSIS, Optimization, Constrained optimization \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sequencing and scheduling \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching", treatment = "T Theoretical or Mathematical", } @Article{Hazari:1987:DAD, author = "Cyrus Hazari and Hussein Zedan", title = "A distributed algorithm for distributed termination", journal = j-INFO-PROC-LETT, volume = "24", number = "5", pages = "293--297", day = "16", month = mar, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See comments \cite{Tel:1987:CDA}.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Bristol, Bristol, Engl", classification = "723; C6150J (Operating systems)", corpsource = "Dept. of Electr. and Electron. Eng., Bristol Univ., UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; computer programming; computer systems, digital --- Distributed; concurrency; deadlock avoidance; distributed algorithm; distributed termination; multiprocessing programs; ring networks; system recovery; theory; verification", pubcountry = "Netherlands A04", subject = "C.2.5 Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Local Networks, Rings \\ C.2.4 Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Distributed Systems \\ H.2.4 Information Systems, DATABASE MANAGEMENT, Systems, Distributed systems \\ H.2.2 Information Systems, DATABASE MANAGEMENT, Physical Design, Deadlock avoidance", treatment = "T Theoretical or Mathematical", } @Article{Koch:1987:ASC, author = "Gregers Koch", title = "Automating the semantic component", journal = j-INFO-PROC-LETT, volume = "24", number = "5", pages = "299--305", day = "16", month = mar, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Copenhagen, Copenhagen, Den", classification = "723; C4210 (Formal logic)", corpsource = "Inst. of Datalogy, Copenhagen Univ., Denmark", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computational semantics; computer metatheory; computer programming --- Algorithms; first-order logic; formal logic; grammars; languages; logico-semantic; logico-semantic representation; parsing; semantic analysis; semantic component; semantic phenomena; textual analysis; textual synthesis; theory", pubcountry = "Netherlands A05", subject = "F.3.2 Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages \\ D.3.1 Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory, Semantics \\ F.4.2 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems, Parsing \\ I.2.7 Computing Methodologies, ARTIFICIAL INTELLIGENCE, Natural Language Processing, Text analysis", treatment = "T Theoretical or Mathematical", } @Article{Hirschberg:1987:IUQ, author = "D. S. Hirschberg and Dennis James Volper", title = "Improved Update\slash Query Algorithms for the Interval Valuation Problem", journal = j-INFO-PROC-LETT, volume = "24", number = "5", pages = "307--310", day = "16", month = mar, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of California at Irvine, Irvine, CA, USA", classification = "723; C4240 (Programming and algorithm theory); C6120 (File organisation)", corpsource = "Dept. of Info. and Comput. Sci., California Univ., Irvine, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; commutative group; commutative semigroup; computational complexity; computer programming --- Algorithms; data processing --- Data Structures; data structure; data structures; database systems; interval valuation problem; performance; query algorithms; query languages; range trees; semigroup problem; Theory; time complexity; update algorithms; update/query algorithms", pubcountry = "Netherlands A06", subject = "E.1 Data, DATA STRUCTURES \\ F.2.m Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Miscellaneous \\ H.2.4 Information Systems, DATABASE MANAGEMENT, Systems, Query processing", treatment = "T Theoretical or Mathematical", } @Article{Chang:1987:CS, author = "Ernest J. H. Chang and Gaston H. Gonnet and Doron Rotem", title = "On the costs of self-stabilization", journal = j-INFO-PROC-LETT, volume = "24", number = "5", pages = "311--316", day = "16", month = mar, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Alberta Research Council, Calgary, Alberta, Can", classification = "723; C6150J (Operating systems)", corpsource = "Alberta Res. Council, Calgary, Alta., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; computer programming; computer systems, digital --- Distributed; concurrent programming; distributed control; distributed systems; fault tolerant computing; k-state algorithm; loosely coupled processors; multiprocessing programs; performance; self-stabilization; software reliability; theory; verification", pubcountry = "Netherlands A07", subject = "C.2.4 Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Distributed Systems \\ D.4.7 Software, OPERATING SYSTEMS, Organization and Design, Distributed systems", treatment = "T Theoretical or Mathematical", } @Article{Valentine:1987:ASL, author = "Mark Valentine and Robert H. Davis", title = "The automated solution of logic puzzles", journal = j-INFO-PROC-LETT, volume = "24", number = "5", pages = "317--324", day = "16", month = mar, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Heriot-Watt Univ, Edinburgh, Scotl", classification = "723; C4210 (Formal logic); C4240 (Programming and algorithm theory); C6110 (Systems analysis and programming)", corpsource = "Dept. of Comput. Sci., Heriot-Watt Univ., Edinburgh, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; automated solution; computer metatheory --- Formal Logic; computer programming; formal logic; logic programming; logic puzzles; programming theory", pubcountry = "Netherlands A08", subject = "I.2.1 Computing Methodologies, ARTIFICIAL INTELLIGENCE, Applications and Expert Systems, Games \\ I.2.4 Computing Methodologies, ARTIFICIAL INTELLIGENCE, Knowledge Representation Formalisms and Methods, Relation systems \\ I.2.1 Computing Methodologies, ARTIFICIAL INTELLIGENCE, Applications and Expert Systems, Natural language interfaces \\ C.0 Computer Systems Organization, GENERAL, Hardware/software interfaces", treatment = "T Theoretical or Mathematical", } @Article{Chrobak:1987:RSM, author = "Marek Chrobak and Wojciech Rytter", title = "Remarks on string-matching and one-way multihead automata", journal = j-INFO-PROC-LETT, volume = "24", number = "5", pages = "325--329", day = "16", month = mar, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q20 (68Q05 68Q25)", MRnumber = "88f:68043", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Warsaw Univ, Warsaw, Pol", classification = "721; 723; C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "Inst. of Inf., Warsaw Univ., Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; complexity; computational complexity; computer metatheory; multihead automata; one-way multihead automata; string-matching; theory; verification", pubcountry = "Netherlands A09", subject = "F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Automata \\ F.1.3 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Pattern matching", treatment = "T Theoretical or Mathematical", } @Article{Tennent:1987:NUE, author = "R. D. Tennent", title = "A note on undefined expression values in programming logics", journal = j-INFO-PROC-LETT, volume = "24", number = "5", pages = "331--333", day = "16", month = mar, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Edinburgh, Edinburgh, Scotl", classification = "723; C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Edinburgh Univ., UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer metatheory; computer programming languages; formal logic; logic programming; programming language; programming logics; programming theory; theory; Theory; undefined expression values; verification", pubcountry = "Netherlands A10", subject = "F.3.1 Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs, Logics of programs \\ D.3.1 Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory, Semantics \\ D.3.3 Software, PROGRAMMING LANGUAGES, Language Constructs, Abstract data types", treatment = "T Theoretical or Mathematical", } @Article{Widmayer:1987:TSO, author = "Peter Widmayer and Derick Wood", title = "Time- and space-optimal contour computation for a set of rectangles", journal = j-INFO-PROC-LETT, volume = "24", number = "5", pages = "335--338", day = "16", month = mar, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68U05 (52-04 68Q25)", MRnumber = "88d:68102", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ Karlsruhe, Karlsruhe, West Ger", classification = "723; 921; C4190 (Other numerical methods); C4240 (Programming and algorithm theory)", corpsource = "Inst. f{\"u}r Angewandte Info. und Formale Beschreibungsverfahren, Karlsruhe Univ., West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; complexity; computational complexity; computational geometry; computer programming; contour computation; disjoint polygons; mathematical techniques --- Geometry; rectangles; space-optimal algorithm; theory; time optimal algorithm; verification", pubcountry = "Netherlands A11", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations \\ G.1.6 Mathematics of Computing, NUMERICAL ANALYSIS, Optimization", treatment = "T Theoretical or Mathematical", } @Article{Dillencourt:1987:TSC, author = "Michael B. Dillencourt", title = "Traveling salesman cycles are not always subgraphs of {Delaunay} triangulations or of minimum weight triangulations", journal = j-INFO-PROC-LETT, volume = "24", number = "5", pages = "339--342", day = "16", month = mar, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68U05 (90B10)", MRnumber = "88e:68099", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Computer Technology Associates Inc, McLean, VA, USA", classification = "921; C1160 (Combinatorial mathematics); C1290 (Applications of systems theory)", corpsource = "Comput. Technol. Associates, Inc., McLean, VA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Delaunay triangulations; Euclidean traveling salesman cycle; Graph Theory; graph theory; Hamiltonian; mathematical programming; mathematical techniques; minimum weight triangulations; operations research; subgraphs; theory; traveling salesman cycles; verification; Voronoi diagrams", pubcountry = "Netherlands A12", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Path and circuit problems", treatment = "T Theoretical or Mathematical", } @Article{Kennaway:1987:VAS, author = "J. R. Kennaway and M. R. Sleep", title = "Variable abstraction in {$O(n\log n)$} space", journal = j-INFO-PROC-LETT, volume = "24", number = "5", pages = "343--349", day = "16", month = mar, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (03B40 68N05 68Q55)", MRnumber = "88m:68022", MRreviewer = "Dorothy Bollman", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of East Anglia, Norwich, Engl", classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Sch. of Inf. Syst., East Anglia Univ., Norwich, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "complexity; computational complexity; computer programming --- Algorithms; computer programming languages; director string translation; functional programming; lambda-calculus; lambda-expression; programming theory; Theory; theory; tree representation; turner combinators; variable abstraction; verification", pubcountry = "Netherlands A13", subject = "F.4.1 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Lambda calculus and related systems \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Complexity of proof procedures", treatment = "T Theoretical or Mathematical", } @Article{Muller:1987:SNU, author = "Heinrich M{\"u}ller", title = "Sorting Numbers Using Limited Systolic Coprocessors", journal = j-INFO-PROC-LETT, volume = "24", number = "6", pages = "351--354", day = "6", month = apr, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ Karlsruhe, Karlsruhe, West Ger", classification = "714; 723; C4240 (Programming and algorithm theory); C6130 (Data handling techniques)", corpsource = "Inst. f{\"u}r Inf. I, Karlsruhe Univ., West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; comparison-based lower bound; computational complexity; computer programming --- Algorithms; computer systems programming; computer systems, digital --- Parallel Processing; integrated circuits, VLSI --- Applications; limited systolic coprocessors; parallel algorithms; probabilistic algorithm; probabilistic algorithms; real numbers; restricted parallelism; Sorting; sorting; sorting numbers; systolic coprocessors; verification", pubcountry = "Netherlands A01", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching \\ F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Probabilistic computation", treatment = "T Theoretical or Mathematical", } @Article{Gottlob:1987:SNF, author = "Georg Gottlob", title = "On the size of nonredundant {FD}-covers", journal = j-INFO-PROC-LETT, volume = "24", number = "6", pages = "355--360", day = "6", month = apr, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Stanford Univ, Stanford, CA, USA", classification = "723; C4250 (Database theory); C6160D (Relational DBMS)", corpsource = "Dept. of Comput. Sci., Stanford Univ., CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "cardinality; database systems; database theory; equivalent nonredundant covers; functional dependencies; functional dependency; minimum cover; nonredundant FD-covers; optimal cover; redundancy; Relational; relational databases; theory; verification", pubcountry = "Netherlands A02", subject = "H.2.m Information Systems, DATABASE MANAGEMENT, Miscellaneous \\ H.2.1 Information Systems, DATABASE MANAGEMENT, Logical Design, Schema and subschema", treatment = "T Theoretical or Mathematical", } @Article{Szepietowski:1987:TNF, author = "Andrzej Szepietowski", title = "There are no fully space constructible functions between $\log \log n$ and $\log n$", journal = j-INFO-PROC-LETT, volume = "24", number = "6", pages = "361--362", day = "6", month = apr, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q15 (03D15)", MRnumber = "88m:68017", MRreviewer = "Klaus W. Wagner", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Technical Univ Gdansk, Gdansk, Pol", classification = "721; 723; C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Math., Tech. Univ. Gdansk, Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory --- Turing Machines; computational complexity; computer metatheory; fully space constructible; functions; natural numbers; space complexity; space constructible functions; theory; Turing machine; Turing machines; verification", pubcountry = "Netherlands A03", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Complexity of proof procedures \\ F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Bounded-action devices", treatment = "T Theoretical or Mathematical", } @Article{Parberry:1987:ISS, author = "Ian Parberry", title = "An improved simulation of space and reversal bounded deterministic {Turing} machines by width and depth bounded uniform circuits", journal = j-INFO-PROC-LETT, volume = "24", number = "6", pages = "363--367", day = "6", month = apr, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "03D15 (68Q15)", MRnumber = "88k:03089", MRreviewer = "Andreas Brandst{\"a}dt", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Pennsylvania State Univ, University Park, PA, USA", classification = "721; 723; C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Pennsylvania State Univ., University Park, PA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; bounded deterministic Turing machines; bounded uniform circuits; computer simulation; deterministic automata; deterministic k-tape Turing machine; deterministic Turing machines; extended parallel computation; k-tape Turing machine; parallel algorithms; parallel computation; performance; resource bounds; reversal bounded; shared-memory machine; theory; Turing Machines; Turing machines; uniform circuits; verification", pubcountry = "Netherlands A04", subject = "F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Bounded-action devices \\ I.6.4 Computing Methodologies, SIMULATION AND MODELING, Model Validation and Analysis \\ F.1.3 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Reducibility and completeness", treatment = "T Theoretical or Mathematical", } @Article{Samet:1987:DPC, author = "Hanan Samet and Clifford A. Shaffer and Robert E. Webber", title = "Digitizing the plane with cells of nonuniform size", journal = j-INFO-PROC-LETT, volume = "24", number = "6", pages = "369--375", day = "6", month = apr, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Maryland, College Park, MD, USA", classification = "723; 921; C4190 (Other numerical methods); C6130B (Graphics techniques)", corpsource = "Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; computational geometry; computer graphics; computer programming; digital geometry; geometric algorithms; mathematical techniques --- Geometry; nonuniform size; quadtree decomposition; raster-type data; theory; vector-type data; verification", pubcountry = "Netherlands A05", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations \\ I.3.3 Computing Methodologies, COMPUTER GRAPHICS, Picture/Image Generation, Digitizing and scanning", treatment = "T Theoretical or Mathematical", } @Article{Blumer:1987:ORL, author = "Anselm Blumer and Andrzej Ehrenfeucht and David Haussler and Manfred K. Warmuth", title = "{Occam}'s Razor", journal = j-INFO-PROC-LETT, volume = "24", number = "6", pages = "377--380", day = "6", month = apr, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Denver, Denver, CO, USA", classification = "723; C1240 (Adaptive system theory)", corpsource = "Dept. of Math., Denver Univ., CO, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; complexity; computational complexity; computer programming --- Algorithms; inductive inference; learning systems; Learning Systems; machine learning; minimum hypothesis; Occam's Razor; Occam's razor; polynomial learning algorithm; polynomial-time method; systems science and cybernetics; theory; verification", pubcountry = "Netherlands A06", subject = "F.2.1 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Computations on polynomials \\ I.2.6 Computing Methodologies, ARTIFICIAL INTELLIGENCE, Learning, Induction", treatment = "T Theoretical or Mathematical", } @Article{Bajantri:1987:FMM, author = "M. Bajantri and David B. Skillicorn", title = "A fast multiprocessor message passing implementation", journal = j-INFO-PROC-LETT, volume = "24", number = "6", pages = "381--389", day = "6", month = apr, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Queen's Univ, Kingston, Ont, Can", classification = "723; C6150J (Operating systems)", corpsource = "Dept. of Comput., Queen's Univ., Kingston, Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer operating systems; computer systems, digital --- Multiprocessing; design; distributed operating systems; interprocessor messages; loosely coupled multiprocessor; measurement; message passing; message passing times; multiprocessing programs; multiprocessor message passing; operating systems (computers); performance; process allocation; transparent interprocess communication", pubcountry = "Netherlands A07", subject = "C.1.2 Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors) \\ D.4.0 Software, OPERATING SYSTEMS, General, UNIX", treatment = "P Practical", } @Article{Fraser:1987:OAE, author = "Christopher W. Fraser and David R. Hanson", title = "Optimization of argument evaluation order", journal = j-INFO-PROC-LETT, volume = "24", number = "6", pages = "391--395", day = "6", month = apr, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Arizona, Tucson, AZ, USA", classification = "723; 921; C1180 (Optimisation techniques); C4240 (Programming and algorithm theory); C6140 (Programming languages)", corpsource = "Dept. of Comput. Sci., Arizona Univ., Tucson, AZ, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "argument evaluation order; code generation; computer programming languages; expression evaluation; machine-dependencies; object code; optimisation; optimization; optimizations; peephole optimisation; peephole optimization; programming languages; programming theory; source code; Theory", pubcountry = "Netherlands A08", subject = "D.3.4 Software, PROGRAMMING LANGUAGES, Processors, Optimization", treatment = "T Theoretical or Mathematical", } @Article{Marie:1987:NEP, author = "Raymond Marie and Kishor S. Trivedi", title = "A note on the effect of preemptive policies on the stability of a priority queue", journal = j-INFO-PROC-LETT, volume = "24", number = "6", pages = "397--401", day = "6", month = apr, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ de Rennes, Rennes, Fr", classification = "913; 922; C1140C (Queueing theory); C5470 (Performance evaluation and testing)", corpsource = "IRISA, Rennes Univ., France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "M/G/1; performance; performance evaluation; preemptive policies; preemptive scheduling; priority queue; probability; queueing system; Queueing Theory; queueing theory; scheduling; stability", pubcountry = "Netherlands A09", subject = "G.m Mathematics of Computing, MISCELLANEOUS, Queueing theory \\ D.4.1 Software, OPERATING SYSTEMS, Process Management, Scheduling \\ H.2.4 Information Systems, DATABASE MANAGEMENT, Systems, Transaction processing", treatment = "T Theoretical or Mathematical", } @Article{Wright:1987:NES, author = "William E. Wright", title = "A note on external sorting using almost single input buffering", journal = j-INFO-PROC-LETT, volume = "24", number = "6", pages = "403--405", day = "6", month = apr, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Southern Illinois Univ, Carbondale, IL, USA", classification = "723; C6120 (File organisation); C6130 (Data handling techniques)", corpsource = "Dept. of Comput. Sci., Southern Illinois Univ., Carbondale, IL, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; almost single input buffering; computer programming --- Algorithms; computer systems programming; external sorting; file organisation; Merging; merging; performance; single input buffering; sorting; standard internal merging", pubcountry = "Netherlands A10", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching \\ D.4.4 Software, OPERATING SYSTEMS, Communications Management, Buffering", treatment = "P Practical", } @Article{Sridhar:1987:NAP, author = "M. K. Sridhar", title = "A new algorithm for parallel solution of linear equations", journal = j-INFO-PROC-LETT, volume = "24", number = "6", pages = "407--412", day = "6", month = apr, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "65W05 (65F05)", MRnumber = "89a:65205", MRreviewer = "Mari{\'a}n Vajter{\v{s}}ic", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Indian Inst of Science, Bangalore, India", classification = "723; 921; C4140 (Linear algebra); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Electr. Eng., Indian Inst. of Sci., Bangalore, India", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; computer programming; computer systems, digital --- Parallel Processing; Cramer's Rule; elimination method; equations; linear algebra; linear equations; mathematical techniques --- Matrix Algebra; parallel algorithm; parallel algorithms; parallel Cramer's rule; Parallel Cramer's Rule; parallel solution; PCR", pubcountry = "Netherlands A11", subject = "G.1.3 Mathematics of Computing, NUMERICAL ANALYSIS, Numerical Linear Algebra, Linear systems (direct and iterative methods) \\ F.2.1 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Computations on matrices \\ F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism", treatment = "T Theoretical or Mathematical", } @Article{Edelsbrunner:1987:ZRR, author = "Herbert Edelsbrunner and Mark H. Overmars", title = "Zooming by repeated range detection", journal = j-INFO-PROC-LETT, volume = "24", number = "6", pages = "413--417", day = "6", month = apr, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68U05 (52-04 68Q20)", MRnumber = "88g:68103", MRreviewer = "D. T. Lee", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Illinois, Urbana, IL, USA", classification = "723; 921; C4190 (Other numerical methods); C4240 (Programming and algorithm theory); C6130B (Graphics techniques)", corpsource = "Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; computational complexity; computational geometry; computer graphics; computer programming --- Algorithms; mathematical techniques --- Geometry; nearest neighbor searching; query time; range queries; range searching; repeated range detection; repeated range search; theory; verification; window; zooming", pubcountry = "Netherlands A12", subject = "I.3.5 Computing Methodologies, COMPUTER GRAPHICS, Computational Geometry and Object Modeling, Geometric algorithms, languages, and systems \\ I.4.8 Computing Methodologies, IMAGE PROCESSING, Scene Analysis, Range data \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems", treatment = "T Theoretical or Mathematical", } @Article{Chang:1987:SOC, author = "Jik H. Chang and Oscar H. Ibarra and Bala Ravikumar and Leonard Berman", title = "Some observations concerning alternating {Turing} machines using small space", journal = j-INFO-PROC-LETT, volume = "25", number = "1", pages = "1--9", day = "20", month = apr, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q05 (03D10 03D15 68Q15)", MRnumber = "88e:68026", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See also erratum \cite{Chang:1988:ESO}.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Minnesota, Minneapolis, MN, USA", classification = "721; C4220 (Automata theory)", corpsource = "Dept. of Comput. Sci., Minnesota Univ., Minneapolis, MN, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "alternating Turing machines; automata theory; low tape bounds; nondeterministic Turing machines; off-line machines; performance; small space; space bounds; strongly space-bounded; theory; Turing Machines; Turing machines; verification; weakly space-bounded", pubcountry = "Netherlands A01", subject = "F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Bounded-action devices", treatment = "T Theoretical or Mathematical", } @Article{Melkman:1987:LCC, author = "Avraham A. Melkman", title = "On-line construction of the convex hull of a simple polyline", journal = j-INFO-PROC-LETT, volume = "25", number = "1", pages = "11--12", day = "20", month = apr, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68U05 (52-04 68P05 68Q20)", MRnumber = "88f:68134", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Ben Gurion Univ of the Negev, Beer Sheva, Isr", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Ben Gurion Univ., of the Negev, Beer Sheva, Israel", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm theory; Algorithms; algorithms; computational geometry; computer programming; convex hull; hull vertices; intermediate storage; mathematical programming, linear; mathematical techniques --- Geometry; simple polygon; simple polyline; stack; vertices", pubcountry = "Netherlands A02", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations", treatment = "T Theoretical or Mathematical", } @Article{Kirsig:1987:SRS, author = "Bernd Kirsig and Klaus-J{\"o}rn J. Lange", title = "Separation with the {Ruzzo}, {Simon}, and {Tompa} relativization implies {${\sc Dspace}(\log n)\not= {\sc Nspace}(\log n)$}", journal = j-INFO-PROC-LETT, volume = "25", number = "1", pages = "13--15", day = "20", month = apr, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q15 (03D15 68Q05)", MRnumber = "88m:68015", MRreviewer = "Ronald V. Book", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ Hamburg, Hamburg, West Ger", classification = "721; 723; C4220 (Automata theory)", corpsource = "Fachbereich Inf., Hamburg Univ., West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory --- Turing Machines; computational complexity; computer metatheory; nondeterminism; nondeterministic Turing machines; oracle-computations; oracle-hierarchy; relativization; theory; Turing machines; verification", pubcountry = "Netherlands A03", subject = "F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Relativized computation \\ F.1.3 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Relations among complexity classes", treatment = "T Theoretical or Mathematical", } @Article{Hamlet:1987:PCT, author = "Richard G. Hamlet", title = "Probable correctness theory", journal = j-INFO-PROC-LETT, volume = "25", number = "1", pages = "17--25", day = "20", month = apr, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Oregon Graduate Cent, Beaverton, OR, USA", classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Dept of Comput. Sci. and Eng., Oregon Graduate Center, Beaverton, OR, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer programming --- Program Debugging; computer software; confidence; confidence theory; decision theory; measurement; partition testing; performance; probable correctness; program sampling; program testing; program verification; random testing; reliability; software; software reliability; Testing; testing; textual sampling; verification", pubcountry = "Netherlands A04", subject = "D.2.4 Software, SOFTWARE ENGINEERING, Program Verification, Reliability \\ D.2.5 Software, SOFTWARE ENGINEERING, Testing and Debugging, Debugging aids", treatment = "T Theoretical or Mathematical", } @Article{Howell:1987:ADB, author = "Rodney R. Howell and Louis E. Rosier and Hsu-Chun Yen", title = "An ${O}(n^{1.5})$ algorithm to decide boundedness for conflict-free vector replacement systems", journal = j-INFO-PROC-LETT, volume = "25", number = "1", pages = "27--33", day = "20", month = apr, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q90 (68Q25)", MRnumber = "88j:68131", MRreviewer = "Boles{\l}aw Miko{\l}ajczak", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Texas at Austin, Austin, TX, USA", classification = "723; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Texas Univ., Austin, TX, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; boundedness; boundedness problem; computational complexity; computer metatheory; computer programming; conflict-free VASs; conflict-free vector replacement systems; graph theory; Petri nets; polynomial time algorithm; theory; vector addition system; vector replacement system; verification", pubcountry = "Netherlands A05", subject = "G.1.7 Mathematics of Computing, NUMERICAL ANALYSIS, Ordinary Differential Equations, Boundary value problems", treatment = "T Theoretical or Mathematical", } @Article{Cybenko:1987:FHE, author = "George Cybenko and David W. Krumme and K. N. Venkataraman", title = "Fixed Hypercube embedding", journal = j-INFO-PROC-LETT, volume = "25", number = "1", pages = "35--39", day = "20", month = apr, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q15 (68Q25 68R10)", MRnumber = "88h:68025", MRreviewer = "A. L. Rosenberg", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Tufts Univ, Medford, MA, USA", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Tufts Univ., Medford, MA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computational complexity; computational geometry; computer metatheory; fixed hypercube embedding; fixed-size hypercube; graph; graph embedding; Graph Theory; graph theory; hypercube embedding; mathematical techniques; NP-complete; NP-completeness; theory; verification", pubcountry = "Netherlands A06", subject = "F.1.3 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Reducibility and completeness \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms", treatment = "T Theoretical or Mathematical", } @Article{Laumond:1987:OGN, author = "Jean-Paul P. Laumond", title = "Obstacle growing in a nonpolygonal world", journal = j-INFO-PROC-LETT, volume = "25", number = "1", pages = "41--50", day = "20", month = apr, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68U05 (52-04)", MRnumber = "89a:68208", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "CNRS, Toulouse, Fr", classification = "723; 921; C1250 (Pattern recognition); C4240 (Programming and algorithm theory)", corpsource = "Labs. d'Automat. et d'Anal. des Syst., CNRS., Toulouse, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithmic complexity; arcs; collision-free path finding; combination geometry; combinatorial geometry; computational geometry; computer programming --- Algorithms; Geometry; line segments; mathematical techniques; Minkowski sums; nonpolygonal world; obstacle growing; path finding; pattern recognition; robotics; robots; theory; verification", pubcountry = "Netherlands A07", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms", treatment = "T Theoretical or Mathematical", } @Article{Naor:1987:FPC, author = "Joseph Naor", title = "A fast parallel coloring of planar graphs with five colors", journal = j-INFO-PROC-LETT, volume = "25", number = "1", pages = "51--53", day = "20", month = apr, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "05C15 (68Q25)", MRnumber = "88h:05042", MRreviewer = "T. R. S. Walsh", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Hebrew Univ of Jerusalem, Jerusalem, Isr", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Hebrew Univ of Jerusalem, Israel", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; coloring algorithm; computational complexity; computer metatheory; computer programming --- Algorithms; computer systems, digital --- Parallel Processing; fast parallel coloring; five colors; graph colouring; Graph Theory; independent vertices; mathematical techniques; parallel algorithms; parallel coloring; parallel time complexity; planar graphs; polylog time; theory; verification", pubcountry = "Netherlands A08", subject = "G.1.0 Mathematics of Computing, NUMERICAL ANALYSIS, General, Parallel algorithms \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms", treatment = "T Theoretical or Mathematical", } @Article{Wang:1987:TPA, author = "Cao An Wang and Yung H. Tsin", title = "An {$O(\log n)$} time parallel algorithm for triangulating a set of points in the plane", journal = j-INFO-PROC-LETT, volume = "25", number = "1", pages = "55--60", day = "20", month = apr, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Alberta, Edmonton, Alberta, Can", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept of Comput. Sci., Alberta Univ., Edmonton, Alta., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; computational complexity; computational geometry; computer metatheory; computer programming; computer systems, digital --- Parallel Processing; convex hull; CREW PRAM; mathematical techniques --- Geometry; O(log n) time; parallel algorithm; parallel algorithms; read conflicts; set of points; SIMD model; theory; time-processor product; topology; triangulating; triangulation of set of points; triangulation problem; verification", pubcountry = "Netherlands A09", subject = "G.1.0 Mathematics of Computing, NUMERICAL ANALYSIS, General, Parallel algorithms \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations \\ D.4.2 Software, OPERATING SYSTEMS, Storage Management, Allocation/deallocation strategies", treatment = "T Theoretical or Mathematical", } @Article{Hyslop:1987:PDP, author = "Gary A. Hyslop and Edmund A. Lamagna", title = "Performance of distributive partitioned sort in a demand paging environment", journal = j-INFO-PROC-LETT, volume = "25", number = "1", pages = "61--64", day = "20", month = apr, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Rhode Island, Kingston, RI, USA", classification = "723; C4240 (Programming and algorithm theory); C6130 (Data handling techniques)", corpsource = "Dept. of Comput. Sci. and Stat., Rhode Island Univ., Kingston, RI, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer programming --- Algorithms; computer systems programming; computer systems, digital --- Distributed; demand paging; demand paging environment; distributive partitioned sort; image size; page faulting; performance; performance evaluation; programming theory; quicksort; real memory; Sorting; sorting; theory", pubcountry = "Netherlands A10", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching", treatment = "T Theoretical or Mathematical", } @Article{Reif:1987:TAD, author = "John H. Reif", title = "A topological approach to dynamic graph connectivity", journal = j-INFO-PROC-LETT, volume = "25", number = "1", pages = "65--70", day = "20", month = apr, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68R10 (05C40 68P05 68Q25)", MRnumber = "89a:68178", MRreviewer = "Roberto Tamassia", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Harvard Univ, Cambridge, MA, USA", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Aiken Comput. Lab., Harvard Univ., Cambridge, MA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; computational complexity; computational geometry; computer programming --- Algorithms; dynamic algorithm; dynamic graph connectivity; edges; graph algorithm; graph modifications; Graph Theory; graph theory; mathematical techniques; O(ng+n log n ) time algorithm; planar graph; theory; topological approach; verification; vertices", pubcountry = "Netherlands A11", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms", treatment = "T Theoretical or Mathematical", } @Article{Hoare:1987:PDR, author = "C. A. R. Hoare and Jifeng He and J. W. Sanders", title = "Prespecification in data refinement", journal = j-INFO-PROC-LETT, volume = "25", number = "2", pages = "71--76", day = "6", month = may, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q65", MRnumber = "88j:68115", MRreviewer = "A. V. An\={\i}s\={\i}mov", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Oxford Univ, Oxford, Engl", classification = "723; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory); C6120 (File organisation)", corpsource = "Oxford Univ., UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer metatheory --- Programming Theory; computer programming; concrete data type; data refinement; data structures; data type; nondeterministic procedural programming language; postspecification; prespecification; programming theory; set theory; Theory; theory; verification; weakest specification", pubcountry = "Netherlands A01", subject = "D.3.3 Software, PROGRAMMING LANGUAGES, Language Constructs, Abstract data types \\ D.3.3 Software, PROGRAMMING LANGUAGES, Language Constructs, Data types and structures", treatment = "T Theoretical or Mathematical", } @Article{Katajainen:1987:LET, author = "Jyrki Katajainen and Olli Nevalainen and Jukka Teuhola", title = "A linear expected-time algorithm for computing planar relative neighbourhood graphs", journal = j-INFO-PROC-LETT, volume = "25", number = "2", pages = "77--86", day = "6", month = may, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q20 (68U05)", MRnumber = "88e:68044", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Turku, Turku, Finl", classification = "723; 921; C1160 (Combinatorial mathematics); C4190 (Other numerical methods); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Turku Univ., Finland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; cell organization; computational complexity; computational geometry; computer programming --- Algorithms; Graph Theory; graph theory; homogeneous planar Poisson point process; linear expected-time algorithm; mathematical techniques; planar graphs; planar point set; quadratic worst case running time; relative neighborhood graph; relative neighbourhood graph; supergraph; theory; verification", pubcountry = "Netherlands A02", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations", treatment = "T Theoretical or Mathematical", } @Article{Atallah:1987:EAC, author = "Mikhail Atallah and Chanderjit Bajaj", title = "Efficient algorithms for common transversals", journal = j-INFO-PROC-LETT, volume = "25", number = "2", pages = "87--91", day = "6", month = may, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68U05 (68Q20)", MRnumber = "88f:68132", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Purdue Univ, West Lafayette, IN, USA", classification = "723; 921; C4190 (Other numerical methods); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Purdue Univ., West Lafayette, IN, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; common transversals; computational complexity; computational geometry; computer programming; Davenport--Schinzel sequences; mathematical techniques --- Geometry; O(n \log n) time; O(n log n gamma (n)) time algorithm; straight line; theory; verification", pubcountry = "Netherlands A03", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms", treatment = "T Theoretical or Mathematical", } @Article{Broy:1987:PSF, author = "Manfred Broy", title = "Predicative Specifications for Functional Programs Describing Communicating Networks", journal = j-INFO-PROC-LETT, volume = "25", number = "2", pages = "93--101", day = "6", month = may, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q60 (03B70 68N99 68Q55)", MRnumber = "88h:68060", MRreviewer = "David B. Benson", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Passau, Passau, West Ger", classification = "723; C4210 (Formal logic); C4230 (Switching theory); C4240 (Programming and algorithm theory); C5620 (Computer networks and techniques); C7410F (Communications)", corpsource = "Fakultat f{\"u}r Math. und Inf., Passau Univ., West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "communicating networks; computer programming; computer programming languages; functional programs; infinite nondeterministic data flow networks; integrated functional language; nondeterministic function; predicative specification language; program design; program verification; programming languages; programming theory; recursive declaration; specification languages; theory; verification", pubcountry = "Netherlands A04", subject = "F.3.1 Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs, Logics of programs \\ D.3.1 Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory, Semantics \\ F.3.1 Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs, Specification techniques", treatment = "T Theoretical or Mathematical", } @Article{Lakshmanan:1987:TMD, author = "K. B. Lakshmanan and N. Meenakshi and K. Thulasiraman", title = "A time-optimal message-efficient distributed algorithm for depth-first-search", journal = j-INFO-PROC-LETT, volume = "25", number = "2", pages = "103--109", day = "6", month = may, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Indian Inst of Technology, Madras, India", classification = "723; C1160 (Combinatorial mathematics); C4230 (Switching theory); C4240 (Programming and algorithm theory); C4250 (Database theory); C5620 (Computer networks and techniques); C6130 (Data handling techniques); C6160B (Distributed DBMS)", corpsource = "Dept. of Comput. Sci. and Eng., Indian Inst. of Technol., Madras, India", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "2m messages; 2n-2 time units; Algorithms; algorithms; asynchronous communication network; communication graph; computational complexity; computer programming; computer systems, digital --- Distributed; data handling; depth-first-search tree; distributed algorithm; distributed processing; graph theory; message complexity; theory; time complexity; time-optimal algorithm; time-optimal message-efficient distributed algorithm; worst case complexity", pubcountry = "Netherlands A05", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching \\ C.2.1 Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Architecture and Design, Network communications \\ C.2.1 Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Architecture and Design, Distributed networks", treatment = "T Theoretical or Mathematical", } @Article{Frieze:1987:PAF, author = "A. M. Frieze", title = "Parallel algorithms for finding {Hamilton} cycles in random graphs", journal = j-INFO-PROC-LETT, volume = "25", number = "2", pages = "111--117", day = "6", month = may, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q20 (05C45 05C80 68Q25 68R10)", MRnumber = "88m:68019", MRreviewer = "Narsingh Deo", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of London, London, Engl", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci. and Stat., London Univ., UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; computer programming --- Algorithms; computer systems, digital --- Parallel Processing; Graph Theory; graph theory; Hamilton cycles; mathematical techniques; P-RAM; parallel algorithms; random graphs; theory; time complexity; verification", pubcountry = "Netherlands A06", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Path and circuit problems", treatment = "T Theoretical or Mathematical", } @Article{Maley:1987:OCC, author = "F. Miller Maley", title = "An observation concerning constraint-based compaction", journal = j-INFO-PROC-LETT, volume = "25", number = "2", pages = "119--122", day = "6", month = may, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "MIT, Cambridge, MA, USA", classification = "714; 723; B0250 (Combinatorial mathematics); B1130B (Computer-aided circuit analysis and design); C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory); C7410D (Electronic engineering)", corpsource = "Lab. for Comput. Sci., MIT., Cambridge, MA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; circuit layout CAD; component displacements; computational geometry; Computer Aided Design; computer programming --- Algorithms; constraint graph; constraint system; constraint-based compaction; design rules; graph theory; integrated circuits, VLSI; theory; time complexity; VLSI; VLSI layout compaction", pubcountry = "Netherlands A07", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Path and circuit problems \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Routing and layout", treatment = "T Theoretical or Mathematical", } @Article{Rayward-Smith:1987:CPS, author = "V. J. Rayward-Smith", title = "The complexity of preemptive scheduling given interprocessor communication delays", journal = j-INFO-PROC-LETT, volume = "25", number = "2", pages = "123--125", day = "6", month = may, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of East Anglia, Norwich, Engl", classification = "722; 723; 913; C4230 (Switching theory); C4240 (Programming and algorithm theory); C5440 (Multiprocessor systems and techniques); C6150J (Operating systems)", corpsource = "Sch. of Inf. Syst., East Anglia Univ., Norwich, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; communication; computational complexity; computer programming --- Algorithms; computer systems, digital; decision problem; delays; heuristic programming; interprocessor communication delays; Multiprocessing; multiprocessing systems; NP-complete; NP-completeness; optimal schedule; polynomial time; preemptive scheduling; scheduling; scheduling --- Optimization; supervisory programs; theory", pubcountry = "Netherlands A08", subject = "D.4.1 Software, OPERATING SYSTEMS, Process Management, Scheduling \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sequencing and scheduling", treatment = "T Theoretical or Mathematical", } @Article{Boppana:1987:DCN, author = "Ravi B. Boppana and Johan H{\aa}stad and Stathis Zachos", title = "Does {co-NP} have short interactive proofs?", journal = j-INFO-PROC-LETT, volume = "25", number = "2", pages = "127--132", day = "6", month = may, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q15", MRnumber = "88g:68031", MRreviewer = "Klaus W. Wagner", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "MIT, Cambridge, MA, USA", classification = "723; 921; C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Math., MIT, Cambridge, MA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "AM(Q); complexity class co-NP; complexity class NP; computability; computational complexity; computer metatheory; graph isomorphism; graph theory; interactive proof; IP(Q); mathematical techniques --- Graph Theory; NP-completeness; polynomial-time hierarchy; probabilistic computation; prover; randomized interactive proofs; theory; verification; verifier", pubcountry = "Netherlands A09", subject = "F.1.3 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Relations among complexity classes \\ F.1.3 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Complexity hierarchies", treatment = "T Theoretical or Mathematical", } @Article{Tennent:1987:QAL, author = "R. D. Tennent", title = "Quantification in {Algol}-like languages", journal = j-INFO-PROC-LETT, volume = "25", number = "2", pages = "133--137", day = "6", month = may, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Edinburgh, Edinburgh, Scotl", classification = "723; C4210 (Formal logic); C6140D (High level languages)", corpsource = "Dept. of Comput. Sci., Edinburgh Univ., UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "ALGOL; Algol-like languages; ALGOL-like languages; algorithmic languages; computer metatheory; computer programming languages; formal languages; formal logic; lambda expression; languages; predicate logic; programming languages; quantification; quantified formulas; syntactic sugar; syntax; theory; Theory; variable-declaration blocks", pubcountry = "Netherlands A10", subject = "D.3.1 Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory, Syntax \\ D.3.3 Software, PROGRAMMING LANGUAGES, Language Constructs, Abstract data types", treatment = "T Theoretical or Mathematical", } @Article{Mints:1987:CSD, author = "G. Mints and E. Tyugu", title = "Corrigendum: {``Semantics of a declarative language''} {[Inform. Process. Lett. {\bf 23}(3), 22 October 1997, pp. 147--151]}", journal = j-INFO-PROC-LETT, volume = "25", number = "2", pages = "139--139", day = "6", month = may, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q55 (03B20 03B70)", MRnumber = "88e:68079b", bibdate = "Sat Apr 11 12:24:20 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See \cite{Mints:1986:SDL}.", acknowledgement = ack-nhfb, fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "languages", subject = "D.3.1 Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory, Semantics", } @Article{Toyama:1987:CTD, author = "Yoshihito Toyama", title = "Counterexamples to termination for the direct sum of term rewriting systems", journal = j-INFO-PROC-LETT, volume = "25", number = "3", pages = "141--143", day = "29", month = may, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q50 (68T15)", MRnumber = "88e:68071", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "NTT, Musashino, Jpn", classification = "723; C4210 (Formal logic)", corpsource = "Dept. of Inf. Sci., NTT Electr. Commun. Labs., Tokyo, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer metatheory; direct sum; disjoint sets; formal languages; function symbols; languages; term rewriting systems; termination; theory", pubcountry = "Netherlands A01", subject = "F.4.2 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems, Grammar types", treatment = "T Theoretical or Mathematical", } @Article{Verjus:1987:PDA, author = "J. Pierre Verjus", title = "On the proof of a distributed algorithm", journal = j-INFO-PROC-LETT, volume = "25", number = "3", pages = "145--147", day = "29", month = may, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See comments \cite{VanGasteren:1990:CPD,Pettersson:1991:LEC}.", acknowledgement = ack-nhfb, affiliationaddress = "Inst de Recherche en Informatique et Syst{\`e}mes Al{\'e}atoires, Rennes, Fr", classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Inst. de Recherche en Inf. et Syst. Al{\'e}atoires, Rennes, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "ad absurdum reasoning; algorithm theory; Algorithms; algorithms; computer programming; computer systems, digital --- Distributed; correctness proof; distributed algorithm; distributed processing; elementary automata; invariance property; reductio ad absurdum; termination detection; theorem proving; theory; verification", pubcountry = "Netherlands A02", subject = "C.2.1 Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Architecture and Design, Distributed networks \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Complexity of proof procedures", treatment = "T Theoretical or Mathematical", } @Article{Dillencourt:1987:NHN, author = "Michael B. Dillencourt", title = "A non-{Hamiltonian}, nondegenerate {Delaunay} Triangulation", journal = j-INFO-PROC-LETT, volume = "25", number = "3", pages = "149--151", day = "29", month = may, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68U05 (05C45)", MRnumber = "88g:68101", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Maryland, College Park, MD, USA", classification = "921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computational geometry; Delaunay triangulation; geometry; graph theory; Graph Theory; Hamiltonian; Hamiltonian graph; mathematical techniques; nondegenerate Delaunay triangulation; theory; verification; Voronoi diagram", pubcountry = "Netherlands A03", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Path and circuit problems \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations", treatment = "T Theoretical or Mathematical", } @Article{Lai:1987:DS, author = "Ten H. Lai and Tao H. Yang", title = "On distributed snapshots", journal = j-INFO-PROC-LETT, volume = "25", number = "3", pages = "153--158", day = "29", month = may, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Ohio State Univ, Columbus, OH, USA", classification = "723; C4240 (Programming and algorithm theory); C5470 (Performance evaluation and testing)", corpsource = "Dept. of Comput. and Inf. Sci., Ohio State Univ., Columbus, OH, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; computer programming; computer systems, digital --- Distributed; deadlock; deadlock detection; distributed processing; distributed snapshots; fault tolerant computing; programming theory; snapshot algorithm; stable properties; termination; termination detection; theory; verification", pubcountry = "Netherlands A04", subject = "C.2.4 Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Distributed Systems, Network operating systems \\ D.4.1 Software, OPERATING SYSTEMS, Process Management, Deadlocks", treatment = "T Theoretical or Mathematical", } @Article{Klapper:1987:LBC, author = "Andrew Klapper", title = "A lower bound on the complexity of the convex hull problem for simple polyhedra", journal = j-INFO-PROC-LETT, volume = "25", number = "3", pages = "159--161", day = "29", month = may, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Northeastern Univ, Boston, MA, USA", classification = "723; 921; C4240 (Programming and algorithm theory)", corpsource = "Coll. of Comput. Sci., Northeastern Univ., Boston, MA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; complexity; computational complexity; computational geometry; computer programming; convex hull problem; geometric complexity; integer sorting; lower bound; mathematical techniques --- Geometry; simple polyhedra; theory; verification; vertex set", pubcountry = "Netherlands A05", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations", treatment = "T Theoretical or Mathematical", } @Article{Babaoglu:1987:STD, author = "Ozalp Babaoglu", title = "Stopping times of distributed consensus protocols: {A} probabilistic analysis", journal = j-INFO-PROC-LETT, volume = "25", number = "3", pages = "163--169", day = "29", month = may, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Cornell Univ, Ithaca, NY, USA", classification = "722; 723; 922; B6150 (Communication system theory); B6210L (Computer communications); C4240 (Programming and algorithm theory); C5470 (Performance evaluation and testing); C5620 (Computer networks and techniques); C6150J (Operating systems)", corpsource = "Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Byzantine agreement; Byzantine Generals problem; computer networks --- Protocols; computer systems, digital; Distributed; distributed computing; distributed consensus protocols; distributed processing; fault tolerant computing; nonzero probability; probabilistic analysis; probabilistic failure; probability --- Applications; protocols; reliable computing; stopping times; system executions; theory; verification", pubcountry = "Netherlands A06", subject = "C.2.4 Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Distributed Systems, Network operating systems \\ D.4.7 Software, OPERATING SYSTEMS, Organization and Design, Distributed systems \\ H.2.4 Information Systems, DATABASE MANAGEMENT, Systems, Query processing", treatment = "T Theoretical or Mathematical", } @Article{Kawai:1987:LAI, author = "Satoru Kawai", title = "Local authentication in insecure environments", journal = j-INFO-PROC-LETT, volume = "25", number = "3", pages = "171--174", day = "29", month = may, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Tokyo, Tokyo, Jpn", classification = "723; B6120B (Codes); C6130 (Data handling techniques)", corpsource = "Dept. of Inf. Sci., Tokyo Univ., Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "codebreaking; cryptography; data processing --- Security of Data; faking; insecure environments; local authentication; local authentication mechanism; public key cryptosystem; system information; theory; user identifiers", pubcountry = "Netherlands A07", subject = "E.3 Data, DATA ENCRYPTION, Public key cryptosystems \\ E.3 Data, DATA ENCRYPTION, Data encryption standard (DES)", treatment = "T Theoretical or Mathematical", } @Article{Fischer:1987:ILK, author = "Michael J. Fischer and Neil Immerman", title = "Interpreting logics of knowledge in propositional dynamic logic with converse", journal = j-INFO-PROC-LETT, volume = "25", number = "3", pages = "175--181", day = "29", month = may, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q55 (03B70 68Q10 68Q15 68T30)", MRnumber = "89k:68095", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Yale Univ, New Haven, CT, USA", classification = "723; B6150 (Communication system theory); B6210L (Computer communications); C4210 (Formal logic); C5620 (Computer networks and techniques)", corpsource = "Dept. of Comput. Sci., Yale Univ., New Haven, CT, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "branching time; common knowledge; computer metatheory; computer systems, digital --- Distributed; converse; distributed processing; distributed systems; EXPTIME complete; Formal Logic; formal logic; knowledge; logic of knowledge; modal logic; propositional dynamic logic; protocol models; protocols; satisfiability; temporal logic; theory; verification", pubcountry = "Netherlands A08", subject = "H.2.4 Information Systems, DATABASE MANAGEMENT, Systems, Query processing \\ I.2.4 Computing Methodologies, ARTIFICIAL INTELLIGENCE, Knowledge Representation Formalisms and Methods", treatment = "T Theoretical or Mathematical", } @Article{Chung:1987:HSS, author = "Tae-Choong Chung and Jung-Wan Cho", title = "History sensitive string for multiple alphabets", journal = j-INFO-PROC-LETT, volume = "25", number = "3", pages = "183--188", day = "29", month = may, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Korea Advanced Inst of Science \& Technology, Seoul, South Korea", classification = "723; C6130 (Data handling techniques)", corpsource = "Dept. of Comput. Sci., Korea Adv. Inst. of Sci. and Technol., Seoul, South Korea", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "ASCII; BCD; character sets; code systems; codes, symbolic --- Encoding; coding methods; data processing; EBCDIC; encoding; English alphabet; high level language programs; history sensitive string; Japanese; Korean; Korean characters; multiple alphabets; theory; Word Processing", pubcountry = "Netherlands A09", subject = "E.4 Data, CODING AND INFORMATION THEORY", treatment = "P Practical", } @Article{Tse:1987:DUF, author = "T. H. Tse", title = "On the detection of unstructuredness in flowgraphs", journal = j-INFO-PROC-LETT, volume = "25", number = "3", pages = "189--193", day = "29", month = may, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Hong Kong, Hong Kong", classification = "723; 921; C6110 (Systems analysis and programming)", corpsource = "Centre of Comput. Studies and Appl., Hong Kong Univ., Hong Kong", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer programming; exits; flowcharting; flowgraphs; mathematical techniques --- Graph Theory; multiple entries; Structured Programming; structured programming; succession paths; theory; unstructuredness", pubcountry = "Netherlands A10", subject = "D.2.2 Software, SOFTWARE ENGINEERING, Tools and Techniques, Structured programming \\ D.2.2 Software, SOFTWARE ENGINEERING, Tools and Techniques, Flow charts", treatment = "P Practical", } @Article{Zobel:1987:TCF, author = "Dieter Z{\"o}bel", title = "Transformations for communication fairness in {CSP}", journal = j-INFO-PROC-LETT, volume = "25", number = "3", pages = "195--198", day = "29", month = may, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q10", MRnumber = "88e:68035", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6150J (Operating systems)", corpsource = "Seminar f{\"u}r Inf., EWH-Rheinland-Pfaltz, Koblenz, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "COMFAIR; communication fairness; CSP; distributed control mechanisms; I/O-guard problem; multiprocessing programs; programming theory; protocol communication; protocols; selection fairness", pubcountry = "Netherlands A11", treatment = "P Practical", } @Article{Alexandridis:1987:ESE, author = "N. A. Alexandridis and P. D. Tsanakas", title = "An Encoding Scheme for the Efficient Representation of Hierarchical Image Structures", journal = j-INFO-PROC-LETT, volume = "25", number = "3", pages = "199--206", day = "29", month = may, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "George Washington Univ, Washington, DC, USA", classification = "723; C5260 (Digital signal processing); C6120 (File organisation); C6130 (Data handling techniques)", corpsource = "Dept. of Electr. Eng. and Comput. Sci., George Washington Univ., Washington, DC, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; codes, symbolic --- Encoding; computerised picture processing; data processing --- Data Structures; data structures; efficient representation; encoding; encoding scheme; function calls; hierarchical image structures; Image Coding; image encoding; image processing; performance; reviews; short access time; storage requirements; theory; virtual pyramid structure", pubcountry = "Netherlands A12", subject = "I.4.2 Computing Methodologies, IMAGE PROCESSING, Compression (Coding) \\ I.2.10 Computing Methodologies, ARTIFICIAL INTELLIGENCE, Vision and Scene Understanding, Representations, data structures, and transforms", treatment = "G General Review; P Practical", } @Article{Morris:1987:VWL, author = "Joseph M. Morris", title = "Varieties of weakest liberal preconditions", journal = j-INFO-PROC-LETT, volume = "25", number = "3", pages = "207--210", day = "29", month = may, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ Coll Dublin, Dublin, Irel", classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Univ. Coll. Dublin, Ireland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "abort; chaos; computer metatheory; computer programming --- Theory; loop; program behaviour; Programming Theory; programming theory; robustness; semantics of programs; theory; w.l.p. semantics; weakest liberal precondition; weakest liberal preconditions; weakest precondition", pubcountry = "Netherlands A13", subject = "D.3.1 Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory, Semantics", treatment = "T Theoretical or Mathematical", } @Article{Autebert:1987:PIW, author = "Jean-Michel Autebert and Philippe Flajolet and Joaquim Gabarr{\'o}", title = "Prefixes of infinite words and ambiguous context-free languages", journal = j-INFO-PROC-LETT, volume = "25", number = "4", pages = "211--216", day = "17", month = jun, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q45", MRnumber = "88m:68027", MRreviewer = "Matti Linna", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ Paris VII, Paris, Fr", classification = "721; C4210 (Formal logic)", corpsource = "Lab. Inf. Theorique et Programmation, Paris Univ., France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "ambiguous context-free languages; automata theory; Context Free Languages; context-free languages; gap theorems; indicator functions; infinite words; languages; prefix language; prefixes; theory; verification", pubcountry = "Netherlands A01", subject = "F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Classes defined by grammars or automata \\ F.4.2 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems, Grammar types", treatment = "T Theoretical or Mathematical", } @Article{Brustmann:1987:CSF, author = "Bettina Brustmann and Ingo Wegener", title = "The complexity of symmetric functions in bounded-depth circuits", journal = j-INFO-PROC-LETT, volume = "25", number = "4", pages = "217--219", day = "17", month = jun, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q15", MRnumber = "88h:68024", MRreviewer = "Norbert Blum", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Johann Wolfgang Goethe-Univ, Frankfurt am Main, West Ger", classification = "721; 723; B1265B (Logic circuits); C4230B (Combinatorial switching theory)", corpsource = "Fachbereich 12 Math., Johann Wolfgang Goethe-Univ., Frankfurt am Main, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "bounded-depth circuits; combinational switching; combinatorial complexity measure; combinatorial switching; complexity; computational complexity; computer metatheory; logic circuits; sensitive complexity; symmetric functions; theory; verification", pubcountry = "Netherlands A02", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Path and circuit problems", treatment = "T Theoretical or Mathematical", } @Article{Ochmanski:1987:ICS, author = "Edward Ochmanski", title = "Inevitability in concurrent systems", journal = j-INFO-PROC-LETT, volume = "25", number = "4", pages = "221--225", day = "17", month = jun, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q10 (68Q90)", MRnumber = "88e:68034", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Polish Acad of Sciences, Warsaw, Pol", classification = "723; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Inst. of Comput. Sci., Polish Acad. of Sci., Warsaw, Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer metatheory; computer systems, digital --- Parallel Processing; concurrent systems; directed graphs; inevitability; inevitable sets; multiprocessing systems; partially ordered sets; Petri net; Petri nets; programming theory; set of system states; system states; theory; verification", pubcountry = "Netherlands A03", subject = "H.2.4 Information Systems, DATABASE MANAGEMENT, Systems, Distributed systems", treatment = "T Theoretical or Mathematical", } @Article{Kemp:1987:NNL, author = "Rainer Kemp", title = "A note on the number of leftist trees", journal = j-INFO-PROC-LETT, volume = "25", number = "4", pages = "227--232", day = "17", month = jun, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Johann Wolfgang Goethe-Univ, Frankfurt am Main, West Ger", classification = "723; 921; 922; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory); C6120 (File organisation)", corpsource = "Fachbereich Inf., Johann Wolfgang Goethe-Univ., Frankfurt am Main, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "combinational problems; combinatorial problems; computer programming --- Algorithms; computer systems programming --- Sorting; data processing; Data Structures; data structures; discrete mathematics; leftist trees; mathematical techniques --- Trees; merging; priority queues; probability --- Queueing Theory; theory; trees (mathematics); verification", pubcountry = "Netherlands A04", subject = "E.1 Data, DATA STRUCTURES, Trees \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees", treatment = "T Theoretical or Mathematical", } @Article{Wiltink:1987:DND, author = "J. G. Wiltink", title = "A deficiency of natural deduction", journal = j-INFO-PROC-LETT, volume = "25", number = "4", pages = "233--234", day = "17", month = jun, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "03B10 (68T99)", MRnumber = "88i:03020a", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See also comments \cite{Balsters:1987:CDN}.", acknowledgement = ack-nhfb, affiliationaddress = "Eindhoven Univ of Technology, Eindhoven, Neth", classification = "723; C4210 (Formal logic)", corpsource = "Dept. of Math. and Comput. Sci., Eindhoven Univ. of Technol., Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "artificial intelligence; computer metatheory; deduction system; formal languages; Formal Logic; formal logic; Gentzen's system; mathematical reasoning; natural deduction; predicate logic; theory", pubcountry = "Netherlands A05", subject = "I.2.3 Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Deduction", treatment = "T Theoretical or Mathematical", } @Article{Apostolico:1987:RHN, author = "Alberto Apostolico", title = "Remark on the {Hsu--Du} new algorithm for the longest common subsequence problem", journal = j-INFO-PROC-LETT, volume = "25", number = "4", pages = "235--236", day = "17", month = jun, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Purdue Univ, West Lafayette, IN, USA", classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Purdue Univ., West Lafayette, IN, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm theory; algorithms; Algorithms; analysis of algorithms; computer programming; Hsu-Du algorithm; longest common subsequence problem; programming theory; strings; time bounds", pubcountry = "Netherlands A06", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems", treatment = "T Theoretical or Mathematical", } @Article{Gries:1987:HRC, author = "David Gries and Adriano Pascoletti and Luigi Sbriz", title = "{Horner}'s rule and the computation of linear recurrences", journal = j-INFO-PROC-LETT, volume = "25", number = "4", pages = "237--240", day = "17", month = jun, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "11Y55 (11B37 11B39)", MRnumber = "88m:11113", MRreviewer = "Kenneth A. Jukes", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Cornell Univ, Ithaca, NY, USA", classification = "723; 921; C4170 (Differential equations); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; binary representation; computational complexity; computer programming --- Algorithms; Difference Equations; difference equations; exponentiation; Fibonacci numbers; Horner's rule; Horner's scheme; linear difference equation; linear recurrences; logarithmic algorithm; mathematical techniques; theory; verification", pubcountry = "Netherlands A07", subject = "G.1.3 Mathematics of Computing, NUMERICAL ANALYSIS, Numerical Linear Algebra, Linear systems (direct and iterative methods) \\ G.2.1 Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics, Recurrences and difference equations", treatment = "T Theoretical or Mathematical", } @Article{Goldberg:1987:PCC, author = "Andrew V. Goldberg and Serge A. Plotkin", title = "Parallel ($\delta + 1$)-Coloring of Constant-Degree Graphs", journal = j-INFO-PROC-LETT, volume = "25", number = "4", pages = "241--245", day = "17", month = jun, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "MIT, Cambridge, MA, USA", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Lab. for Comput. Sci., MIT, Cambridge, MA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; complexity bounds; computational complexity; computer programming --- Algorithms; computer systems, digital --- Parallel Processing; constant-degree graph; EREW PRAM; graph algorithms; graph coloring; graph colouring; Graph Theory; graphs; local communication; mathematical techniques; maximal independent set; parallel algorithms; theory; verification", pubcountry = "Netherlands A08", subject = "G.1.0 Mathematics of Computing, NUMERICAL ANALYSIS, General, Parallel algorithms \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms", treatment = "T Theoretical or Mathematical", } @Article{Levcopoulos:1987:LBN, author = "Christos Levcopoulos", title = "An {$\Omega(\sqrt{n})$} lower bound for the nonoptimality of the greedy triangulation", journal = j-INFO-PROC-LETT, volume = "25", number = "4", pages = "247--251", day = "17", month = jun, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Linkoping Univ, Linkoping, Swed", classification = "723; 921; C4190 (Other numerical methods)", corpsource = "Dept. of Comput. and Inf. Sci., Linkoping Univ., Sweden", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; approximately optimal triangulation; computational geometry; computer programming; greedy triangulation; lower bound; mathematical techniques --- Geometry; minimum weight triangulation; nonoptimality; theory; verification", pubcountry = "Netherlands A09", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations", treatment = "T Theoretical or Mathematical", } @Article{Reichling:1987:SSQ, author = "Matthias Reichling", title = "A simplified solution of the {$N$} queens' problem", journal = j-INFO-PROC-LETT, volume = "25", number = "4", pages = "253--255", day = "17", month = jun, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ Wuerzburg, Wuerzburg, West Ger", classification = "723; 921; C1140E (Game theory); C1160 (Combinatorial mathematics)", corpsource = "Lehrstuhl f{\"u}r Inf. I, Wurzburg Univ., West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer metatheory; game theory; mathematical techniques; N queens' problem; set theory; theory", pubcountry = "Netherlands A10", subject = "G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous", treatment = "T Theoretical or Mathematical", } @Article{Buda:1987:MA, author = "Anatoli{\u{\i}} O. Buda", title = "Multiprocessor automata", journal = j-INFO-PROC-LETT, volume = "25", number = "4", pages = "257--261", day = "17", month = jun, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q05 (03D05 68Q15 68Q45)", MRnumber = "88g:68026", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "BAN, Sofia, Bulg", classification = "721; 723; C4210 (Formal logic); C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "Inst. of Math., Sofia, Bulgaria", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; computer systems, digital --- Parallel Processing; Finite Automata; formal languages; formal languages hierarchy; multihead automaton; multiprocessor automata; multiprocessor automata languages; multiprocessor automation; parallel algorithms; parallel computation; parallel computations; theory; verification", pubcountry = "Netherlands A11", subject = "F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Automata \\ F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism", treatment = "T Theoretical or Mathematical", } @Article{Bhatt:1987:CMW, author = "Sandeep N. Bhatt and Stavros S. Cosmadakis", title = "The complexity of minimizing wire lengths in {VLSI} layouts", journal = j-INFO-PROC-LETT, volume = "25", number = "4", pages = "263--267", day = "17", month = jun, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Yale Univ, New Haven, CT, USA", classification = "714; 723; 921; B0250 (Combinatorial mathematics); B1110 (Network topology); B2570 (Semiconductor integrated circuits); C1160 (Combinatorial mathematics); C4230 (Switching theory); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Yale Univ., New Haven, CT, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "binary tree; circuit layout CAD; computational complexity; Computer Aided Design; data structures; integrated circuits, VLSI; mathematical techniques --- Graph Theory; minimax edge length; minimisation; minimizing wire lengths; NP-complete; NP-completeness; theory; trees (mathematics); verification; VLSI; VLSI complexity; VLSI layout; VLSI layouts; wire length", pubcountry = "Netherlands A12", subject = "F.1.3 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Complexity hierarchies \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms \\ F.1.3 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Reducibility and completeness", treatment = "T Theoretical or Mathematical", } @Article{Fries:1987:DST, author = "O. Fries and K. Mehlhorn and S. N{\"a}her and A. Tsakalidis", title = "A $\log \log n$ data structure for three-sided range queries", journal = j-INFO-PROC-LETT, volume = "25", number = "4", pages = "269--273", day = "17", month = jun, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ des Saarlandes, Saarbr{\"u}cken, West Ger", classification = "723; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory); C6120 (File organisation)", corpsource = "Angewandte Math. and Inf., Saarlandes Univ., Saarbrucken, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; computational complexity; computer programming --- Algorithms; data processing; data structure; Data Structures; data structures; heap; lowest common ancestor; priority search tree; search path; theory; three-sided range queries; trees (mathematics); verification", pubcountry = "Netherlands A13", subject = "E.1 Data, DATA STRUCTURES, Trees \\ I.2.8 Computing Methodologies, ARTIFICIAL INTELLIGENCE, Problem Solving, Control Methods, and Search, Graph and tree search strategies", treatment = "T Theoretical or Mathematical", } @Article{Appel:1987:GCC, author = "Andrew W. Appel", title = "Garbage collection can be faster than stack allocation", journal = j-INFO-PROC-LETT, volume = "25", number = "4", pages = "275--279", day = "17", month = jun, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Princeton Univ, Princeton, NJ, USA", classification = "723; C6120 (File organisation)", corpsource = "Dept. of Comput. Sci., Princeton Univ., NJ, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; computer operating systems --- Storage Allocation; computer programming; garbage collection; physical memory; stack allocation; storage allocation; storage management; theory", pubcountry = "Netherlands A14", subject = "D.4.2 Software, OPERATING SYSTEMS, Storage Management, Allocation/deallocation strategies \\ D.4.2 Software, OPERATING SYSTEMS, Storage Management, Main memory", treatment = "P Practical", } @Article{Raghavan:1987:BBC, author = "Vijay Raghavan and Shankar M. Venkatesan", title = "On bounds for a board covering problem", journal = j-INFO-PROC-LETT, volume = "25", number = "5", pages = "281--284", day = "10", month = jul, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "05B40", MRnumber = "89f:05056", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C1230 (Artificial intelligence); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Minnesota Univ., Minneapolis, MN, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "algorithm theory; board covering problem; chessboard; games of skill; minimum queen cover problem; theory; verification", pubcountry = "Netherlands A01", subject = "G.m Mathematics of Computing, MISCELLANEOUS", treatment = "T Theoretical or Mathematical", } @Article{Salowe:1987:SUL, author = "Jeffrey S. Salowe and W. L. Steiger", title = "Stable Unmerging in Linear Time and Constant Space", journal = j-INFO-PROC-LETT, volume = "25", number = "5", pages = "285--294", day = "10", month = jul, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68P10", MRnumber = "88g:68020", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Rutgers Univ, New Brunswick, NJ, USA", affiliationaddress = "Rutgers Univ, New BH Image Coding", classification = "723; C4240 (Programming and algorithm theory); C6130 (Data handling techniques)", corpsource = "Dept. of Comput. Sci., Rutgers Univ., New Brunswick, NJ, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "algorithm theory; algorithms; binary image processing; chain code; constant space; data processing --- Data Structures; linear time; merging; optimal algorithm; quadtree; run-length encoding; sorted lists; sorting; space-time complexity; stable; theory; unmerging; verification", pubcountry = "Netherlands A02", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching \\ G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous \\ G.1.0 Mathematics of Computing, NUMERICAL ANALYSIS, General, Stability (and instability)", treatment = "P Practical", } @Article{Venkatesh:1987:OCL, author = "K. Venkatesh and T. Radhakrishnan and H. F. Li", title = "Optimal checkpointing and local recording for domino-free rollback recovery", journal = j-INFO-PROC-LETT, volume = "25", number = "5", pages = "295--303", day = "10", month = jul, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Concordia Univ, Montreal, Que, Can", classification = "722; 723; C5440 (Multiprocessor systems and techniques); C5470 (Performance evaluation and testing)", corpsource = "Dept. of Comput. Sci., Concordia Univ., Montreal, Que., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; backward error recovery; computer programming --- Algorithms; computer systems, digital; contaminated messages; design; distributed computer systems; distributed processing; distributed system recovery; domino-free rollback recovery; Fault Tolerant Capability; fault tolerant computing; local recording; management; optimal checkpointing; performance; retransmission dependencies; system recovery; theory; uni-processor computer systems; unmatched receives; unmatched sends", pubcountry = "Netherlands A03", subject = "H.2.2 Information Systems, DATABASE MANAGEMENT, Physical Design, Recovery and restart \\ D.4.5 Software, OPERATING SYSTEMS, Reliability, Checkpoint/restart \\ H.2.4 Information Systems, DATABASE MANAGEMENT, Systems, Distributed systems \\ D.4.7 Software, OPERATING SYSTEMS, Organization and Design, Distributed systems \\ C.2.4 Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Distributed Systems", treatment = "P Practical", } @Article{Nawrocki:1987:SAM, author = "Jerzy R. Nawrocki and J. Martinek", title = "A storage allocation method with invalidating dangling references", journal = j-INFO-PROC-LETT, volume = "25", number = "5", pages = "305--310", day = "10", month = jul, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Technical Univ of Poznan, Poznan, Pol", classification = "723; C6120 (File organisation); C6150J (Operating systems)", corpsource = "Comput. Centre, Tech. Univ. of Poznan, Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; computer operating systems; dangling references; deallocation; design; dynamic storage allocation; high-level programming languages; languages; real-time systems; Storage Allocation; storage allocation; theory; tombstone management; tombstones", pubcountry = "Netherlands A04", subject = "C.3 Computer Systems Organization, SPECIAL-PURPOSE AND APPLICATION-BASED SYSTEMS, Signal processing systems \\ D.3.3 Software, PROGRAMMING LANGUAGES, Language Constructs, Control structures", treatment = "P Practical", } @Article{Calude:1987:SEN, author = "Cristian Calude", title = "Super-exponentials nonprimitive recursive, but rudimentary", journal = j-INFO-PROC-LETT, volume = "25", number = "5", pages = "311--315", day = "10", month = jul, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "03D15", MRnumber = "88j:03026", MRreviewer = "Decheng Ding", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Bucharest, Bucharest, Rom", classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Dept. of Math., Bucharest Univ., Bucharest, Romania", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Ackermann function; computer metatheory; loop program; natural numbers; nonprimitive recursive; nonprimitive recursive function; programming theory; rudimentary function; Smullyan rudimentary; super exponentials; super-exponential function; superexponential function of Ackermann type; theory", pubcountry = "Netherlands A05", subject = "F.3.3 Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Program and recursion schemes \\ F.4.1 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Recursive function theory \\ G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous", treatment = "T Theoretical or Mathematical", } @Article{Ravi:1987:APS, author = "S. S. Ravi and H. B. {Hunt, III}", title = "An application of the {Planar Separator Theorem} to counting problems", journal = j-INFO-PROC-LETT, volume = "25", number = "5", pages = "317--321", day = "10", month = jul, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68R10 (05C40 68Q20 90C27)", MRnumber = "89a:68177", MRreviewer = "Narsingh Deo", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "State Univ of New York at Albany, Albany, NY, USA", classification = "723; 921; C1160 (Combinatorial mathematics); C1180 (Optimisation techniques); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., State Univ. of New York, Albany, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; Algorithms; combinatorial problems; computational complexity; computer programming; counting algorithm; counting problems; dynamic programming; graph theory; mathematical programming, dynamic; maximum independent-set; nonserial dynamic programming; NP-hard problems; planar graphs; planar separator theorem; theory; verification", pubcountry = "Netherlands A06", subject = "G.4 Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm analysis \\ I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms \\ G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous \\ F.1.3 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes", treatment = "T Theoretical or Mathematical", } @Article{Gries:1987:NGC, author = "David Gries and Ivan Stojmenovic", title = "A Note on {Graham}'s Convex Hull Algorithm", journal = j-INFO-PROC-LETT, volume = "25", number = "5", pages = "323--327", day = "10", month = jul, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See \cite{Graham:1972:EAD}.", acknowledgement = ack-nhfb, affiliationaddress = "Cornell Univ, Ithaca, NY, USA", classification = "723; 921; C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; Algorithms; circular doubly-linked lists; computational geometry; computer programming; convex hull algorithm; data structures; graham's convex hull algorithm; linked lists; mathematical techniques --- Geometry; theory", pubcountry = "Netherlands A07", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations \\ G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous \\ G.4 Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm analysis \\ I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms", treatment = "P Practical", } @Article{Zhu:1987:NDB, author = "Yun Zhou Zhu and To Yat Cheung", title = "A new distributed breadth-first-search algorithm", journal = j-INFO-PROC-LETT, volume = "25", number = "5", pages = "329--333", day = "10", month = jul, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68P10 (68Q25)", MRnumber = "88k:68021", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Univ. of Sci. and Technol. of China, Hefei, China", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "algorithm theory; computational complexity; distributed breadth-first-search algorithm; distributed processing; graph theory; graphs; time complexities; worst-case communication", pubcountry = "Netherlands A08", treatment = "T Theoretical or Mathematical", } @Article{Suros:1987:FDR, author = "Rina Suros and E. Montagne", title = "Fitted diagonals for reducing {I/O} bandwidth in systolic systems", journal = j-INFO-PROC-LETT, volume = "25", number = "5", pages = "335--341", day = "10", month = jul, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ Paris-Sud, Orsay, Fr", classification = "722; 723; 921; B0290H (Linear algebra); C4140 (Linear algebra)", corpsource = "Lab. d'Inf. des Syst., Exp. et leur Modelisation, Univ. Paris-Sud, Orsay, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "complexity; computer systems, digital; computing time; design; FDM; fitted diagonals method; I/O bandwidth; input/output bandwidth; mathematical techniques --- Matrix Algebra; matrix algebra; parallel algorithms; parallel numerical applications; Parallel Processing; systolic array; systolic arrays; systolic systems; theory; verification; VLSI", pubcountry = "Netherlands A09", subject = "F.2.1 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Computations on matrices \\ C.5.4 Computer Systems Organization, COMPUTER SYSTEM IMPLEMENTATION, VLSI Systems \\ E.1 Data, DATA STRUCTURES, Arrays", treatment = "T Theoretical or Mathematical", } @Article{Friedberg:1987:ESM, author = "Stuart A. Friedberg and Gary L. Peterson", title = "An efficient solution to the mutual exclusion problem using weak semaphores", journal = j-INFO-PROC-LETT, volume = "25", number = "5", pages = "343--347", day = "10", month = jul, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Rochester, Rochester, NY, USA", classification = "723; C1140C (Queueing theory); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Rochester Univ., Rochester, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm theory; Algorithms; algorithms; binary semaphores; computer programming; computer systems, digital --- Multiprocessing; critical section; mutual exclusion problem; queueing; queueing theory; shared single-bit variables; theory; verification; weak semaphores", pubcountry = "Netherlands A10", subject = "D.4.1 Software, OPERATING SYSTEMS, Process Management, Mutual exclusion", treatment = "T Theoretical or Mathematical", } @Article{Tel:1987:CDA, author = "G. Tel and J. {Van Leeuwen}", title = "Comments on {``A distributed algorithm for distributed termination''} {[Inform. Process. Lett. {\bf 24}(5), 16 March 1987, pp. 293--297]}", journal = j-INFO-PROC-LETT, volume = "25", number = "5", pages = "349--349", day = "10", month = jul, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See \cite{Hazari:1987:DAD}.", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Utrecht Univ., Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "CSP; distributed processing; distributed termination detection algorithm; false termination; parallel algorithms; passive processes", pubcountry = "Netherlands A11", treatment = "T Theoretical or Mathematical", } @Article{Krause:1987:PIT, author = "Kadri Krause and Lawrence L. Larmore and Dennis James Volper", title = "Packing items from a triangular distribution", journal = j-INFO-PROC-LETT, volume = "25", number = "6", pages = "351--361", day = "26", month = jul, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q20 (90C27)", MRnumber = "88g:68045", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; 922; C1140Z (Other and miscellaneous); C1290 (Applications of systems theory)", corpsource = "Dept. of Inf. and Comput. Sci., California Univ., Irvine, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; bin-packing; computer programming; density functions; operations research; packing strategy; probabilistic algorithms; probability; probability density function; probability distribution; theory; triangular distribution; verification", pubcountry = "Netherlands A01", subject = "G.3 Mathematics of Computing, PROBABILITY AND STATISTICS, Probabilistic algorithms (including Monte Carlo)", treatment = "T Theoretical or Mathematical", } @Article{Jedrzejowicz:1987:NSC, author = "Joanna J{\polhk{e}}drzejowicz", title = "Nesting of shuffle closure is important", journal = j-INFO-PROC-LETT, volume = "25", number = "6", pages = "363--367", day = "26", month = jul, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q45 (68Q90)", MRnumber = "88j:68086", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "721; C4210 (Formal logic)", corpsource = "Inst. of Math., Gdansk Univ., Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; extended regular languages; formal languages; languages; shuffle closure; shuffle expressions; shuffle language; shuffle languages; shuffle operator; subexpression properties; theory; verification", pubcountry = "Netherlands A02", subject = "F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Classes defined by grammars or automata \\ F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Algebraic language theory", treatment = "T Theoretical or Mathematical", } @Article{Pallo:1987:RDL, author = "Jean Pallo", title = "On the rotation distance in the lattice of binary trees", journal = j-INFO-PROC-LETT, volume = "25", number = "6", pages = "369--373", day = "26", month = jul, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory); C6120 (File organisation)", corpsource = "Dept. d'Inf., Bourgogne Univ., Dijon, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "admissible searching Algorithm D*; admissible transformations; algorithms; binary trees; computational complexity; computer programming --- Algorithms; data processing --- Data Structures; data structures; evaluation function; lattice of binary trees; lattice structure; lower bound; lower bounds; mathematical techniques; mathematical transformations; metric space; O(n/sup 2/) algorithm; rotation distance; rotation tree transformation; theory; tree similarity measures; trees (mathematics); upper bounds; verification", pubcountry = "Netherlands A03", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees", treatment = "T Theoretical or Mathematical", } @Article{Baeza-Yates:1987:SAM, author = "Ricardo A. Baeza-Yates", title = "Some average measures in $m$-ary search trees", journal = j-INFO-PROC-LETT, volume = "25", number = "6", pages = "375--382", day = "26", month = jul, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory); C6120 (File organisation)", corpsource = "Dept. of Comput. Sci., Chile Univ., Santiago, Chile", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; average measures; average storage performance; computer programming --- Algorithms; data processing; data structures; design; expected number of comparisons; m-ary search tree; m-ary search trees; measurement; performance; random keys; theory; trees (mathematics); unsuccessful search", pubcountry = "Netherlands A04", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees \\ G.4 Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm analysis \\ I.2.8 Computing Methodologies, ARTIFICIAL INTELLIGENCE, Problem Solving, Control Methods, and Search, Graph and tree search strategies \\ E.1 Data, DATA STRUCTURES, Trees", treatment = "T Theoretical or Mathematical", } @Article{Moran:1987:GLB, author = "Shlomo Moran", title = "Generalized lower bounds derived from {H{\aa}stad}'s main lemma (small depth circuits)", journal = j-INFO-PROC-LETT, volume = "25", number = "6", pages = "383--388", day = "26", month = jul, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q15 (94C05)", MRnumber = "88m:68016", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C1160 (Combinatorial mathematics); C4230 (Switching theory); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Technion Israel Inst. of Technol., Haifa, Israel", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "arbitrary symmetric functions; Boolean functions; computational complexity; computer metatheory; constant-depth circuit; constant-depth circuits; depth-k circuit; lower bounds; majority function; parity; set theory; symmetric function; theory; verification", pubcountry = "Netherlands A05", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Path and circuit problems", treatment = "T Theoretical or Mathematical", } @Article{Kunde:1987:WRC, author = "Manfred Kunde and Horst Steppat", title = "On the worst-case ratio of a compound multiprocessor scheduling algorithm", journal = j-INFO-PROC-LETT, volume = "25", number = "6", pages = "389--396", day = "26", month = jul, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "722; 723; C1290Z (Other applications of systems theory); C5440 (Multiprocessor systems and techniques); C6150J (Operating systems)", corpsource = "Inst. f{\"u}r Inf., Tech. Univ., Munchen, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; computer programming --- Algorithms; computer systems, digital; heuristics LPT; homogeneous processors; independent tasks; Multifit; multiprocessing programs; multiprocessor scheduling; multiprocessor scheduling algorithm; nonpreemptive scheduling; nonpreemptive scheduling of independent tasks; scheduling; supervisory programs; theory; verification; worst-case analysis; worst-case ratio", pubcountry = "Netherlands A06", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sequencing and scheduling", treatment = "T Theoretical or Mathematical", } @Article{Vrto:1987:ATC, author = "Imrich V{\v{r}}{\soft{t}}o", title = "The area-time complexity of the {VLSI} counter", journal = j-INFO-PROC-LETT, volume = "25", number = "6", pages = "397--400", day = "26", month = jul, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q35", MRnumber = "88j:68074", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "714; 721; B1190 (Other and miscellaneous); B1265Z (Other digital circuits); C4230 (Switching theory); C4240 (Programming and algorithm theory)", corpsource = "Inst. of Tech. Cybern., Slovak Acad. of Sci., Bratislava, Czechoslovakia", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; area-time complexity; boundary model; counting circuits; integrated circuits, VLSI; logic circuits; lower bound; lower bounds; n-bit VLSI counter; O(n log/sup 3/n log log n); Omega (n log/sup 2/n); synchronous VLSI model; theory; verification; VLSI; VLSI complexity; VLSI counter", pubcountry = "Netherlands A07", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sequencing and scheduling", treatment = "T Theoretical or Mathematical", } @Article{Peper:1987:DCC, author = "F. Peper", title = "Determining connected components in linear time by a linear number of processors", journal = j-INFO-PROC-LETT, volume = "25", number = "6", pages = "401--406", day = "26", month = jul, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q20 (68R10)", MRnumber = "88g:68047", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory); C5440 (Multiprocessor systems and techniques)", corpsource = "Fac. of Math. and Inf., Delft Univ. of Technol., Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; computational complexity; computer programming; connected components; graph algorithm; graph theory; lighthouse algorithm; lighthouse algorithms; mathematical techniques --- Graph Theory; parallel algorithms; read conflicts; shared memory SIMD model; simple undirected graph; theory; verification", pubcountry = "Netherlands A08", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms \\ G.1.0 Mathematics of Computing, NUMERICAL ANALYSIS, General, Parallel algorithms \\ F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism", treatment = "T Theoretical or Mathematical", } @Article{Kelter:1987:CSS, author = "Udo Kelter", title = "The complexity of strict serializability revisited", journal = j-INFO-PROC-LETT, volume = "25", number = "6", pages = "407--411", day = "26", month = jul, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory); C4250 (Database theory)", corpsource = "Fachbereich Inf., Dortmund Univ., West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computational complexity; computer metatheory; concurrency control; concurrency control theory; database systems; database theory; dead values; decidability; design; final-state serializability; large database systems; management; NP-complete; NP-completeness; polynomial time; request log; strict serializability; strict view serializability; theory; two-step transaction model; useless values; verification", pubcountry = "Netherlands A09", subject = "F.1.3 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Reducibility and completeness \\ F.1.3 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Reducibility and completeness \\ H.2.4 Information Systems, DATABASE MANAGEMENT, Systems, Concurrency", treatment = "T Theoretical or Mathematical", } @Article{Kobuchi:1987:NSC, author = "Youichi Kobuchi", title = "A note on symmetrical cellular spaces", journal = j-INFO-PROC-LETT, volume = "25", number = "6", pages = "413--415", day = "26", month = jul, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q80", MRnumber = "88i:68079", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C1160 (Combinatorial mathematics); C4230 (Switching theory)", corpsource = "Dept. of Biophys., Kyoto Univ., Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer metatheory; encoding function; local transition function; neighbourhood index; Neumann neighbourhood; one-dimensional cellular space; set theory; symmetrical cellular spaces; theory; verification", pubcountry = "Netherlands A10", subject = "G.m Mathematics of Computing, MISCELLANEOUS", treatment = "T Theoretical or Mathematical", } @Article{Pawagi:1987:CCD, author = "Shaunak R. Pawagi and P. S. Gopalakrishnan and I. V. Ramakrishnan", title = "Corrigendum: {``Computing dominators in parallel''}", journal = j-INFO-PROC-LETT, volume = "25", number = "6", pages = "417--417", day = "26", month = jul, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q20 (05-04 05C20 68R10)", MRnumber = "88e:68045b", bibdate = "Sat Apr 11 12:24:20 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See \cite{Pawagi:1987:CDP}.", acknowledgement = ack-nhfb, fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", } @Article{Jaumard:1987:CMS, author = "Brigitte Jaumard and Bruno Simeone", title = "On the complexity of the maximum satisfiability problem for {Horn} formulas", journal = j-INFO-PROC-LETT, volume = "26", number = "1", pages = "1--4", day = "15", month = sep, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q15 (03D15)", MRnumber = "88j:68052", MRreviewer = "Ingo Wegener", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Rutgers Univ., New Brunswick, NJ, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; complexity; computational complexity; computer metatheory; database systems; formal logic; horn formulas; Horn formulas; logic databases; maximum satisfiability problem; NP-completeness; P-completeness; polynominal-time algorithm; propositional calculus; theory; verification", pubcountry = "Netherlands A01", subject = "F.1.3 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Reducibility and completeness \\ F.4.1 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Logic programming", treatment = "T Theoretical or Mathematical", } @Article{Driscoll:1987:MBI, author = "James R. Driscoll and Sheau-Dong Lang and LeRoy A. Franklin", title = "Modeling {$B$}-tree insertion activity", journal = j-INFO-PROC-LETT, volume = "26", number = "1", pages = "5--18", day = "15", month = sep, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory); C6120 (File organisation)", corpsource = "Dept. of Comput. Sci., Central Florida Univ., Orlando, FL, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "B-tree insertion; b-tree insertion activity; block split tree structured files; data processing; data structures; design; index management; mathematical techniques --- Trees; measurement; reorganization; root node insertion; root node insertion activity; search time; storage management; storage space; theory; tree structure file; trees (mathematics); verification", pubcountry = "Netherlands A02", subject = "E.1 Data, DATA STRUCTURES, Trees \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees \\ E.5 Data, FILES, Organization/structure", treatment = "T Theoretical or Mathematical", } @Article{Berztiss:1987:NDO, author = "Alfs T. Berztiss", title = "A notation for distributed operations", journal = j-INFO-PROC-LETT, volume = "26", number = "1", pages = "19--21", day = "15", month = sep, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Pittsburgh Univ., PA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "associative operators; commutative operators; computer programming languages --- Theory; computer software; distributed operations; distributed processing; formal declarative software specification; generic operator; languages; programming languages; programming theory; set theory; specification languages; theory", pubcountry = "Netherlands A03", subject = "D.2.1 Software, SOFTWARE ENGINEERING, Requirements/Specifications, Languages \\ F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Algebraic language theory", treatment = "T Theoretical or Mathematical", } @Article{Berstel:1987:LWC, author = "Jean Berstel and Sre{\v{c}}ko Brlek", title = "On the length of word chains", journal = j-INFO-PROC-LETT, volume = "26", number = "1", pages = "23--28", day = "15", month = sep, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q45 (05A15 20M35)", MRnumber = "88m:68028", MRreviewer = "Andr{\'e} Lentin", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory); C4290 (Other computer theory)", corpsource = "Dept. of Math. and Comput. Sci., Quebec Univ., Montreal, Que., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "addition chains; computational complexity; computational linguistics; computer metatheory; computer programming languages; languages; q-letter alphabet; theory; verification; word chains", pubcountry = "Netherlands A04", subject = "F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Algebraic language theory \\ G.2.1 Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics", treatment = "T Theoretical or Mathematical", } @Article{Book:1987:RSW, author = "Ronald V. Book and Hai-Ning Liu", title = "Rewriting systems and word problems in a free partially commutative monoid", journal = j-INFO-PROC-LETT, volume = "26", number = "1", pages = "29--32", day = "15", month = sep, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q50 (20M05)", MRnumber = "88m:68034", MRreviewer = "Klaus Madlener", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C4210 (Formal logic); C4240 (Programming and algorithm theory); C4290 (Other computer theory)", corpsource = "Dept. of Math,. California Univ., Santa Barbara, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; computational complexity; computational linguistics; computer metatheory; computer programming --- Algorithms; decidability; finite Thue systems; free partially commutative monoid; languages; linear time; partial commutativity; polynomial-time algorithm; rewriting systems; theory; verification; word problems", pubcountry = "Netherlands A05", subject = "G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous \\ F.4.2 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems, Parallel rewriting systems \\ F.4.2 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems, Thue systems", treatment = "T Theoretical or Mathematical", } @Article{Carlsson:1987:DDH, author = "Svante Carlsson", title = "The {Deap} --- a Double-Ended Heap to Implement Double-Ended Priority Queues", journal = j-INFO-PROC-LETT, volume = "26", number = "1", pages = "33--36", day = "15", month = sep, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory); C6120 (File organisation)", corpsource = "Dept. of Comput. Sci., Lund Univ., Sweden", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; computational complexity; computer programming --- Algorithms; constant time; data processing; data structures; deap; design; double-ended heap; double-ended priority queue; double-ended priority queues; logarithmic time; minmaxheap; MinMaxHeap; theory", pubcountry = "Netherlands A06", subject = "G.m Mathematics of Computing, MISCELLANEOUS, Queueing theory \\ E.1 Data, DATA STRUCTURES", treatment = "T Theoretical or Mathematical", } @Article{Incerpi:1987:PVS, author = "Janet Incerpi and Robert Sedgewick", title = "Practical variations of {Shellsort}", journal = j-INFO-PROC-LETT, volume = "26", number = "1", pages = "37--43", day = "15", month = sep, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C1160 (Combinatorial mathematics); C6130 (Data handling techniques)", corpsource = "INRIA, Valbonne, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; computer programming --- Algorithms; computer systems programming; increment sequence; insertion sort; measurement; performance; shaker sort; shellsort; Shellsort; sorting; sorting algorithm; sorting network; theory", pubcountry = "Netherlands A07", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching", treatment = "P Practical", } @Article{Bermond:1987:EMI, author = "Jean Claude Bermond and Jean Michel Fourneau and Alain Jean-Marie", title = "Equivalence of multistage interconnection networks", journal = j-INFO-PROC-LETT, volume = "26", number = "1", pages = "45--50", day = "15", month = sep, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; 921; C1160 (Combinatorial mathematics); C4230 (Switching theory)", corpsource = "CNRS, Univ. de Paris Sud, Orsay, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer systems, digital; directed graph; directed graphs; graph characterization; mathematical techniques --- Graph Theory; multiprocessor interconnection networks; multistage interconnection networks; omega network; parallel architecture; parallel architectures; switching cells; theory; topological equivalence; verification", pubcountry = "Netherlands A08", subject = "C.1.2 Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors), Interconnection architectures \\ F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Unbounded-action devices \\ G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous", treatment = "T Theoretical or Mathematical", } @Article{Babai:1987:ROS, author = "L{\'a}szl{\'o} Babai", title = "Random oracles separate {${\rm PSPACE}$} from the polynomial-time hierarchy", journal = j-INFO-PROC-LETT, volume = "26", number = "1", pages = "51--53", day = "15", month = sep, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q15 (03D15)", MRnumber = "89k:68046", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "721; 723; C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Dept of Comput. Sci., Chicago Univ., IL, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Boolean algebra; bounded-depth Boolean circuits; computational complexity; computer metatheory; constant-depth parity circuits; logic circuits --- Theory; P S P A C E; polynomial-time hierarchy; pspace; random oracles; theory; verification", pubcountry = "Netherlands A09", subject = "F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Relativized computation \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching", treatment = "T Theoretical or Mathematical", } @Article{Metivier:1987:LSC, author = "Y. M{\'e}tivier and E. Ochmanski", title = "On Lexicographic Semi-Commutations", journal = j-INFO-PROC-LETT, volume = "26", number = "2", pages = "55--59", day = "19", month = oct, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q50", MRnumber = "88k:68055", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ de Bordeaux I, Talence, Fr", classification = "751; 921; C1160 (Combinatorial mathematics); C4210 (Formal logic)", corpsource = "Lab. de Math. et Inf., Bordeaux Univ., Talence, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; commutation graph; commutation monoid; complete rewriting system; Formal Languages; formal logic; graph theory; graphs; irreducible words; languages; lexicographic order; lexicographic semi-commutations; mathematical techniques --- Graph Theory; minimal words; rewriting system; semi-commutation; theory; verification", pubcountry = "Netherlands A01", subject = "F.4.2 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems, Parallel rewriting systems \\ G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous", treatment = "T Theoretical or Mathematical", } @Article{Shen:1987:TLB, author = "Xiaojun Shen and Herbert Edelsbrunner", title = "A tight lower bound on the size of visibility graphs", journal = j-INFO-PROC-LETT, volume = "26", number = "2", pages = "61--64", day = "19", month = oct, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68U05 (05C99 68Q25)", MRnumber = "89e:68115", MRreviewer = "D. T. Lee", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Illinois at Urbana-Champaign, Urbana, IL, USA", classification = "723; 921; C1160 (Combinatorial mathematics); C4190 (Other numerical methods); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "combinatorial geometry; computational complexity; computational geometry; computer metatheory; convex hull; Euler's relation; Geometry; graph theory; graphs; lower bound; mathematical techniques; nonintersecting line segments; straight line connection; theory; tight lower bound; verification; visibility graph; visibility graphs", pubcountry = "Netherlands A02", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations \\ G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous", treatment = "T Theoretical or Mathematical", } @Article{Rusinowitch:1987:TDS, author = "Michael Rusinowitch", title = "On termination of the direct sum of term-rewriting systems", journal = j-INFO-PROC-LETT, volume = "26", number = "2", pages = "65--70", day = "19", month = oct, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q50", MRnumber = "88k:68056", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Cent de Recherche en Informatique de Nancy, Vandoeuvre-les-Nancy, Fr", classification = "721; C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Centre de Recherche en Inf. de Nancy, Vandoeuvre-les-Nancy, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; direct sum; Formal Languages; formal languages; formal logic; languages; term-rewriting systems; termination; theory; verification", pubcountry = "Netherlands A03", subject = "F.4.2 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems, Parallel rewriting systems \\ G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous", treatment = "T Theoretical or Mathematical", } @Article{Mirzaian:1987:HTL, author = "Andranik Mirzaian", title = "A halving technique for the longest stuttering subsequence problem", journal = j-INFO-PROC-LETT, volume = "26", number = "2", pages = "71--75", day = "19", month = oct, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q20", MRnumber = "88j:68066", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "York Univ, North York, Ont, Can", classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., York Univ., North York, Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; computational complexity; computer metatheory; computer programming; halving; halving technique; languages; longest stuttering subsequence problem; optimal linear-time algorithm; theory; verification", pubcountry = "Netherlands A04", subject = "G.4 Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm analysis \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Routing and layout", treatment = "T Theoretical or Mathematical", } @Article{Magott:1987:PEC, author = "Jan Magott", title = "Performance evaluation of concurrent systems using conflict-free and persistent {Petri} nets", journal = j-INFO-PROC-LETT, volume = "26", number = "2", pages = "77--80", day = "19", month = oct, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q90", MRnumber = "88k:68068", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Technical Univ of Wroclaw, Wroclaw, Pol", classification = "722; 723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Inst. of Eng. Cybern., Tech. Univ. of Wroclaw, Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; computational complexity; computer systems, digital; concurrent systems; conflict free Petri nets; cycle time problem; directed graphs; firing time; marked Petri nets; mathematical techniques --- Graph Theory; multiprocessing systems; NP-hardness; Performance; performance evaluation; persistent Petri nets; polynomial algorithms; strong NP-hardness; theory; three-partition problem; timed marked Petri net; verification", pubcountry = "Netherlands A05", subject = "F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Unbounded-action devices \\ G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous", treatment = "T Theoretical or Mathematical", } @Article{Galil:1987:PEA, author = "Zvi Galil and Moti Yung", title = "Partitioned encryption and achieving simultaneity by partitioning", journal = j-INFO-PROC-LETT, volume = "26", number = "2", pages = "81--88", day = "19", month = oct, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68M10 (68M15 68P25 68Q99)", MRnumber = "88k:68014", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Columbia Univ, New York, NY, USA", classification = "723; C4240 (Programming and algorithm theory); C5620 (Computer networks and techniques)", corpsource = "Dept. of Comput. Sci., Columbia Univ. New York, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computational complexity; computer systems, digital --- Distributed; cryptographic protocols; cryptography; distributed processing; fault tolerant computing; fault-tolerant distributed computing; partitioned encryption; partitioned secret sharing; probabilistic encryption; probabilistic public-key encryption; protocols; security; simultaneous broadcast; standardization; theory; verification", pubcountry = "Netherlands A06", subject = "E.3 Data, DATA ENCRYPTION, Public key cryptosystems \\ D.4.6 Software, OPERATING SYSTEMS, Security and Protection, Cryptographic controls", treatment = "T Theoretical or Mathematical", } @Article{Mathieu:1987:AED, author = "C. Mathieu and Claude Puech and Hossein Yahia", title = "Average efficiency of data structures for binary image processing", journal = j-INFO-PROC-LETT, volume = "26", number = "2", pages = "89--93", day = "19", month = oct, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C1250 (Pattern recognition); C4240 (Programming and algorithm theory); C6120 (File organisation)", corpsource = "Dept. de Math. et d'Inf., l'Ecole Normale Sup{\'e}rieure, Paris, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "binary image processing; computational complexity; computerised picture processing; data structures; design; measurement; performance; quadtree; theory; tree; trees (mathematics)", pubcountry = "Netherlands A07", subject = "I.3.m Computing Methodologies, COMPUTER GRAPHICS, Miscellaneous \\ I.2.10 Computing Methodologies, ARTIFICIAL INTELLIGENCE, Vision and Scene Understanding, Representations, data structures, and transforms", treatment = "T Theoretical or Mathematical", } @Article{Subramanian:1987:DTP, author = "K. G. Subramanian and Rani Siromoney and P. Jeyanthi Abisha", title = "A {D0L-T0L} public key cryptosystem", journal = j-INFO-PROC-LETT, volume = "26", number = "2", pages = "95--97", day = "19", month = oct, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68P25 (68Q45)", MRnumber = "89k:68036", MRreviewer = "James W. Snively, Jr.", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240 (Programming and algorithm theory); C6130 (Data handling techniques)", corpsource = "Dept. of Math., Madras Christian Coll., India", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "algorithms; computational complexity; cryptography; D0L; decryption; design; formal language; formal languages; languages; NP-complete problem; public key cryptosystem; T0L; theory; trapdoor information", pubcountry = "Netherlands A08", subject = "F.4.2 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems, Parallel rewriting systems \\ E.3 Data, DATA ENCRYPTION, Public key cryptosystems", treatment = "T Theoretical or Mathematical", } @Article{Gupta:1987:OTD, author = "Ajay K. Gupta and Susanne E. Hambrusch", title = "Optimal three-dimensional layouts of complete binary trees", journal = j-INFO-PROC-LETT, volume = "26", number = "2", pages = "99--104", day = "19", month = oct, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68R10 (68P05)", MRnumber = "88k:68069", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Purdue Univ., West Lafayette, IN, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "circuit layout CAD; complete binary trees; computational complexity; graph layout; optimal embeddings; optimisation; theory; three-dimensional layouts; trees (mathematics); verification; VLSI", pubcountry = "Netherlands A09", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees \\ B.7.2 Hardware, INTEGRATED CIRCUITS, Design Aids, Layout \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Routing and layout", treatment = "T Theoretical or Mathematical", } @Article{Thazhuthaveetil:1987:SLR, author = "Matthew Thazhuthaveetil and J. and Andrew R. Pleszkun", title = "On the structural locality of reference in {LISP} list access streams", journal = j-INFO-PROC-LETT, volume = "26", number = "2", pages = "105--110", day = "19", month = oct, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation); C6130 (Data handling techniques); C6140D (High level languages)", corpsource = "Dept. of Electr. Eng., Coll. of Eng., Pennsylvania State Univ., University Park, PA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "data structures; languages; LISP; LISP list access streams; list manipulation; list processing; management; reference; structural locality; theory", pubcountry = "Netherlands A10", subject = "D.3.2 Software, PROGRAMMING LANGUAGES, Language Classifications, LISP \\ I.2.5 Computing Methodologies, ARTIFICIAL INTELLIGENCE, Programming Languages and Software, LISP", treatment = "P Practical", } @Article{Szalas:1987:AAF, author = "Andrzej Sza{\l}as", title = "Arithmetical Axiomatization of First-Order Temporal Logic", journal = j-INFO-PROC-LETT, volume = "26", number = "3", pages = "111--116", day = "23", month = nov, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "03B70 (03B45 68Q55 68Q60)", MRnumber = "89a:03062", MRreviewer = "Neculai Curteanu", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Szalas, Andrzej", classification = "723; C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput., Imperial Coll. of Sci. and Technol., London, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "arithmetical axiomatization; arithmetical completeness; computer metatheory; discrete time; first-order temporal logic; Formal Logic; formal logic; formal reasoning; Kripke structure; Kripke structures; linear time; program verification; programming logic; programming theory; proof system; proof systems; reliability; soundness; syntactic characterization; theory; verification", pubcountry = "Netherlands A01", subject = "F.4.1 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Computational logic \\ G.1.0 Mathematics of Computing, NUMERICAL ANALYSIS, General \\ F.3.1 Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs", treatment = "T Theoretical or Mathematical", } @Article{Sykora:1987:TCA, author = "O. S\'ykora and I. V{\v{r}}{\soft{t}}o", title = "Tight chip area lower bounds for string matching", journal = j-INFO-PROC-LETT, volume = "26", number = "3", pages = "117--119", day = "23", month = nov, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q35", MRnumber = "89k:68079", MRreviewer = "Christoph Meinel", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Slovak Acad of Sciences, Bratislava, Czech", classification = "714; 721; 723; 921; B0250 (Combinatorial mathematics); B2570 (Semiconductor integrated circuits); C4240 (Programming and algorithm theory)", corpsource = "Inst. of Tech. Cybern., Slovak Acad. of Sci., Bratislava, Czechoslovakia", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Boolean functions; chip area; communication graph; computational complexity; computer metatheory --- Boolean Functions; graph theory; integrated circuits, VLSI; logic circuits --- Theory; mathematical techniques --- Graph Theory; string matching; Theory; theory; tight lower bounds; verification; VLSI; VLSI circuit", pubcountry = "Netherlands A02", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Pattern matching \\ B.7.1 Hardware, INTEGRATED CIRCUITS, Types and Design Styles, VLSI (very large scale integration)", treatment = "T Theoretical or Mathematical", } @Article{Zhu:1987:TMS, author = "Mingfa Zhu and Nan K. Loh and Pepe Siy", title = "Towards the minimum set of primitive relations in temporal logic", journal = j-INFO-PROC-LETT, volume = "26", number = "3", pages = "121--126", day = "23", month = nov, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "03B45 (03B65 03B70 68T05 68T30)", MRnumber = "89a:03046", MRreviewer = "Neculai Curteanu", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Center for Robotics and Adv. Autom., Oakland Univ., Rochester, MI, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "formal logic; minimum; primitive relations; temporal logic; time inversion mapping; transitivity table", pubcountry = "Netherlands A03", treatment = "T Theoretical or Mathematical", } @Article{Hou:1987:TAA, author = "Y. Hou", title = "{Trinity} algebra and its application to machine decompositions", journal = j-INFO-PROC-LETT, volume = "26", number = "3", pages = "127--134", day = "23", month = nov, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q35 (68Q05)", MRnumber = "89g:68033", MRreviewer = "Arthur T. Poe", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Eindhoven Univ of Technology, Eindhoven, Neth", classification = "714; 721; C4220 (Automata theory); C4230D (Sequential switching theory)", corpsource = "Dept. of Electr. Eng., Eindhoven Univ. of Technol., Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algebraic system; automata; automata theory; integrated circuits, VLSI; machine decomposition; machine decompositions; partition trinity; sequential machine; sequential machines; theory; trinity algebra; verification; VLSI", pubcountry = "Netherlands A04", subject = "F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Automata", treatment = "T Theoretical or Mathematical", } @Article{Sajeev:1987:MDS, author = "A. S. M. Sajeev and J. Olszewski", title = "Manipulation of data structures without pointers", journal = j-INFO-PROC-LETT, volume = "26", number = "3", pages = "135--143", day = "23", month = nov, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See comments \cite{Sakkinen:1988:CDS}.", acknowledgement = ack-nhfb, affiliationaddress = "Monash Univ, Clayton, Aust", classification = "723; C6120 (File organisation)", corpsource = "Dept. of Comput. Sci., Monash Univ., Clayton, Vic., Australia", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer programming languages; copying assignment; data processing --- Data Structures; data structures; data structures without pointers; languages; naming; pointers; programming languages; sharing assignment; storage management; theory; variable naming", pubcountry = "Netherlands A05", subject = "E.1 Data, DATA STRUCTURES \\ D.3.3 Software, PROGRAMMING LANGUAGES, Language Constructs, Coroutines", treatment = "P Practical", } @Article{Moran:1987:EIR, author = "Shlomo Moran and Yaron Wolfstahl", title = "Extended impossibility results for asynchronous complete networks", journal = j-INFO-PROC-LETT, volume = "26", number = "3", pages = "145--151", day = "23", month = nov, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68M10 (68R10)", MRnumber = "89f:68008", MRreviewer = "Joseph Y. Halpern", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Technion Israel Inst of Technology, Haifa, Isr", classification = "722; 723; 921; C4240 (Programming and algorithm theory); C5620 (Computer networks and techniques)", corpsource = "Dept. of Comput. Sci., Technion, Israel Inst. of Technol., Haifa, Israel", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "asynchronous complete networks; computational complexity; computer fault tolerance; computer systems, digital; consensus problem; consensus task; decision graph; Distributed; distributed computation; distributed processing; fault tolerance; fault tolerant computing; graph theory; impossibility results; mathematical techniques --- Graph Theory; protocol; protocols; reliability; standardization; theory; unsolvability; verification", pubcountry = "Netherlands A06", subject = "C.2.m Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Miscellaneous \\ C.4 Computer Systems Organization, PERFORMANCE OF SYSTEMS", treatment = "T Theoretical or Mathematical", } @Article{Haastad:1987:OWP, author = "Johan H{\aa}stad", title = "One-way permutations in {${\rm NC}^0$}", journal = j-INFO-PROC-LETT, volume = "26", number = "3", pages = "153--155", day = "23", month = nov, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q15 (68Q05)", MRnumber = "89h:68051", MRreviewer = "J. C. Lagarias", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "MIT, Cambridge, MA, USA", classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Lab. for Comput. Sci., MIT, Cambridge, MA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computable; computational complexity; computer systems, digital --- Parallel Processing; cryptography; inverting permutations; NC/sup 0/ circuits; one-way permutations; p-completeness; P-hard; parallel algorithms; parallel computation; permutations; theory; verification", pubcountry = "Netherlands A07", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Path and circuit problems \\ G.2.1 Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics, Permutations and combinations \\ F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Bounded-action devices", treatment = "T Theoretical or Mathematical", } @Article{Fellows:1987:NAP, author = "Michael R. Fellows and Michael A. Langston", title = "Nonconstructive advances in polynomial-time complexity", journal = j-INFO-PROC-LETT, volume = "26", number = "3", pages = "157--162", day = "23", month = nov, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q15 (03D15 05C99 68Q25 68Q35)", MRnumber = "89c:68035", MRreviewer = "Narsingh Deo", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of New Mexico, Albuquerque, NM, USA", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., New Mexico Univ., Albuquerque, NM, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "combinatorial problems; computational complexity; computer metatheory; computer programming --- Algorithms; decidability; decision algorithms; graph algorithms; graph theory; mathematical techniques --- Graph Theory; polynomial-time complexity; polynomial-time decision algorithms; theory; verification", pubcountry = "Netherlands A08", subject = "I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms \\ G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous \\ F.4.1 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Computability theory", treatment = "T Theoretical or Mathematical", } @Article{Balsters:1987:CDN, author = "H. Balsters", title = "Comments on: {``A deficiency of natural deduction'' [Inform. Process. Lett. {\bf 25} (1987), no. 4, 233--234; MR 88i:03020a] by J. G. Wiltink}", journal = j-INFO-PROC-LETT, volume = "26", number = "3", pages = "163--164", day = "23", month = nov, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "03B10 (68T99)", MRnumber = "88i:03020b", bibdate = "Sat Apr 11 12:24:20 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See \cite{Wiltink:1987:DND}.", acknowledgement = ack-nhfb, fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", } @Article{Apt:1987:TNF, author = "K. R. Apt and Luc Boug{\'e} and Ph. Clermont", title = "Two normal form theorems for {CSP} programs", journal = j-INFO-PROC-LETT, volume = "26", number = "4", pages = "165--171", day = "4", month = dec, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q10", MRnumber = "89k:68039", MRreviewer = "Dirk Janssens", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6150J (Operating systems)", corpsource = "Centre for Math. and Comput. Sci., Amsterdam, Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "communicating sequential processes; CSP programs; deadlock; design; distributed processing; I/O; inductive method; input-output programs; normal form; programming theory; repetitive command; system recovery; theory; verification", pubcountry = "Netherlands A01", subject = "D.1.3 Software, PROGRAMMING TECHNIQUES, Concurrent Programming, CSP", treatment = "T Theoretical or Mathematical", } @Article{Goodrich:1987:FCH, author = "Michael T. Goodrich", title = "Finding the convex hull of a sorted point set in parallel", journal = j-INFO-PROC-LETT, volume = "26", number = "4", pages = "173--179", day = "4", month = dec, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (68U05)", MRnumber = "89c:68047", MRreviewer = "Mirko K{\v{r}}iv{\'a}nek", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4190 (Other numerical methods); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Purdue Univ., West Lafayette, IN, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "algorithms; computational complexity; computational geometry; convex hull; CREW PRAM computational model; data structures; hull tree; optimal bounds; parallel algorithm; parallel algorithms; parallel data structure; sorted point set; theory; verification", pubcountry = "Netherlands A02", subject = "G.1.0 Mathematics of Computing, NUMERICAL ANALYSIS, General, Parallel algorithms \\ F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism", treatment = "T Theoretical or Mathematical", } @Article{Martin:1987:EFM, author = "Ursula Martin", title = "Extension functions for multiset orderings", journal = j-INFO-PROC-LETT, volume = "26", number = "4", pages = "181--186", day = "4", month = dec, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q50 (68T15)", MRnumber = "89m:68082", MRreviewer = "Laurent Kott", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Manchester Univ., UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "extension functions; multiset orderings; program termination; program verification; programming theory; set theory; standard multiset ordering; term-rewriting systems; theory; verification", pubcountry = "Netherlands A03", subject = "G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous", treatment = "T Theoretical or Mathematical", } @Article{Pinter:1987:ETT, author = "Shlomit S. Pinter and Yaron Wolfstahl", title = "Embedding ternary trees in {VLSI} arrays", journal = j-INFO-PROC-LETT, volume = "26", number = "4", pages = "187--191", day = "4", month = dec, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68R10", MRnumber = "89a:68176", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "B1265 (Digital electronics); B2570 (Semiconductor integrated circuits); C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Electr. Eng., Technion-Israel Inst. of Technol., Haifa, Israel", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "circuit layout CAD; computational complexity; design; digital integrated circuits; embedding; hexagonal arrays; modular schemes; multiprocessor arrays; N-node tree; square arrays; ternary logic; ternary trees; theory; trees (mathematics); VLSI; VLSI arrays", pubcountry = "Netherlands A04", subject = "B.7.1 Hardware, INTEGRATED CIRCUITS, Types and Design Styles, VLSI (very large scale integration) \\ C.4 Computer Systems Organization, PERFORMANCE OF SYSTEMS \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees", treatment = "T Theoretical or Mathematical", } @Article{Guntzer:1987:JIS, author = "U. Guntzer and M. Paul", title = "Jump interpolation search trees and symmetric binary numbers", journal = j-INFO-PROC-LETT, volume = "26", number = "4", pages = "193--204", day = "4", month = dec, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6120 (File organisation)", corpsource = "Inst. f{\"u}r Inf., Tech. Univ. Munchen, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "algorithms; computational complexity; data structures; interpolation; interpolation search trees; jump interpolation; searching complexity; space complexity; symmetric binary numbers; theory; trees (mathematics); verification", pubcountry = "Netherlands A05", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching \\ G.1.1 Mathematics of Computing, NUMERICAL ANALYSIS, Interpolation, Interpolation formulas \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees", treatment = "T Theoretical or Mathematical", } @Article{Takaoka:1987:DRH, author = "Tadao Takaoka", title = "A decomposition rule for the {Hoare} logic", journal = j-INFO-PROC-LETT, volume = "26", number = "4", pages = "205--208", day = "4", month = dec, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q60 (03B35 03B70)", MRnumber = "89a:68152", MRreviewer = "Michal Grabowski", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Inf. Sci., Ibaraki Univ., Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "complexity; decomposition rule; formal logic; Hoare logic; program segment; program verification; programming theory; theorem proving; theory; verification", pubcountry = "Netherlands A06", subject = "F.4.1 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Logic programming", treatment = "T Theoretical or Mathematical", } @Article{Apostolico:1987:FMC, author = "Alberto Apostolico and Susanne E. Hambrusch", title = "Finding maximum cliques on circular-arc graphs", journal = j-INFO-PROC-LETT, volume = "26", number = "4", pages = "209--215", day = "4", month = dec, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (05C35 68Q20 68R10)", MRnumber = "89a:68094", MRreviewer = "Narsingh Deo", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Purdue Univ., West Lafayette, IN, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "algorithms; circular-arc graphs; computational complexity; graph theory; maximum cliques; theory; time bound; verification", pubcountry = "Netherlands A07", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms \\ I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms", treatment = "T Theoretical or Mathematical", } @Article{Baleanu:1987:ASP, author = "C. Baleanu and D. Tomescu", title = "An architecture for symbolic processing", journal = j-INFO-PROC-LETT, volume = "26", number = "4", pages = "217--222", day = "4", month = dec, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C5220 (Computer architecture)", corpsource = "ICPE-CCE, Bucuresti, Romania", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "compact list representation; computer architecture; design; functional languages; instruction sets; list processing; logic programming languages; recursive control; symbol manipulation; symbolic processing; theory", pubcountry = "Netherlands A08", subject = "C.1.m Computer Systems Organization, PROCESSOR ARCHITECTURES, Miscellaneous", treatment = "P Practical", } @Article{Arbib:1988:PCS, author = "Claudio Arbib", title = "A polynomial characterization of some graph partitioning problems", journal = j-INFO-PROC-LETT, volume = "26", number = "5", pages = "223--230", day = "11", month = jan, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (05C70 68R10)", MRnumber = "89e:68043", MRreviewer = "Satoru Miyano", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ degli Studi 'La Sapienza', Rome, Italy", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dipartimento di Inf. e Sistemistica, Roma Univ., Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; computational complexity; computer programming --- Algorithms; diagraphs; digraphs; directed graphs; graph partitioning; Graph Theory; graph theory; instance space; line-graphs; mathematical techniques; NP-complete; polynomial algorithm; polynomial characterization; polynomial-time algorithms; simple max partition; theory; uniform partition; verification", pubcountry = "Netherlands A01", subject = "G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous", treatment = "T Theoretical or Mathematical", } @Article{Culik:1988:TSN, author = "Karel {Culik, II} and Juhani Karhum{\"a}ki", title = "On totalistic systolic networks", journal = j-INFO-PROC-LETT, volume = "26", number = "5", pages = "231--236", day = "11", month = jan, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q80 (68U20)", MRnumber = "89e:68096", MRreviewer = "J. Gruska", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Waterloo, Waterloo, Ont, Can", classification = "721; 722; 723; 921; C1160 (Combinatorial mathematics); C4220 (Automata theory)", corpsource = "Dept. of Comput. Sci., Waterloo Univ., Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; cellular automata; computer systems, digital; diagraphs; directed graphs; finite automata; graph coloring; graph colouring; mathematical techniques --- Graph Theory; Parallel Processing; synchronized processors; systolic networks; theory; totalistic systolic networks; uniform regular network; verification", pubcountry = "Netherlands A02", subject = "F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Unbounded-action devices \\ F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Automata \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Network problems", treatment = "T Theoretical or Mathematical", } @Article{Sieminski:1988:FDH, author = "Andrzej Sieminski", title = "Fast decoding of the {Huffman} codes", journal = j-INFO-PROC-LETT, volume = "26", number = "5", pages = "237--241", day = "11", month = jan, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Technical Univ of Wroclaw, Wroclaw, Pol", classification = "723; C4240 (Programming and algorithm theory); C6120 (File organisation); C6130 (Data handling techniques)", corpsource = "Dept. of Inf. Syst., Tech. Univ. of Wroclaw, Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; codes, symbolic; computer programming --- Algorithms; data compression; data handling; database systems; Decoding; decoding; decoding algorithm; file organisation; file processing; Huffman algorithm; Huffman codes; information theory --- Data Compression; minimum redundancy codes; redundancy; theory", pubcountry = "Netherlands A03", subject = "E.4 Data, CODING AND INFORMATION THEORY, Data compaction and compression", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Morgan:1988:DRM, author = "Carroll C. Morgan", title = "Data refinement by miracles", journal = j-INFO-PROC-LETT, volume = "26", number = "5", pages = "243--246", day = "11", month = jan, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Oxford Univ, Oxford, Engl", classification = "723; C4240 (Programming and algorithm theory); C6120 (File organisation)", corpsource = "Oxford Univ. Comput. Lab., UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "abstract data types; computer metatheory --- Programming Theory; computer programming; concrete data type; concrete data types; data refinement; data refinements; data structures; miracles; program fragments; programming theory; reliability; Theory; theory; verification", pubcountry = "Netherlands A04", subject = "D.2.m Software, SOFTWARE ENGINEERING, Miscellaneous", treatment = "T Theoretical or Mathematical", } @Article{Dymond:1988:IDL, author = "Patrick W. Dymond", title = "Input-driven languages are in $\log n$ depth", journal = j-INFO-PROC-LETT, volume = "26", number = "5", pages = "247--250", day = "11", month = jan, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q15 (68Q45)", MRnumber = "89e:68035", MRreviewer = "Helmut Alt", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of California, San Diego, CA, USA", classification = "721; 723; C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci. and Eng., California Univ., San Diego, La Jolla, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; automata theory; Boolean circuit; bounded fan-in; computational complexity; computer programming --- Algorithms; Context Free Languages; context-free language; context-free languages; input driven languages; input symbol; input-driven languages; languages; log depth circuit; log n depth; log n space; logic circuits; parallel computation; recognition algorithm; recognition algorithms; theory", pubcountry = "Netherlands A05", subject = "F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Classes defined by grammars or automata", treatment = "T Theoretical or Mathematical", } @Article{Soisalon-Soininen:1988:LLP, author = "Eljas Soisalon-Soininen and Jorma Tarhio", title = "Looping {LR} parsers", journal = j-INFO-PROC-LETT, volume = "26", number = "5", pages = "251--253", day = "11", month = jan, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q50", MRnumber = "89f:68039", MRreviewer = "J. Calvert", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Helsinki, Helsinki, Finl", classification = "721; 723; C4210 (Formal logic); C4240 (Programming and algorithm theory); C6150C (Compilers, interpreters and other processors)", corpsource = "Dept. of Comput. Sci., Helsinki Univ., Finland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; arbitrary grammar; automata theory; compilers; computational complexity; computer programming --- Algorithms; context free grammars; context-free grammars; grammars; languages; looping; looping LR parsers; LR parsers; program compilers; testing algorithm; theory; time complexity; verification", pubcountry = "Netherlands A06", subject = "F.4.2 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems, Parsing \\ D.3.4 Software, PROGRAMMING LANGUAGES, Processors, Compilers \\ D.3.4 Software, PROGRAMMING LANGUAGES, Processors, Parsing", treatment = "T Theoretical or Mathematical", } @Article{Hinrichs:1988:PSS, author = "Klaus Hinrichs and J{\"u}rg Nievergelt and Peter Schorn", title = "Plane-sweep solves the closest pair problem elegantly", journal = j-INFO-PROC-LETT, volume = "26", number = "5", pages = "255--261", day = "11", month = jan, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68U05 (68Q25)", MRnumber = "89a:68206", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of North Carolina, Chapel Hill, NC, USA", classification = "723; 921; C4190 (Other numerical methods); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; asymptotically optimal time; closest pair problem; computational complexity; computational geometry; computer programming; mathematical techniques --- Geometry; plane sweep; plane-sweep algorithm; theory; time complexity", pubcountry = "Netherlands A07", subject = "G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations", treatment = "T Theoretical or Mathematical", } @Article{DeVel:1988:IPA, author = "O. Y. {De Vel} and E. V. Krishnamurthy", title = "An iterative pipelined array architecture for the generalized matrix inversion", journal = j-INFO-PROC-LETT, volume = "26", number = "5", pages = "263--267", day = "11", month = jan, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "65F20 (65V05 65W05)", MRnumber = "88j:65080", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Waikato, Hamilton, NZ", classification = "723; 921; C4140 (Linear algebra); C4240 (Programming and algorithm theory); C5440 (Multiprocessor systems and techniques)", corpsource = "Dept. of Comput. Sci., Waikato Univ., Hamilton, New Zealand", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; computer architecture; computer programming; computer systems, digital --- Parallel Processing; design; generalized matrix inversion; iterative pipelined array architecture; iterative pipelining; mathematical techniques --- Matrix Algebra; matrix algebra; Moore--Penrose generalized inverse; numerical stability; pipeline processing; programming theory; rectangular matrix; theory; VLSI chip design", pubcountry = "Netherlands A08", subject = "G.1.3 Mathematics of Computing, NUMERICAL ANALYSIS, Numerical Linear Algebra, Matrix inversion \\ C.1.1 Computer Systems Organization, PROCESSOR ARCHITECTURES, Single Data Stream Architectures, Pipeline processors \\ C.1.2 Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors), Pipeline processors", treatment = "T Theoretical or Mathematical", } @Article{Cook:1988:SPF, author = "Stephen A. Cook", title = "Short propositional formulas represent nondeterministic computations", journal = j-INFO-PROC-LETT, volume = "26", number = "5", pages = "269--270", day = "11", month = jan, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q05 (03D15 68Q15)", MRnumber = "89i:68028", MRreviewer = "John Michael Robson", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Toronto, Toronto, Ont, Can", classification = "721; C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Toronto Univ., Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; complexity; computational complexity; nondeterministic computations; nondeterministic multitape; nondeterministic Turing machine; NP-completeness; propositional formulas; quasilinear time; satisfiability; satisfiability problem; theory; Turing machine; Turing Machines; Turing machines", pubcountry = "Netherlands A09", subject = "F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Bounded-action devices \\ F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Alternation and nondeterminism", treatment = "T Theoretical or Mathematical", } @Article{Makinen:1988:RDB, author = "Erkki M{\"a}kinen", title = "On the rotation distance of binary trees", journal = j-INFO-PROC-LETT, volume = "26", number = "5", pages = "271--272", day = "11", month = jan, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "05C05 (68P05 68R10)", MRnumber = "89a:05055", MRreviewer = "Fabrizio Luccio", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Tampere, Tampere, Finl", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory); C6120 (File organisation)", corpsource = "Dept. of Comput. Sci., Tampere Univ., Finland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "binary search tree; binary trees; bound; computational complexity; data processing --- Data Structures; data structures; mathematical techniques; rotation distance; theory; Trees; trees (mathematics); upper bounds; verification", pubcountry = "Netherlands A10", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees \\ I.2.8 Computing Methodologies, ARTIFICIAL INTELLIGENCE, Problem Solving, Control Methods, and Search, Graph and tree search strategies", treatment = "T Theoretical or Mathematical", } @Article{Seiferas:1988:VBO, author = "Joel Seiferas", title = "A Variant of {Ben-Or}'s Lower Bound for Algebraic Decision Trees", journal = j-INFO-PROC-LETT, volume = "26", number = "5", pages = "273--276", day = "11", month = jan, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q05 (68Q30)", MRnumber = "89d:68015", MRreviewer = "Ingo Wegener", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Rochester, Rochester, NY, USA", classification = "921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept of Comput. Sci., Rochester Univ., NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algebraic decision trees; Ben-Or; computational complexity; computational geometry; convex hull; convex hull problem; lower bound; lower bounds; mathematical techniques; set membership; Set Theory; set theory; theory; trees (mathematics); verification", pubcountry = "Netherlands A11", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations", treatment = "T Theoretical or Mathematical", } @Article{Gopalakrishnan:1988:IFP, author = "Ganesh C. Gopalakrishnan and Mandayam K. Srivas", title = "Implementing functional programs using mutable abstract data types", journal = j-INFO-PROC-LETT, volume = "26", number = "6", pages = "277--286", day = "25", month = jan, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Utah, Salt Lake City, UT, USA", classification = "723; C4240 (Programming and algorithm theory); C6120 (File organisation)", corpsource = "Dept. of Comput. Sci., Utah Univ., Salt Lake City, UT, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "abstract data type; computer metatheory --- Programming Theory; computer programming; data structures; destructive updating; functional program implementation; functional programs; graphical model; iterative schema; languages; mutable abstract data types; mutable module; programming theory; recursion; syntactic condition; syntactic conditions; theory; Theory; update operations; verification", pubcountry = "Netherlands A01", subject = "D.3.3 Software, PROGRAMMING LANGUAGES, Language Constructs, Abstract data types \\ D.3.3 Software, PROGRAMMING LANGUAGES, Language Constructs, Modules, packages \\ D.1.1 Software, PROGRAMMING TECHNIQUES, Applicative (Functional) Programming \\ G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous", treatment = "T Theoretical or Mathematical", } @Article{Chan:1988:BPT, author = "Tat Hung Chan", title = "The boundedness problem for three-dimensional vector addition systems with states", journal = j-INFO-PROC-LETT, volume = "26", number = "6", pages = "287--289", day = "25", month = jan, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q15 (68Q90)", MRnumber = "89b:68028", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Hong Kong, Hong Kong", classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Centre of Comput. Studies and Applications, Hong Kong Univ., Hong Kong", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; boundedness; boundedness problem; computational complexity; computer metatheory; deterministic linear bounded automata; NP-hard; NP-hardness; PSPACE-complete; pspace-hardness; theory; three-dimensional vector addition systems; vector addition systems with states; verification", pubcountry = "Netherlands A02", subject = "F.1.3 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes", treatment = "T Theoretical or Mathematical", } @Article{Maggs:1988:MCS, author = "Bruce M. Maggs and Serge A. Plotkin", title = "Minimum-cost spanning tree as a path-finding problem", journal = j-INFO-PROC-LETT, volume = "26", number = "6", pages = "291--293", day = "25", month = jan, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q20 (05C05 05C35 68R10 90B10)", MRnumber = "89a:68091", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "MIT, Cambridge, MA, USA", classification = "723; 921; C4240 (Programming and algorithm theory)", corpsource = "Lab. for Comput. Sci., MIT, Cambridge, MA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; asymptotic running time; closed semiring path-finding; computer programming --- Algorithms; computer systems, digital --- Parallel Processing; mathematical techniques; mesh-connected computers; minimisation; minimum-cost spanning tree; nonrecursive algorithm; parallel algorithms; path-finding problem; theory; Trees; trees (mathematics); verification", pubcountry = "Netherlands A03", subject = "F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Path and circuit problems", treatment = "T Theoretical or Mathematical", } @Article{Cole:1988:OES, author = "Richard John Cole", title = "An optimally efficient selection algorithm", journal = j-INFO-PROC-LETT, volume = "26", number = "6", pages = "295--299", day = "25", month = jan, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "New York Univ, New York, NY, USA", classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., New York Univ., NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; computational complexity; computer programming; computer systems, digital --- Parallel Processing; concurrent-read concurrent-write; CRCW PRAM; EREW PRAM; exclusive-read exclusive-write; optimal algorithms; optimally efficient; parallel algorithm; parallel algorithms; parallel random access machine; selection algorithm; theory", pubcountry = "Netherlands A04", subject = "F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism \\ G.1.0 Mathematics of Computing, NUMERICAL ANALYSIS, General, Parallel algorithms", treatment = "T Theoretical or Mathematical", } @Article{Cidon:1988:YAD, author = "Isreal Cidon", title = "Yet another distributed depth-first-search algorithm", journal = j-INFO-PROC-LETT, volume = "26", number = "6", pages = "301--305", day = "25", month = jan, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "IBM, Yorktown Heights, NY, USA", classification = "723; C4240 (Programming and algorithm theory); C5620 (Computer networks and techniques)", corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; communication complexity; computational complexity; computer programming; computer systems, digital --- Distributed; depth-first-search; depth-first-search algorithm; distributed algorithm; distributed algorithms; distributed processing; theory; time complexity; verification", pubcountry = "Netherlands A05", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching", treatment = "T Theoretical or Mathematical", } @Article{Karlsson:1988:NDC, author = "Rolf G. Karlsson and Mark H. Overmars", title = "Normalized divide-and-conquer: a scaling technique for solving multi-dimensional problems", journal = j-INFO-PROC-LETT, volume = "26", number = "6", pages = "307--312", day = "25", month = jan, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q20 (68U05)", MRnumber = "89a:68089", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Linkoping Univ, Linkoping, Swed", classification = "723; 921; C4190 (Other numerical methods); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Linkoping Univ., Sweden", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; arbitrary space; computational complexity; computational geometry; computer programming; mathematical techniques --- Geometry; maximal elements; multi-dimensional problems; multidimensional problems; normalized divide-and-conquer; rectangle intersection; scaling technique; table lookup; theory; verification", pubcountry = "Netherlands A06", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations \\ G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous", treatment = "T Theoretical or Mathematical", } @Article{Czaja:1988:CS, author = "Ludwik Czaja", title = "Cause-effect structures", journal = j-INFO-PROC-LETT, volume = "26", number = "6", pages = "313--319", day = "25", month = jan, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Warsaw, Warsaw, Pol", classification = "921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Inst. of Inf., Warsaw Univ., Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algebraic calculus; cause-effect structures; concurrency; concurrent systems; directed graphs; Graph Theory; mathematical techniques; parallel algorithms; Petri nets; theory", pubcountry = "Netherlands A07", subject = "F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Unbounded-action devices \\ G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous", treatment = "T Theoretical or Mathematical", } @Article{Bezem:1988:ECL, author = "Marc Bezem and Jan {Van Leeuwen}", title = "On estimating the complexity of logarithmic decompositions", journal = j-INFO-PROC-LETT, volume = "26", number = "6", pages = "321--324", day = "25", month = jan, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (68P05)", MRnumber = "89a:68096", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Cent for Mathematics \& Computer Science, Amsterdam, Neth", classification = "723; 921; C4240 (Programming and algorithm theory); C6120 (File organisation)", corpsource = "Centre for Math. and Comput. Sci., Amsterdam, Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "binary representation; complexity; computational complexity; data processing; Data Structures; data structures; dynamic data structures; logarithmic decompositions; mathematical techniques --- Estimation; theory; verification", pubcountry = "Netherlands A08", subject = "I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms \\ E.1 Data, DATA STRUCTURES \\ F.1.3 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes", treatment = "T Theoretical or Mathematical", } @Article{Gilbert:1988:SND, author = "John Russell Gilbert", title = "Some nested dissection order is nearly optimal", journal = j-INFO-PROC-LETT, volume = "26", number = "6", pages = "325--328", day = "25", month = jan, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68R10 (05C99 68Q25)", MRnumber = "89b:68054", MRreviewer = "Dieter Kratsch", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Cornell Univ, Ithaca, NY, USA", classification = "723; 921; C1110 (Algebra); C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; chordal graph; computational complexity; computer programming --- Algorithms; directed graphs; Graph Theory; mathematical techniques; matrix algebra; minimum fill problem; nested dissection; nested dissection order; NP-complete; separator theorem; sparse matrix algorithm; sparse symmetric matrix; theory; triangular factor; undirected graph; verification", pubcountry = "Netherlands A09", subject = "G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous \\ F.2.1 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Computations on matrices", treatment = "T Theoretical or Mathematical", } @Article{Balakrishnan:1988:SAM, author = "M. Balakrishnan and S. Sutarwala and A. K. Majumdar and D. K. Banerji and J. G. Linders and J. C. Majithia", title = "A semantic approach for modular synthesis of {VLSI} systems", journal = j-INFO-PROC-LETT, volume = "27", number = "1", pages = "1--7", day = "15", month = feb, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Guelph, Guelph, Ont, Can", classification = "714; 721; 722; 723; B1130B (Computer-aided circuit analysis and design); B2570 (Semiconductor integrated circuits); C7410D (Electronic engineering)", corpsource = "Dept. of Comput. and Inf. Sci., Guelph Univ., Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "circuit CAD; computer hardware description languages; computer systems, digital; datapath synthesis; decentralized control synthesis; decentralized control systems; design; digital systems; integrated circuits, VLSI; languages; logic design; modular synthesis; presynthesized library modules; reliability; semantic analysis; specification languages; Synthesis; theory; VLSI; VLSI systems", pubcountry = "Netherlands A01", subject = "B.7.2 Hardware, INTEGRATED CIRCUITS, Design Aids, Simulation \\ B.7.1 Hardware, INTEGRATED CIRCUITS, Types and Design Styles, VLSI (very large scale integration) \\ C.4 Computer Systems Organization, PERFORMANCE OF SYSTEMS, Modeling techniques \\ B.1.4 Hardware, CONTROL STRUCTURES AND MICROPROGRAMMING, Microprogram Design Aids, Languages and compilers", treatment = "P Practical", } @Article{Li:1988:STO, author = "Ming Li", title = "A separator theorem for one-dimensional graphs under linear mapping", journal = j-INFO-PROC-LETT, volume = "27", number = "1", pages = "9--11", day = "15", month = feb, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "05C99 (68Q05 68R10)", MRnumber = "89d:05164", MRreviewer = "Dieter Kratsch", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Harvard Univ, Cambridge, MA, USA", classification = "921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Aiken Comput. Lab., Harvard Univ., Cambridge, MA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computational complexity; graph separators; Graph Theory; graph theory; linear mapping; mathematical techniques; one-dimensional graphs; separator theorem; theory; verification", pubcountry = "Netherlands A02", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory", treatment = "T Theoretical or Mathematical", } @Article{Atallah:1988:SEU, author = "Mikhail J. Atallah and Greg N. Frederickson and S. Rao Kosaraju", title = "Sorting with efficient use of special-purpose sorters", journal = j-INFO-PROC-LETT, volume = "27", number = "1", pages = "13--15", day = "15", month = feb, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Purdue Univ, West Lafayette, IN, USA", classification = "723; C4240 (Programming and algorithm theory); C6130 (Data handling techniques)", corpsource = "Dept. of Comput. Sci., Purdue Univ., West Lafayette, IN, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "B tree; computational complexity; computer systems programming; lower bounds; random access machine; Sorting; sorting; special-purpose sorters; theory; time bound; time bounds; verification", pubcountry = "Netherlands A03", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees", treatment = "T Theoretical or Mathematical", } @Article{Ramalingam:1988:TDI, author = "G. Ramalingam and C. Pandu Rangan", title = "Total domination in interval graphs revisited", journal = j-INFO-PROC-LETT, volume = "27", number = "1", pages = "17--21", day = "15", month = feb, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68R10 (05C35 68Q25)", MRnumber = "89i:68102", MRreviewer = "M. C. Golumbic", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Indian Inst of Technology, Madras, India", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci. and Eng., Indian Inst. of Technol., Madras, India", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; computational complexity; computer programming --- Algorithms; Graph Theory; graph theory; intersection graph; interval graphs; linear algorithm; mathematical techniques; minimum cardinality; minimum cardinality total-dominating set; theory; total domination; verification", pubcountry = "Netherlands A04", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms", treatment = "T Theoretical or Mathematical", } @Article{Lyon:1988:TML, author = "Gordon Lyon", title = "A tagless marking that is linear over subtrees", journal = j-INFO-PROC-LETT, volume = "27", number = "1", pages = "23--28", day = "15", month = feb, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "NBS, Gaithersburg, MD, USA", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory); C6120 (File organisation)", corpsource = "Inst. for Comput. Sci. and Technol., NBS, Gaithersburg, MD, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; computational complexity; computer programming; computer systems, digital --- Parallel Processing; directed binary graph; directed graphs; garbage collection; graph traversal; linear time; mathematical techniques --- Trees; storage management; subtrees; tagless marking; theory; trees (mathematics)", pubcountry = "Netherlands A05", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Josephs:1988:DRC, author = "Mark B. Josephs", title = "The data refinement calculator for {$Z$} specifications", journal = j-INFO-PROC-LETT, volume = "27", number = "1", pages = "29--33", day = "15", month = feb, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "IBM, Yorktown Heights, NY, USA", classification = "723; C4240 (Programming and algorithm theory); C6120 (File organisation)", corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "abstract data type; computer metatheory; computer programming --- Theory; correctness; data refinement; data structures; program verification; Programming Theory; programming theory; reliability; specification languages; theory; verification; weakest precondition; Z language; Z specifications", pubcountry = "Netherlands A06", subject = "D.2.m Software, SOFTWARE ENGINEERING, Miscellaneous \\ D.2.4 Software, SOFTWARE ENGINEERING, Program Verification", treatment = "T Theoretical or Mathematical", } @Article{Lea:1988:DHT, author = "Douglas Lea", title = "Digital and {Hilbert} ${K}$-${D}$ Trees", journal = j-INFO-PROC-LETT, volume = "27", number = "1", pages = "35--41", day = "15", month = feb, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "State Univ of New York, Oswego, NY, USA", classification = "723; 921; C4240 (Programming and algorithm theory); C6120 (File organisation)", corpsource = "Dept. of Comput. Sci., State Univ. of New York, Oswego, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "$k$-$d$ trees; algorithms; computational complexity; data processing; data structures; Data Structures; design; dictionary search; digital $k$-$d$ trees; digital $K$-$D$ trees; Hilbert $k$-$d$ trees; Hilbert $K$-$D$ trees; mathematical techniques --- Trees; multi-dimensional data; multi-dimensional search; multidimensional search; performance; theory; time complexity; trees (mathematics)", pubcountry = "Netherlands A07", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees \\ E.1 Data, DATA STRUCTURES, Trees", treatment = "T Theoretical or Mathematical", } @Article{Gibbons:1988:PTE, author = "Alan M. Gibbons and Amos Israeli and Wojciech Rytter", title = "Parallel {$O(\log n)$} time edge-colouring of trees and {Halin} graphs", journal = j-INFO-PROC-LETT, volume = "27", number = "1", pages = "43--51", day = "15", month = feb, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (05C05 05C15 68R10)", MRnumber = "89a:68100", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Warwick, Coventry, Engl", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Warwick Univ., Coventry, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; coloring algorithm; colouring algorithm; computational complexity; computer programming; computer systems, digital --- Parallel Processing; edge-coloring; graph colouring; graph theory; Halin graph; Halin graphs; Hamiltonian cycle; mathematical techniques --- Trees; optimal edge-colouring; parallel algorithms; parallel random access machine; PRAM; theory; time algorithms; tree coloring; trees; trees (mathematics); verification", pubcountry = "Netherlands A08", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms \\ G.1.0 Mathematics of Computing, NUMERICAL ANALYSIS, General, Parallel algorithms", treatment = "T Theoretical or Mathematical", } @Article{Chang:1988:ESO, author = "Jik H. Chang and Oscar H. Ibarra and Bala Ravikumar", title = "Erratum: {``Some observations concerning alternating {Turing} machines using small space'' [Inform. Process. Lett. {\bf 25} (1987), no. 1, 1--9; MR 88e:68026] by the authors and L. Berman}", journal = j-INFO-PROC-LETT, volume = "27", number = "1", pages = "53--53", day = "15", month = feb, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q05 (03D10 03D15 68Q15)", MRnumber = "89a:68048", bibdate = "Sat Apr 11 12:24:20 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See \cite{Chang:1987:SOC}.", acknowledgement = ack-nhfb, fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", } @Article{Chlebus:1988:PBS, author = "Bogdan S. Chlebus", title = "A parallel bucket sort", journal = j-INFO-PROC-LETT, volume = "27", number = "2", pages = "57--61", day = "29", month = feb, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68P10 (68Q25)", MRnumber = "89a:68031", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Warsaw Univ, Warsaw, Pol", classification = "723; C4240 (Programming and algorithm theory); C6130 (Data handling techniques)", corpsource = "Inst. of Inf., Warsaw Univ., Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; asymptotically optimal; computational complexity; computer programming --- Algorithms; computer systems programming; computer systems, digital --- Parallel Processing; integer sorting; optimal algorithms; parallel algorithms; parallel bucket sort; parallel RAM; PRAM; simultaneous resource bounds; Sorting; sorting; theory; verification", pubcountry = "Netherlands A01", subject = "G.1.0 Mathematics of Computing, NUMERICAL ANALYSIS, General, Parallel algorithms \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching \\ F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism", treatment = "T Theoretical or Mathematical", } @Article{Witaszek:1988:PMF, author = "Jacek Witaszek", title = "A practical method for finding the optimum postponement transformation for {LR}(k) parsers", journal = j-INFO-PROC-LETT, volume = "27", number = "2", pages = "63--67", day = "29", month = feb, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Inst of Mathematical Machines, Warsaw, Pol", classification = "721; C4210 (Formal logic)", corpsource = "Inst. of Math. Machines, Warsaw, Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; compatibility; compilers; Grammars; grammars; languages; LR(k) parsers; optimisation; optimum p-transformation; optimum postponement transformation; partitioning; program compilers; theory", pubcountry = "Netherlands A02", subject = "D.3.4 Software, PROGRAMMING LANGUAGES, Processors, Compilers \\ D.3.4 Software, PROGRAMMING LANGUAGES, Processors, Parsing", treatment = "T Theoretical or Mathematical", } @Article{Singhal:1988:PAC, author = "Mukesh Singhal and Yelena Yesha", title = "A polynomial algorithm for computation of the probability of conflicts in a database under arbitrary data access distribution", journal = j-INFO-PROC-LETT, volume = "27", number = "2", pages = "69--74", day = "29", month = feb, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Ohio State Univ, Columbus, OH, USA", classification = "723; C4240 (Programming and algorithm theory); C4250 (Database theory)", corpsource = "Dept. of Comput. and Inf. Sci., Ohio State Univ., Columbus, OH, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "access distribution; algorithms; arbitrary data access distribution; computational complexity; computer programming --- Algorithms; concurrency control; conflicts probability; data access distribution; database management systems; database systems; database theory; distributed databases; management; performance; polynomial algorithm; probability; theory", pubcountry = "Netherlands A03", subject = "H.2.4 Information Systems, DATABASE MANAGEMENT, Systems, Concurrency \\ G.3 Mathematics of Computing, PROBABILITY AND STATISTICS, Probabilistic algorithms (including Monte Carlo)", treatment = "T Theoretical or Mathematical", } @Article{Miyano:1988:PLF, author = "Satoru Miyano", title = "A parallelizable lexicographically first maximal edge- induced subgraph problem", journal = j-INFO-PROC-LETT, volume = "27", number = "2", pages = "75--78", day = "29", month = feb, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q15 (05C99)", MRnumber = "89e:68038", MRreviewer = "Mirko K{\v{r}}iv{\'a}nek", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ-GH-Paderborn, Paderborn, West Ger", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Fachbereich 17-Math. und Inf., Univ. GH-Paderborn, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "complexity; computational complexity; computer metatheory; Graph Theory; graph theory; graphs; lexicographically first maximal edge-induced subgraph; mathematical techniques; maximal subgraph problem; NC/sup 2/; outerplanar graphs; parallel algorithms; parallelizable; theory; triangle-free graphs; verification", pubcountry = "Netherlands A04", subject = "F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory", treatment = "T Theoretical or Mathematical", } @Article{Chang:1988:OMP, author = "C. C. Chang and C. H. Chang", title = "An Ordered Minimal Perfect Hashing Scheme with Single Parameter", journal = j-INFO-PROC-LETT, volume = "27", number = "2", pages = "79--83", day = "29", month = feb, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", abstract = "This paper proposes a new ordered minimal perfect hashing scheme with only one parameter. By applying our hashing functions, all keys can be stored in ascending order. There is one very straightforward formula to compute the only parameter C, that requires O(n log//2K//n) time, where n is the total number of keys and k//n is the key with maximum magnitude.", acknowledgement = ack-nhfb, affiliationaddress = "Natl Chung Hsing Univ, Taichung, Taiwan", classification = "723; C4240 (Programming and algorithm theory); C6120 (File organisation)", corpsource = "Inst. of Appl. Math., Nat. Chung Hsing Univ., Taichung, Taiwan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "addition chain method; algorithms; computational complexity; computer programming --- Algorithms; data processing; file organisation; File Organization; hash-table representation; hashing functions; key storage; ordered minimal perfect hashing; single parameter; theory; verification", pubcountry = "Netherlands A05", subject = "E.2 Data, DATA STORAGE REPRESENTATIONS, Hash-table representations \\ I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Algebraic algorithms", treatment = "T Theoretical or Mathematical", } @Article{Liu:1988:DPU, author = "Robin Liu and Simeon Ntafos", title = "On decomposing polygons into uniformly monotone parts", journal = j-INFO-PROC-LETT, volume = "27", number = "2", pages = "85--89", day = "29", month = feb, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68U05", MRnumber = "89a:68209", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "New Jersey Inst of Technology, Newark, NJ, USA", classification = "723; 921; C4190 (Other numerical methods); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. and Inf. Sci., New Jersey Inst. of Technol., Newark, NJ, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; circle; computation geometry; computational complexity; computational geometry; computer programming; dynamic programming; independent chords; mathematical techniques --- Geometry; maximum set of independent chords; polygon decomposition; theory; uniformly monotone parts; uniformly monotone polygons; verification", pubcountry = "Netherlands A06", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations \\ I.2.8 Computing Methodologies, ARTIFICIAL INTELLIGENCE, Problem Solving, Control Methods, and Search, Dynamic programming", treatment = "T Theoretical or Mathematical", } @Article{Baader:1988:NUT, author = "Franz Baader", title = "A note on unification type zero", journal = j-INFO-PROC-LETT, volume = "27", number = "2", pages = "91--93", day = "29", month = feb, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68T15 (03B35)", MRnumber = "89a:68188", MRreviewer = "Mukkai S. Krishnamoorthy", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Friedrich-Alexander-Univ Erlangen-Nuernberg, Erlangen, West Ger", classification = "921; C1160 (Combinatorial mathematics); C4210 (Formal logic)", corpsource = "Inst. f{\"u}r Math. Machinen und Datenverarbeitung, Friedrich-Alexander-Univ., Erlangen-N{\"u}rnberg, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "E-unifier; equality of terms; equational theory; formal logic; lower bounds; mathematical techniques; set theory; theory; unification type zero; verification", pubcountry = "Netherlands A07", subject = "G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous", treatment = "T Theoretical or Mathematical", } @Article{Sandhu:1988:CIT, author = "Ravinderpal S. Sandhu", title = "Cryptographic implementation of a tree hierarchy for access control", journal = j-INFO-PROC-LETT, volume = "27", number = "2", pages = "95--98", day = "29", month = feb, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Ohio State Univ, Columbus, OH, USA", classification = "723; 921; C4240 (Programming and algorithm theory); C6130 (Data handling techniques)", corpsource = "Dept. of Comput. and Inf. Sci., Ohio State Univ., Columbus, OH, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "access control; cryptographic key; cryptography; cryptosystems; design; mathematical techniques --- Trees; one-way function; privileged security class; rooted tree; security; theory; tree hierarchy; trees (mathematics)", pubcountry = "Netherlands A08", subject = "D.4.6 Software, OPERATING SYSTEMS, Security and Protection, Access controls \\ D.4.6 Software, OPERATING SYSTEMS, Security and Protection, Cryptographic controls \\ E.3 Data, DATA ENCRYPTION", treatment = "T Theoretical or Mathematical", } @Article{Patterson:1988:FVN, author = "Nicholas J. Patterson and Kenneth J. Supowit", title = "Finding the vertices nearest to a point in a hypercube", journal = j-INFO-PROC-LETT, volume = "27", number = "2", pages = "99--102", day = "29", month = feb, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Inst for Defense Analyses, Princeton, NJ, USA", classification = "723; 921; C1160 (Combinatorial mathematics); C1180 (Optimisation techniques); C4240 (Programming and algorithm theory)", corpsource = "Inst. for Defense Anal., Princeton, NJ, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "0-1 programming; Algorithms; algorithms; combinatorics; complexity; computational complexity; computer programming; hypercube; hypercubes; linear programming; mathematical programming; theory; trees; trees (mathematics); vertex; zero-one programming", pubcountry = "Netherlands A09", subject = "I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms \\ G.2.1 Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics", treatment = "T Theoretical or Mathematical", } @Article{Frieze:1988:RCH, author = "Alan M. Frieze", title = "On the random construction of heaps", journal = j-INFO-PROC-LETT, volume = "27", number = "2", pages = "103--109", day = "29", month = feb, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68P10 (68Q25)", MRnumber = "89c:68020", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of London, London, Engl", classification = "723; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory); C6120 (File organisation)", corpsource = "Dept. of Comput. Sci. and Stat., Queen Mary Coll., London Univ., UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; binary heap; binary heaps; computational complexity; computer programming --- Algorithms; data processing; Data Structures; data structures; heap construction; linear expected time construction; probability; random construction; random construction of heaps; theory; trees; trees (mathematics); upper bound; upper bounds; verification", pubcountry = "Netherlands A10", subject = "E.1 Data, DATA STRUCTURES", treatment = "T Theoretical or Mathematical", } @Article{Holenderski:1988:PDF, author = "Leszek Holenderski and Andrzej Sza{\l}as", title = "Propositional description of finite cause-effect structures", journal = j-INFO-PROC-LETT, volume = "27", number = "3", pages = "111--117", day = "25", month = mar, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68N05 (68Q20)", MRnumber = "89h:68010", MRreviewer = "T. M{\"u}ldner", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Warsaw, Warsaw, Pol", classification = "723; C4210 (Formal logic)", corpsource = "Inst. of Inf., Warsaw Univ., Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Boolean functions; computer metatheory; computer programming --- Theory; design; discrete dynamic systems; finite cause-effect structures; formal logic; Programming Theory; propositional calculus; semantics; temporal logic; theory; verification", pubcountry = "Netherlands A01", subject = "C.4 Computer Systems Organization, PERFORMANCE OF SYSTEMS, Modeling techniques \\ G.m Mathematics of Computing, MISCELLANEOUS \\ F.3.1 Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs, Logics of programs", treatment = "T Theoretical or Mathematical", } @Article{Johnson:1988:GAM, author = "David S. Johnson and Mihalis Yannakakis and Christos H. Papadimitriou", title = "On generating all maximal independent sets", journal = j-INFO-PROC-LETT, volume = "27", number = "3", pages = "119--123", day = "25", month = mar, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (05C35 68R10)", MRnumber = "89e:68051", MRreviewer = "T. R. S. Walsh", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "AT\&T Bell Lab, Murray Hill, NJ, USA", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "AT and T Bell Labs., Murray Hill, NJ, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; computational complexity; computer programming --- Algorithms; enumeration; graph; Graph Theory; graph theory; lexicographic order; mathematical techniques; maximal independent sets; NP complete; NP-complete; polynomial delay; set theory; theory; verification", pubcountry = "Netherlands A02", subject = "G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous", treatment = "T Theoretical or Mathematical", } @Article{Mehlhorn:1988:FAA, author = "Kurt Mehlhorn", title = "A faster approximation algorithm for the {Steiner} problem in graphs", journal = j-INFO-PROC-LETT, volume = "27", number = "3", pages = "125--128", day = "25", month = mar, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (05C05 68R10)", MRnumber = "89d:68031", MRreviewer = "Lawrence V. Saxton", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See note \cite{Floren:1991:NFA}.", acknowledgement = ack-nhfb, affiliationaddress = "Univ des Saarlandes, Saarbr{\"u}cken, West Ger", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Saarlandes Univ., Saarbrucken, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; approximation algorithm; computational complexity; computer programming --- Algorithms; connected undirected distance graph; Graph Theory; graph theory; mathematical techniques; Steiner minimal tree; Steiner problem; Steiner tree; theory; trees (mathematics); undirected distance graph", pubcountry = "Netherlands A03", subject = "G.1.2 Mathematics of Computing, NUMERICAL ANALYSIS, Approximation \\ G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous", treatment = "T Theoretical or Mathematical", } @Article{Chandran:1988:OSH, author = "Sharat Chandran and Azriel Rosenfeld", title = "Order statistics on a hypercube", journal = j-INFO-PROC-LETT, volume = "27", number = "3", pages = "129--132", day = "25", month = mar, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Maryland, College Park, MD, USA", classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Centre for Autom. Res., Maryland Univ., College Park, MD, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; communication cost; computational complexity; computer programming; computer systems, digital --- Parallel Processing; hypercube; message transfer; multiprocessor; optimal parallel algorithm; order statistics; parallel algorithm; parallel algorithms; selection problem; theory", pubcountry = "Netherlands A04", subject = "G.1.0 Mathematics of Computing, NUMERICAL ANALYSIS, General, Parallel algorithms \\ G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous", treatment = "T Theoretical or Mathematical", } @Article{Bertossi:1988:PCA, author = "Alan A. Bertossi", title = "Parallel circle-cover algorithms", journal = j-INFO-PROC-LETT, volume = "27", number = "3", pages = "133--139", day = "25", month = mar, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ di Pisa, Pisa, Italy", classification = "723; 921; C1160 (Combinatorial mathematics); C4190 (Other numerical methods); C4240 (Programming and algorithm theory)", corpsource = "Dipartimento di Inf., Pisa Univ., Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; circle-cover algorithms; circular-arcs; combinatorial mathematics; computational complexity; computational geometry; computer programming; computer systems, digital --- Parallel Processing; mathematical techniques --- Geometry; minimum cardinality cover; parallel algorithms; parallel computers; shared memory model; theory; verification", pubcountry = "Netherlands A05", subject = "I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms \\ G.1.0 Mathematics of Computing, NUMERICAL ANALYSIS, General, Parallel algorithms \\ G.4 Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm analysis \\ G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous", treatment = "T Theoretical or Mathematical", } @Article{Cook:1988:SPA, author = "Stephen A. Cook and Michael Luby", title = "A simple parallel algorithm for finding a satisfying truth assignment to a $2${-CNF} formula", journal = j-INFO-PROC-LETT, volume = "27", number = "3", pages = "141--145", day = "25", month = mar, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q10 (03B05 03B35 68Q20 68Q25)", MRnumber = "89h:68039", MRreviewer = "Joseph J{\'a}J{\'a}", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Toronto, Toronto, Ont, Can", classification = "723; C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Toronto Univ., Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "2-CNF formula; algorithms; Algorithms; computational complexity; computer programming; computer systems, digital --- Parallel Processing; concurrent-read concurrent-write parallel random access machine; CRCW PRAM; formal logic; parallel algorithm; parallel algorithms; satisfiability; theory; truth assignment", pubcountry = "Netherlands A06", subject = "G.1.0 Mathematics of Computing, NUMERICAL ANALYSIS, General, Parallel algorithms", treatment = "T Theoretical or Mathematical", } @Article{Berman:1988:PBD, author = "Joel Berman and Willem J. Blok", title = "Positive {Boolean} dependencies", journal = j-INFO-PROC-LETT, volume = "27", number = "3", pages = "147--150", day = "25", month = mar, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68P15", MRnumber = "89h:68021", MRreviewer = "J{\'a}nos Demetrovics", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Illinois at Chicago, Chicago, IL, USA", classification = "723; C4210 (Formal logic); C4250 (Database theory)", corpsource = "Dept. of Math., Stat. and Comput. Sci., Illinois Univ., Chicago, IL, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Boolean algebra; boolean dependency; Boolean terms; combinatorial mathematics; combinatorial objects; computer metatheory --- Formal Logic; consequence relation; database systems; database theory; formal logic; functional dependency; management; positive Boolean dependencies; propositional logic; Relational; relational database; relational databases; theory; verification", pubcountry = "Netherlands A07", subject = "H.2.m Information Systems, DATABASE MANAGEMENT, Miscellaneous \\ G.m Mathematics of Computing, MISCELLANEOUS", treatment = "T Theoretical or Mathematical", } @Article{Watanabe:1988:HOW, author = "Osamu Watanabe", title = "On hardness of one-way functions", journal = j-INFO-PROC-LETT, volume = "27", number = "3", pages = "151--157", day = "25", month = mar, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q15 (03D15)", MRnumber = "90k:68053", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Tokyo Inst. of Technol., Meguro, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "complexity; computation model; computational complexity; hardness; inverse; measurement; one-way functions; polynomial lowness; theory; Turing machine; Turing machines; verification", subject = "F.3.3 Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Functional constructs \\ G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous", treatment = "T Theoretical or Mathematical", } @Article{Leszczylowski:1988:LPE, author = "Jacek Leszczylowski and Staffan Bonnier and Jan Maluszy{\'n}ski", title = "Logic programming with external procedures: introducing {$S$}-unification", journal = j-INFO-PROC-LETT, volume = "27", number = "3", pages = "159--165", day = "25", month = mar, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Iowa State Univ, Ames, IA, USA", classification = "723; C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Iowa State Univ., Ames, IA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; computer metatheory --- Programming Theory; computer programming; E-unification; e-unification; external functional procedures; external procedures; formal logic; functional programming; Horn clause logic; logic programming; programming theory; S-unification; s-unification; term reduction system; theory; Theory", pubcountry = "Netherlands A09", subject = "F.4.1 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Logic programming \\ I.2.3 Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Logic programming \\ D.1.1 Software, PROGRAMMING TECHNIQUES, Applicative (Functional) Programming", treatment = "T Theoretical or Mathematical", } @Article{Tsin:1988:HVD, author = "Yung Hyang Tsin", title = "On Handling Vertex Deletion in Updating Minimum Spanning Trees", journal = j-INFO-PROC-LETT, volume = "27", number = "4", pages = "167--168", day = "8", month = apr, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Windsor, Windsor, Ont, Can", classification = "722; 723; C1160 (Combinatorial mathematics); C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Sch. of Comp. Sci., Windsor Univ., Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; computer systems, digital; CREW-PRAM model; edge deletion; edge insertion; efficient parallel algorithms; graph theory; mathematical techniques --- Algorithms; minimum spanning tree; MST algorithm; MST updating problem; old MST; parallel algorithms; parallel computation; parallel graph algorithm; Parallel Processing; theory; trees (mathematics); vertex deletion problem; vertex insertion; weighted graph", pubcountry = "Netherlands A01", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees \\ G.1.0 Mathematics of Computing, NUMERICAL ANALYSIS, General, Parallel algorithms \\ F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Ramarao:1988:MCS, author = "K. V. S. Ramarao and Robert Daley and Rami Melhem", title = "Message complexity of the set intersection problem", journal = j-INFO-PROC-LETT, volume = "27", number = "4", pages = "169--174", day = "8", month = apr, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Pittsburgh, Pittsburgh, PA, USA", classification = "718; 722; 723; B6100 (Information and communication theory); C1160 (Combinatorial mathematics); C1260 (Information theory); C5620 (Computer networks and techniques)", corpsource = "Dept. of Comput. Sci., Pittsburgh Univ., PA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; asynchronous system; cardinality; computer networks --- Protocols; computer systems, digital; computer systems, digital --- Data Communication Systems; Distributed; distributed algorithm; distributed processing; distributed system; explicit messages; information theory; lower bound; message complexity; messages; protocols; set intersection problem; set theory; smallest sized subset; subset; theory; universal set", pubcountry = "Netherlands A02", subject = "G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sequencing and scheduling", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Rohnert:1988:TSE, author = "Hans Rohnert", title = "Time and space efficient algorithms for shortest paths between convex polygons", journal = j-INFO-PROC-LETT, volume = "27", number = "4", pages = "175--179", day = "8", month = apr, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Saarlandes, Saarbr{\"u}cken, West Ger", classification = "921; C1160 (Combinatorial mathematics); C4190 (Other numerical methods); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Appl. Math. and Comput. Sci., Saarlandes Univ., Saarbrucken, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; arbitrary query points; complexity of algorithms; computational geometry; convex polygonal obstacles; convex polygons; disjoint convex polygons; graph theory; mathematical techniques; optimization --- Applications; pairwise intersection; plane; shortest paths; shortest paths algorithms; space efficient algorithms; theory; time efficient algorithms; verification", pubcountry = "Netherlands A03", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Path and circuit problems \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Koo:1988:EML, author = "Richard Koo and Sam Toueg", title = "Effects of message loss on the termination of distributed protocols", journal = j-INFO-PROC-LETT, volume = "27", number = "4", pages = "181--188", day = "8", month = apr, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Olivetti Research Cent, Menlo Park, CA, USA", classification = "718; 721; 722; 723; 731; B6150 (Communication system theory); B6210L (Computer communications); C1260 (Information theory); C5620 (Computer networks and techniques); C6150J (Operating systems)", corpsource = "Olivetti Res. Center, Menlo Park, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "communication failure; computer networks; computer networks --- Protocols; computer systems, digital; computers, digital --- Data Communication Systems; Distributed; distributed protocol termination; distributed protocols; distributed systems; fault tolerance; fault tolerant computing; faulty communication channels; information theory; information theory --- Communication Channels; knowledge gain; message loss; message transfers; protocols; standardization; system recovery; theory; transient communication failures; verification; weak termination", pubcountry = "Netherlands A04", subject = "C.2.2 Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Protocols \\ K.1 Computing Milieux, THE COMPUTER INDUSTRY, Standards", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Faigle:1988:CSD, author = "Ulrich Faigle and Rainer Schrader", title = "On the convergence of stationary distributions in simulated annealing algorithms", journal = j-INFO-PROC-LETT, volume = "27", number = "4", pages = "189--194", day = "8", month = apr, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "90C27 (60J99 65K05 90B15)", MRnumber = "89b:90173", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Rheinische Friedrich-Wilhelms Univ, Bonn, West Ger", classification = "921; 922; C1140Z (Other and miscellaneous); C1180 (Optimisation techniques); C4130 (Interpolation and function approximation)C4240 (Programming and algorithm theory)", corpsource = "Dept. of Oper. Res., Rheinische Friedrich-Wilhelms Univ., Bonn, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; combinatorial optimization; control parameter; convergence; deteriorations; distribution; equilibrium distributions; general assumptions; global optimum; iteration; iterative methods; Markov chain; Markov processes; mathematical statistics --- Monte Carlo Methods; mathematical techniques --- Convergence of Numerical Methods; objective function; observed good performance; optimisation; optimization; parameter levels; probability; randomized optimization algorithm; simulated annealing; simulated annealing algorithms; simulated annealing implementations; stationary distributions; statistical analysis; theory; verification", pubcountry = "Netherlands A05", subject = "G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous \\ F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Probabilistic computation", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Esfahanian:1988:CCE, author = "Abdol Hossein Esfahanian and S. Louis Hakimi", title = "On computing a conditional edge-connectivity of a graph", journal = j-INFO-PROC-LETT, volume = "27", number = "4", pages = "195--199", day = "8", month = apr, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "05C40 (68R10)", MRnumber = "89c:05051", MRreviewer = "Ortrud R. Oellermann", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Michigan State Univ, East Lansing, MI, USA", classification = "721; 722; 723; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comp. Sci., Michigan State Univ., East Lansing, MI, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; complexity of algorithms; Computational Methods; computers, digital; conditional edge-connectivity; connectivity; edge-connectivity of A graph; graph property; graph theory; graphs; lower bounds; mathematical techniques --- Graph Theory; minimum cardinality; polynomial-time algorithm; theory; upper bounds; verification; vertex", pubcountry = "Netherlands A06", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Szepietowski:1988:RLA, author = "Andrzej Szepietowski", title = "Remarks on languages acceptable in $\log \log n$ space", journal = j-INFO-PROC-LETT, volume = "27", number = "4", pages = "201--203", day = "8", month = apr, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (03D15 68Q05 68Q15)", MRnumber = "89d:68033", MRreviewer = "Itsuo Takanami", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Technical Univ Aachen, Aachen, West Ger", classification = "721; C4210 (Formal logic); C4220 (Automata theory)", corpsource = "Dept. of Appl. Math., Techn. Univ. Aachen, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; complexity of algorithms; computation paths; computational complexity; computer metatheory --- Algorithmic Languages; deterministic automata; formal languages; language; languages; log log n space; space complexity; theory; Turing machine; Turing Machines; Turing machines; two-way deterministic TM; two-way nondeterministic TM; verification", pubcountry = "Netherlands A07", subject = "F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Bounded-action devices \\ F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Algebraic language theory", treatment = "P Practical; T Theoretical or Mathematical", } @Article{vanBaronaigien:1988:GAT, author = "D. Roelants {van Baronaigien} and Frank Ruskey", title = "Generating $t$-ary Trees in ${A}$-Order", journal = j-INFO-PROC-LETT, volume = "27", number = "4", pages = "205--213", day = "8", month = apr, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Victoria, Victoria, BC, Can", classification = "721; 722; 723; 921; C1160 (Combinatorial mathematics); C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Victoria Univ., BC, Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "A-order; algorithms; B-order; bijection; binary trees; combinatorial generation; computers, digital --- Computational Methods; constant average time; generation algorithm; mathematical techniques; natural orders; nodes; Pascal listings; ranking; ranking algorithm; subroutines; t-ary trees; theory; Trees; trees (mathematics); unranking algorithms; verification", pubcountry = "Netherlands A08", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Bugrara:1988:ELB, author = "Khaled M. Bugrara and Paul W. Purdom", title = "An exponential lower bound for the pure literal rule", journal = j-INFO-PROC-LETT, volume = "27", number = "4", pages = "215--219", day = "8", month = apr, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "03D15 (03B05 03B35 68T15)", MRnumber = "90b:03053", MRreviewer = "John Cowles", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Northeastern Univ, Boston, MA, USA", classification = "723; C1230 (Artificial intelligence); C4210 (Formal logic)", corpsource = "Coll. of Comput. Sci., Northeastern Univ., Boston, MA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; artificial intelligence; average time analysis; best upper bound; clauses; complexity of algorithms; computer metatheory; computer programming --- Algorithms; conjunctive normal form; current lower bound; Davis--Putnam Procedure; Davis--Putnam procedures; exponential average time; exponential lower bound; first lower bound analysis; Formal Logic; formal logic; just splitting; logic formula; pure literal rule; running time; simplified algorithm; theorem proving; theory; typical solution time; upper bound", pubcountry = "Netherlands A09", subject = "F.2.1 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Number-theoretic computations \\ F.2.1 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Computations on polynomials", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Savage:1988:RMO, author = "Carla Savage", title = "Recognizing majority on a one-way mesh", journal = j-INFO-PROC-LETT, volume = "27", number = "5", pages = "221--225", day = "28", month = apr, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q35 (68Q25 68Q80)", MRnumber = "89i:68068", MRreviewer = "Maurice Tchuente", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "North Carolina State Univ, Raleigh, NC, USA", classification = "721; C4220 (Automata theory)", corpsource = "Dept. of Comput. Sci., North Carolina State Univ., Raleigh, NC, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; cellular automation; cellular automaton; finite automata; finite state machines; Formal Languages; languages; one-way communication; one-way mesh; theory; two-dimensional arrays; two-dimensional arrays with 0/1 entries; two-dimensional majority language; two-dimensional majority languages", pubcountry = "Netherlands A01", subject = "F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Unbounded-action devices \\ F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Algebraic language theory", treatment = "T Theoretical or Mathematical", } @Article{Jung:1988:PAC, author = "Hermann Jung and Kurt Mehlhorn", title = "Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees", journal = j-INFO-PROC-LETT, volume = "27", number = "5", pages = "227--236", day = "28", month = apr, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (05C05 68Q10 68R10 90B10)", MRnumber = "89f:68025", MRreviewer = "Norbert Blum", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Humboldt Univ at Berlin, Berlin, East Ger", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Math., Humboldt Univ., Berlin, East Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; Cole-Vishkin technique; computational complexity; computer programming; computer systems, digital --- Parallel Processing; deterministic coin tossing; graph theory; graphs; graphs of bounded degree; mathematical techniques --- Trees; maximal independent sets; minimum spanning trees; parallel algorithm; parallel algorithms; set theory; theory; trees; trees (mathematics); updating minimum spanning trees; verification", pubcountry = "Netherlands A02", subject = "G.1.0 Mathematics of Computing, NUMERICAL ANALYSIS, General, Parallel algorithms \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees", treatment = "T Theoretical or Mathematical", } @Article{Krishnaprasad:1988:CC, author = "T. Krishnaprasad", title = "On the computability of circumscription", journal = j-INFO-PROC-LETT, volume = "27", number = "5", pages = "237--243", day = "28", month = apr, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68T20 (03B60 03D35)", MRnumber = "89h:68136", MRreviewer = "Giovanni Criscuolo", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "SUNY at Stony Brook, Stony Brook, NY, USA", classification = "721; 723; C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; artificial intelligence; automata theory --- Turing Machines; circumscription; common-sense reasoning; computability; decidability; first-order sentence; first-order sentences; minimal model; nonmonotonic reasoning; second-order sentences; theory; Turning machines; undecidability; verification", pubcountry = "Netherlands A03", subject = "F.4.1 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Computability theory \\ F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Bounded-action devices \\ F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Decision problems", treatment = "T Theoretical or Mathematical", } @Article{Weems:1988:SPA, author = "Bob P. Weems", title = "A study of page arrangements for extendible hashing", journal = j-INFO-PROC-LETT, volume = "27", number = "5", pages = "245--248", day = "28", month = apr, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", abstract = "Extendible hashing has been proposed as an efficient dynamic hashing method. The method is essentially an implementation of radix search trees, or tries, which applies a scatter function to record keys. When used with a disk drive, there exists an opportunity to reduce the amount of arm movement (seek distance) by applying simple techniques for optimizing one-dimensional storage. This article examines the potential reduction in head movement when an optimal arrangement of pages is used instead of a random arrangement. Applications presently being evaluated include periodic static reorganization of the file and techniques for dynamic reorganization.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Texas at Arlington, Arlington, TX, USA", classification = "723; C6120 (File organisation)", corpsource = "Dept. of Comput. Sci. Eng., Texas Univ., Arlington, TX, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "data processing; disk drive; disk page arrangement; dynamic hashing; extendible hashing; file organisation; File Organization; file processing; measurement; one-dimensional storage; optimisation; page arrangements; performance; radix search trees; record keys; scatter function; theory; trees (mathematics); tries; virtual storage", pubcountry = "Netherlands A04", subject = "E.2 Data, DATA STORAGE REPRESENTATIONS, Hash-table representations \\ I.2.8 Computing Methodologies, ARTIFICIAL INTELLIGENCE, Problem Solving, Control Methods, and Search, Graph and tree search strategies", treatment = "T Theoretical or Mathematical", } @Article{Kumar:1988:NCR, author = "Ashok Kumar and V. M. Malhotra", title = "A new computation rule for {Prolog}", journal = j-INFO-PROC-LETT, volume = "27", number = "5", pages = "249--252", day = "28", month = apr, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Indian Inst of Technology, Kanpur, India", classification = "723; C6140D (High level languages); C6150C (Compilers, interpreters and other processors)", corpsource = "Dept. of Comput. Sci. and Eng., Indian Inst. of Technol., Kanpur, India", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computation rule; computer operating systems --- Program Interpreters; computer programming; generate-and-test; interpreter; languages; program execution; program interpreters; programming paradigm; Prolog; PROLOG; scheduling; SLD resolution; SLD-resolution; theory", pubcountry = "Netherlands A05", subject = "D.3.2 Software, PROGRAMMING LANGUAGES, Language Classifications, Prolog \\ D.3.4 Software, PROGRAMMING LANGUAGES, Processors, Interpreters", treatment = "P Practical", } @Article{Itano:1988:IPM, author = "Kozo Itano and Yutaka Sato and Hidemi Hirai and Tomoyoshi Yamagata", title = "An incremental pattern matching algorithm for the pipelined lexical scanner", journal = j-INFO-PROC-LETT, volume = "27", number = "5", pages = "253--258", day = "28", month = apr, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Tsukuba, Sakura-mura, Jpn", classification = "723; C6120 (File organisation); C6150C (Compilers, interpreters and other processors)", corpsource = "Inst. of Inf. Sci. and Electron., Tsukuba Univ., Ibaraki, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; assemblers; C programs; compact binary form; compilers; computer programming; computer programming languages --- Pascal; computer systems, digital --- Parallel Processing; file organisation; hashing; incremental pattern matching algorithm; interpreters; language processors; languages; lexical scanning algorithm; measurement; Pascal programs; performance; pipeline processing; pipelined lexical scanner; program assemblers; program compilers; program interpreters; string compaction; theory; variable-length character strings", pubcountry = "Netherlands A06", subject = "D.3.4 Software, PROGRAMMING LANGUAGES, Processors \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Pattern matching", treatment = "P Practical", } @Article{Gabow:1988:LTA, author = "Harold N. Gabow and Robert E. Tarjan", title = "A linear-time algorithm for finding a minimum spanning pseudoforest", journal = j-INFO-PROC-LETT, volume = "27", number = "5", pages = "259--263", day = "28", month = apr, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (05C05 68R10)", MRnumber = "89e:68047", MRreviewer = "Norbert Blum", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Colorado, Boulder, CO, USA", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Colorado Univ., Boulder, CO, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; computational complexity; computer programming; graph; graph theory; linear-time algorithm; mathematical techniques --- Trees; minimum spanning pseudoforest; minimum spanning tree; theory; tree; trees (mathematics); verification", pubcountry = "Netherlands A07", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms", treatment = "T Theoretical or Mathematical", } @Article{Krivanek:1988:CUP, author = "Mirko K{\v{r}}iv{\'a}nek", title = "The complexity of ultrametric partitions on graphs", journal = j-INFO-PROC-LETT, volume = "27", number = "5", pages = "265--270", day = "28", month = apr, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (05C99 68R10)", MRnumber = "89h:68064", MRreviewer = "D. M. Campbell", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Charles Univ, Praha, Czech", classification = "714; 723; 921; C1160 (Combinatorial mathematics); C1180 (Optimisation techniques); C4240 (Programming and algorithm theory)", corpsource = "Charles Univ., Praha, Czechoslovakia", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "complexity; computational complexity; computer programming --- Algorithms; graph partitions; Graph Theory; graph theory; graphs; integrated circuits, VLSI --- Computer Aided Design; mathematical techniques; measurement; minimax techniques; NP completeness; NP-completeness; polynomial algorithm; theory; ultrametric partitions; verification; weighted complete graph", pubcountry = "Netherlands A08", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory \\ F.1.3 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Reducibility and completeness", treatment = "T Theoretical or Mathematical", } @Article{Ramalingam:1988:UAD, author = "G. Ramalingam and C. Pandu Rangan", title = "A unified approach to domination problems on interval graphs", journal = j-INFO-PROC-LETT, volume = "27", number = "5", pages = "271--274", day = "28", month = apr, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (05C99 68R10)", MRnumber = "89i:68061", MRreviewer = "Bernd Graw", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Indian Inst of Technology, Madras, India", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci. and Eng., Indian Inst. of Technol., Madras, India", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computational complexity; computer programming --- Algorithms; domination problems; Graph Theory; graph theory; interval graphs; linear-time algorithms; mathematical techniques; theory; verification", pubcountry = "Netherlands A09", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory", treatment = "T Theoretical or Mathematical", } @Article{Matousek:1988:LAR, author = "Ji{\v{r}}{\'\i} Matou{\v{s}}ek", title = "Line arrangements and range search", journal = j-INFO-PROC-LETT, volume = "27", number = "6", pages = "275--280", day = "13", month = may, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68U05 (51M20 52-04)", MRnumber = "90i:68087", MRreviewer = "Norbert Luscher", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Charles Univ, Prague, Czech", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Charles Univ., Praha, Czechoslovakia", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; computational geometry; computer programming; convex regions; edges; graph theory; line arrangements; mathematical techniques --- Geometry; range search; storage; theory; triangle; verification", pubcountry = "Netherlands A01", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching", treatment = "P Practical", } @Article{DeLuca:1988:FTM, author = "Aldo {de Luca} and Stefano Varricchio", title = "On the factors of the {Thue--Morse} word on three symbols", journal = j-INFO-PROC-LETT, volume = "27", number = "6", pages = "281--285", day = "13", month = may, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q45", MRnumber = "89h:68087", MRreviewer = "Christine Charretton", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Rome 'La Sapienza', Rome, Italy", classification = "723; C4210 (Formal logic)", corpsource = "Dept. of Math., Rome Univ., Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer metatheory; formal languages; languages; special factors; square-free word; structure-function; theory; three-letter alphabet; Thue--Morse word; verification", pubcountry = "Netherlands A02", subject = "F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Algebraic language theory \\ G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous", treatment = "T Theoretical or Mathematical", } @Article{Bodlaender:1988:BLB, author = "Hans L. Bodlaender", title = "A better lower bound for distributed leader finding in bidirectional, asynchronous rings of processors", journal = j-INFO-PROC-LETT, volume = "27", number = "6", pages = "287--290", day = "13", month = may, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68M10", MRnumber = "90e:68008", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Utrecht, Utrecht, Neth", classification = "722; 723; C4240 (Programming and algorithm theory); C4290 (Other computer theory); C5620 (Computer networks and techniques)", corpsource = "Dept. of Comput. Sci., Utrecht Univ., Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; bidirectional asynchronous rings; bidirectional asynchronous rings of processors; communication subsystem; computation theory; computer systems, digital; Distributed; distributed leader finding; distributed processing; election; identification number; lower bounds; multiprocessing systems; processor rings; theory; verification", pubcountry = "Netherlands A03", subject = "F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Unbounded-action devices", treatment = "T Theoretical or Mathematical", } @Article{Hsu:1988:STC, author = "Meichun Hsu and Stuart E. Madnick", title = "Shifting timestamps for concurrency control in an information hierarchy", journal = j-INFO-PROC-LETT, volume = "27", number = "6", pages = "291--297", day = "13", month = may, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68P15 (68Q10)", MRnumber = "89k:68032", MRreviewer = "Manfred Broy", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Harvard Univ, Cambridge, MA, USA", classification = "723; C6160B (Distributed DBMS)", corpsource = "Aiken Comput. Lab., Harvard Univ., Cambridge, MA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; computer programming --- Algorithms; concurrency control; database concurrency; database systems; design; Distributed; distributed databases; information hierarchy; management; parallel programming; partial order; shifting timestamps; theory; timestamp algorithm; timestamps; transaction classes; transaction dependencies; transaction serializability; verification", pubcountry = "Netherlands A04", subject = "D.4.1 Software, OPERATING SYSTEMS, Process Management, Concurrency \\ H.2.4 Information Systems, DATABASE MANAGEMENT, Systems, Concurrency", treatment = "P Practical", } @Article{Kutten:1988:OFT, author = "Shay Kutten", title = "Optimal fault-tolerant distributed construction of a spanning forest", journal = j-INFO-PROC-LETT, volume = "27", number = "6", pages = "299--307", day = "13", month = may, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68M10 (68M15 68R10)", MRnumber = "90f:68015", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Technion, Haifa, Isr", classification = "722; 723; 921; B6150 (Communication system theory); B6210L (Computer communications); C4290 (Other computer theory); C5470 (Performance evaluation and testing); C5620 (Computer networks and techniques)", corpsource = "Dept. of Comput. Sci., Technion Inst. of Technol., Haifa, Israel", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; asynchronous general network; asynchronous network; computer communication networks; computer networks; computer programming --- Algorithms; computer systems, digital; construction algorithm; Fault Tolerant Capability; fault tolerant computing; fault-free networks; fault-resilient spanning forest; fault-tolerant distributed construction; mathematical techniques --- Trees; message complexity; recovery; routing; spanning forest; spanning tree; theory; trees (mathematics); verification", pubcountry = "Netherlands A05", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees \\ F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Unbounded-action devices", treatment = "P Practical", } @Article{Orlowska:1988:PSW, author = "Ewa Or{\l}owska", title = "Proof System for Weakest Prespecification", journal = j-INFO-PROC-LETT, volume = "27", number = "6", pages = "309--313", day = "13", month = may, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q60 (03B70)", MRnumber = "89k:68101", MRreviewer = "Michal Grabowski", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Polish Acad of Sciences, Warsaw, Pol", classification = "723; C4210 (Formal logic)", corpsource = "Polish Acad. of Sci., Warsaw, Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "calculus of relations; computer metatheory; computer programming languages; deduction method; equality; formal languages; inclusion; proof system; proof systems; relational calculus; specification languages; theorem proving; Theory; theory; verification; weakest postspecification; weakest prespecification", pubcountry = "Netherlands A06", subject = "F.1.3 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes \\ F.3.1 Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs, Pre- and post-conditions", treatment = "T Theoretical or Mathematical", } @Article{Sridhar:1988:CBG, author = "M. A. Sridhar", title = "On the connectivity of the {De Bruijn} graph", journal = j-INFO-PROC-LETT, volume = "27", number = "6", pages = "315--318", day = "13", month = may, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68R05 (05C40)", MRnumber = "89h:68117", MRreviewer = "Bernd Graw", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of South Carolina, Columbia, SC, USA", classification = "723; 921; C1160 (Combinatorial mathematics); C4210 (Formal logic)", corpsource = "Dept. of Comput. Sci., South Carolina Univ., SC, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "connectivity; data processing; Data Structures; de Bruijn graph; De Bruijn graph; formal languages; graph theory; labeled directed graphs; mathematical techniques --- Graph Theory; periods; self-loops; string matching; strings; theory; verification", pubcountry = "Netherlands A07", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Pattern matching", treatment = "T Theoretical or Mathematical", } @Article{Huang:1988:LBE, author = "Xiaoqiu Huang", title = "A lower bound for the edit-distance problem under an arbitrary cost function", journal = j-INFO-PROC-LETT, volume = "27", number = "6", pages = "319--321", day = "13", month = may, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q30 (68R05 68U15)", MRnumber = "89d:68034", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Pennsylvania State Univ, University Park, PA, USA", classification = "723; C4210 (Formal logic)", corpsource = "Dept. of Comput. Sci., Pennsylvania State Univ., University Park, PA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; computation; computer programming --- Algorithms; cost function; data processing; Data Structures; deletions; edit distance; edit distance of two strings; formal languages; Hunt-Szymanski algorithm; insertions; longest common subsequences; lower bounds; minimum cost; RAM model; replacements; theory; verification", pubcountry = "Netherlands A08", subject = "D.3.3 Software, PROGRAMMING LANGUAGES, Language Constructs, Data types and structures \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sequencing and scheduling", treatment = "P Practical", } @Article{Fernandez-Baca:1988:NDP, author = "David Fern{\'a}ndez-Baca", title = "Nonserial dynamic programming formulations of satisfiability", journal = j-INFO-PROC-LETT, volume = "27", number = "6", pages = "323--326", day = "13", month = may, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q20 (03B05 03D15 68R10 90C39)", MRnumber = "89m:68048", MRreviewer = "Juraj Hromkovi{\v{c}}", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Iowa State Univ, Ames, IA, USA", classification = "723; 921; C1180 (Optimisation techniques); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Iowa State Univ., Ames, IA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; bandwidth constrained problem; bandwidth-k formulas; bandwidth-k interaction graphs; computational complexity; computer programming --- Algorithms; dynamic programming; interaction graphs; mathematical programming, dynamic; nonserial dynamic programming; nonserial dynamic programming formulations; planar formulas; planar interaction graphs; satisfiability; theory; verification", pubcountry = "Netherlands A09", subject = "I.2.8 Computing Methodologies, ARTIFICIAL INTELLIGENCE, Problem Solving, Control Methods, and Search, Dynamic programming \\ G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous \\ I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms", treatment = "T Theoretical or Mathematical", } @Article{Sakkinen:1988:CDS, author = "M. Sakkinen", title = "Comments on {``Manipulation of data structures without pointers''} {[Inform. Process. Lett. {\bf 26}(3), 23 November 1997, pp. 135--143]}", journal = j-INFO-PROC-LETT, volume = "27", number = "6", pages = "327--328", day = "13", month = may, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See \cite{Sajeev:1987:MDS}.", acknowledgement = ack-nhfb, classification = "C6120 (File organisation)", corpsource = "Dept. of Comput. Sci., Jyvaskyla Univ., Finland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "abstract data types; complex objects; data structures; deep copy; implicit pointers; pointer approach; program modules; shallow copy; value parameters", pubcountry = "Netherlands A10", treatment = "P Practical", } @Article{Latteux:1988:BST, author = "M. Latteux and E. Timmerman", title = "Bifaithful starry transductions", journal = j-INFO-PROC-LETT, volume = "28", number = "1", pages = "1--4", day = "30", month = may, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q45", MRnumber = "89h:68084", MRreviewer = "Christine Charretton", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "CNRS, Villeneuve, Fr", classification = "721; C4210 (Formal logic)", corpsource = "Dept. of Comput. Sci., Univ. of Lille Flandres Artois, Villeneuve d'Ascq, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; bifaithful starry transduction; bifaithful starry transductions; composition of morphisms; computer metatheory; context-free languages; Formal Languages; inverse nonerasing morphisms; languages; nonerasing morphisms; rational transduction; theory; verification", pubcountry = "Netherlands A01", subject = "F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Algebraic language theory", treatment = "T Theoretical or Mathematical", } @Article{Italiano:1988:FPD, author = "Giuseppe F. Italiano", title = "Finding paths and deleting edges in directed acyclic graphs", journal = j-INFO-PROC-LETT, volume = "28", number = "1", pages = "5--11", day = "30", month = may, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68P05 (05C20 05C38 68Q25)", MRnumber = "89j:68021", MRreviewer = "William Gasarch", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Columbia Univ, New York, NY, USA", classification = "723; 921; C1160 (Combinatorial mathematics)", corpsource = "Dept. of Comput. Sci., Columbia Univ., New York, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm analysis; algorithms; Algorithms; analysis of algorithms; arbitrarily chosen path; computational complexity; computer programming; DAGs; data processing --- Data Structures; data structures; directed acyclic graphs; directed graphs; edge deletion; edges; graph algorithms; mathematical techniques --- Graph Theory; nodes; path finding; theory; verification", pubcountry = "Netherlands A02", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory", treatment = "T Theoretical or Mathematical", } @Article{Szpankowski:1988:EAS, author = "Wojciech Szpankowski", title = "The evaluation of an alternative sum with applications to the analysis of some data structures", journal = j-INFO-PROC-LETT, volume = "28", number = "1", pages = "13--19", day = "30", month = may, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68P05 (68Q25)", MRnumber = "90d:68015", MRreviewer = "Ricardo Baeza-Yates", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Purdue Univ, West Lafayette, IN, USA", classification = "723; 921; C4130 (Interpolation and function approximation); C6120 (File organisation)", corpsource = "Dept. of Comput. Sci., Purdue Univ., West Lafayette, IN, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm; algorithms; alternative sum; approximation theory; asymptotic analysis; classes of objects; computer programming --- Algorithms; conflict resolution algorithm; data processing; Data Structures; data structures; digital search tree; forest; function approximation; graph theory; integer; label; leaf; mathematical techniques --- Trees; recurrence equation; theory; tree; verification", pubcountry = "Netherlands A03", subject = "I.2.8 Computing Methodologies, ARTIFICIAL INTELLIGENCE, Problem Solving, Control Methods, and Search, Graph and tree search strategies \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees \\ E.1 Data, DATA STRUCTURES, Trees", treatment = "T Theoretical or Mathematical", } @Article{Lamb:1988:TCM, author = "David A. Lamb and Robin Dawes", title = "Testing for class membership in multi-parent hierarchies", journal = j-INFO-PROC-LETT, volume = "28", number = "1", pages = "21--25", day = "30", month = may, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Queen's Univ, Kingston, Ont, Can", classification = "723; 921; C6110 (Systems analysis and programming)", corpsource = "Dept. of Comput. and Inf. Sci., Queen's Univ., Kingston, Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm; algorithms; Algorithms; class membership; classes of objects; computer programming; directed acyclic graph; forest; graph theory; infinitely often bound; integer; label; labeling; leaf; mathematical techniques --- Graph Theory; multi-parent hierarchies; programming; testing for class membership; theory; tree", pubcountry = "Netherlands A04", subject = "D.1.4 Software, PROGRAMMING TECHNIQUES, Sequential Programming \\ E.2 Data, DATA STORAGE REPRESENTATIONS", treatment = "P Practical", } @Article{Rolim:1988:ICA, author = "Jos{\'e} D. P. Rolim and Sheila A. Greibach", title = "On the {IO-complexity} and approximation languages", journal = j-INFO-PROC-LETT, volume = "28", number = "1", pages = "27--31", day = "30", month = may, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q15 (03D05 03D15)", MRnumber = "89f:68022", MRreviewer = "Klaus W. Wagner", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Odense Univ, Odense, Den", classification = "721; 723; C4130 (Interpolation and function approximation); C4240 (Programming and algorithm theory)", corpsource = "Inst. for Matematik og Datalogi, Odense Univ., Denmark", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; approximation languages; approximation theory; automata theory --- Formal Languages; complexity theory; computational complexity; computer metatheory; deterministic Turing machines; io-complexity; IO-complexity; languages; theory; verification", pubcountry = "Netherlands A05", subject = "F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Algebraic language theory \\ F.2.m Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Miscellaneous", treatment = "T Theoretical or Mathematical", } @Article{Jedrzejowicz:1988:IHE, author = "Joanna J{\polhk{e}}drzejowicz", title = "Infinite Hierarchy of Expressions Containing Shuffle Closure Operator", journal = j-INFO-PROC-LETT, volume = "28", number = "1", pages = "33--37", day = "30", month = may, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q45", MRnumber = "89j:68080", MRreviewer = "Dani{\`e}le Beauquier", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Gdansk, Gdansk, Pol", classification = "721; C4210 (Formal logic)", corpsource = "Inst. of Math., Gdansk Univ., Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; computer metatheory; Formal Languages; formal languages; infinite hierarchy of expressions; languages; shuffle closure operator; shuffle expressions; shuffle languages; shuffle operator; theory; verification", pubcountry = "Netherlands A06", subject = "I.1.m Computing Methodologies, ALGEBRAIC MANIPULATION, Miscellaneous \\ F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Algebraic language theory", treatment = "T Theoretical or Mathematical", } @Article{Chin:1988:OWR, author = "Wei-Pang Chin and Simeon Ntafos", title = "Optimum watchman routes", journal = j-INFO-PROC-LETT, volume = "28", number = "1", pages = "39--44", day = "30", month = may, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68U05 (68Q25 90B10)", MRnumber = "89f:68063", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Texas, Dallas, TX, USA", classification = "723; 921; C4190 (Other numerical methods); C4240 (Programming and algorithm theory)", corpsource = "Comput. Sci. Program, Texas Univ., Richardson, TX, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; computational complexity; computational geometry; computer programming --- Algorithms; holes; mathematical techniques --- Geometry; NP-hard; NP-hard problems; optimization; optimum watchman routes; rectilinear polygons; shortest routes; theory; verification; watchman routes", pubcountry = "Netherlands A07", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations \\ G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous", treatment = "T Theoretical or Mathematical", } @Article{Dwelly:1988:SIB, author = "Andrew Dwelly", title = "Synchronizing the {I/O} behavior of functional programs with feedback", journal = j-INFO-PROC-LETT, volume = "28", number = "1", pages = "45--51", day = "30", month = may, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "European Computer-Industry Research Cent GmbH, Munich, West Ger", classification = "723; C6110 (Systems analysis and programming)", corpsource = "Eur. Comput. Ind. Res. Centre GmbH, Munchen, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer metatheory --- Programming Theory; computer programming; design; feedback; functional languages; functional programming; functional programs; functional programs with feedback; I/O behavior; interactive programs; interactive system; lazy evaluation; nonintuitive evaluation order; performance; programming; theory; Theory", pubcountry = "Netherlands A08", subject = "D.1.1 Software, PROGRAMMING TECHNIQUES, Applicative (Functional) Programming \\ D.4.7 Software, OPERATING SYSTEMS, Organization and Design, Interactive systems \\ D.4.1 Software, OPERATING SYSTEMS, Process Management, Synchronization", treatment = "P Practical", } @Article{Olariu:1988:PFG, author = "Stephan Olariu", title = "Paw-Free Graphs", journal = j-INFO-PROC-LETT, volume = "28", number = "1", pages = "53--54", day = "30", month = may, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "05C35 (68Q25 68R10)", MRnumber = "89h:05033", MRreviewer = "Narsingh Deo", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Old Dominion Univ, Norfolk, VA, USA", classification = "723; 921; C1160 (Combinatorial mathematics)", corpsource = "Dept. of Comput. Sci., Old Dominion Univ., Norfolk, VA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; computer programming --- Algorithms; decomposition theorem; efficient algorithms; graph decomposition; graph theory; Graph Theory; mathematical techniques; paw-free graphs; perfect graph; perfect graphs; theory; verification", pubcountry = "Netherlands A09", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory \\ I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms", treatment = "T Theoretical or Mathematical", } @Article{Kirchherr:1988:TMR, author = "Walter W. Kirchherr", title = "Transportation of an $l \times l$ Matrix Requires {$\Omega(\log l)$} Reversals on Conservative {Turing} Machines", journal = j-INFO-PROC-LETT, volume = "28", number = "2", pages = "55--59", day = "24", month = jun, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (05B99 68Q05)", MRnumber = "89h:68063", MRreviewer = "Eric Bach", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Illinois at Chicago, Chicago, IL, USA", classification = "721; 921; C4220 (Automata theory)", corpsource = "Dept. of Math., Stat. and Comput Sci., Illinois Univ., Chicago, IL, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; automata theory; computational complexity; conservative Turing machines; indivisible entities; k-tape Turing machine; mathematical techniques --- Matrix Algebra; matrix algebra; matrix transportation; matrix transposition; pebbles; theory; Turing Machines; Turing machines; verification", pubcountry = "Netherlands A01", subject = "F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Bounded-action devices \\ F.2.1 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Computations on matrices \\ H.3.3 Information Systems, INFORMATION STORAGE AND RETRIEVAL, Information Search and Retrieval, Retrieval models", treatment = "T Theoretical or Mathematical", } @Article{Gazit:1988:IPA, author = "Hillel Gazit and Gary L. Miller", title = "An improved parallel algorithm that computes the {BFS} numbering of a directed graph", journal = j-INFO-PROC-LETT, volume = "28", number = "2", pages = "61--65", day = "24", month = jun, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q10 (68Q25 68R10)", MRnumber = "89j:68045", MRreviewer = "Norbert Blum", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Southern California, Los Angeles, CA, USA", classification = "723; 921; C1160 (Combinatorial mathematics); C4140 (Linear algebra); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci. Univ. of Southern California, University Park, Los Angeles, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; BFS numbering; breadth-first search; computational complexity; computer programming; computer systems, digital --- Parallel Processing; concurrent-read concurrent-write; directed graph; directed graphs; exclusive-read exclusive-write; mathematical techniques --- Graph Theory; matrix algebra; matrix multiplication; parallel algorithm; parallel algorithms; parallel random access machine; PRAM; theory; verification", pubcountry = "Netherlands A02", subject = "G.1.0 Mathematics of Computing, NUMERICAL ANALYSIS, General, Parallel algorithms \\ F.2.1 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Computations on matrices \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching", treatment = "T Theoretical or Mathematical", } @Article{Dehne:1988:TAE, author = "Frank Dehne and Ivan Stojmenovi{\'{c}}", title = "An ${O}(\sqrt{n})$ time algorithm for the {ECDF} searching problem for arbitrary dimensions on a mesh-of-processors", journal = j-INFO-PROC-LETT, volume = "28", number = "2", pages = "67--70", day = "24", month = jun, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68P10 (68Q10 68U05)", MRnumber = "89e:68010", MRreviewer = "Eric Cornelis", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Carleton Univ, Ottawa, Ont, Can", classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Sch. of Comput. Sci., Carleton Univ., Ottawa, Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; arbitrary dimensions; computational complexity; computational geometry; computer programming; computer systems, digital --- Parallel Processing; containment counting problem; ECDF searching problem; EDCF searching problem; hypercube; hypercube containment counting problem; hypercube intersection counting problem; intersection counting problem; maximal element determination problem; mesh-of-processors; optimal solution; parallel algorithm; parallel algorithms; theory", pubcountry = "Netherlands A03", subject = "F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations \\ G.1.0 Mathematics of Computing, NUMERICAL ANALYSIS, General, Parallel algorithms \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching", treatment = "T Theoretical or Mathematical", } @Article{Pan:1988:CDC, author = "Victor Pan", title = "Computing the determinant and the characteristic polynomial of a matrix via solving linear systems of equations", journal = j-INFO-PROC-LETT, volume = "28", number = "2", pages = "71--75", day = "24", month = jun, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "15A15 (65F05 68Q40)", MRnumber = "89j:15013", MRreviewer = "D. Bini", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "City Univ of New York, Bronx, NY, USA", classification = "723; 921; B0290F (Interpolation and function approximation); B0290H (Linear algebra); C4130 (Interpolation and function approximation); C4140 (Linear algebra)", corpsource = "Dept. of Math., Lehman Coll., City Univ. of New York, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; characteristic polynomial; computer programming --- Algorithms; Cramer rule; Cramer's rule; determinant; Hensel periodic lifting; interpolation; linear systems of equations; mathematical techniques; matrix; Matrix Algebra; matrix algebra; p-adic lifting; polynomials; rational interpolation; theory", pubcountry = "Netherlands A04", subject = "F.2.1 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Computations on polynomials \\ F.2.1 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Computations on matrices", treatment = "P Practical", } @Article{Engelfriet:1988:PEL, author = "Joost Engelfriet and Hendrik Jan Hoogeboom", title = "Prefix and equality languages of rational functions are co-context-free", journal = j-INFO-PROC-LETT, volume = "28", number = "2", pages = "77--79", day = "24", month = jun, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q45", MRnumber = "89h:68082", MRreviewer = "Maxime Crochemore", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Leiden Univ, Leiden, Neth", classification = "721; C4210 (Formal logic)", corpsource = "Dept. of Comput. Sci., Leiden Univ., Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; co-context free; co-context free languages; Context Free Languages; context-free languages; equality languages; finite state transducers; finite-state transducer; fixed point languages; formal languages; language-defining device; languages; one-counter languages; prefix; prefix languages; rational functions; strings; theory; verification", pubcountry = "Netherlands A05", subject = "F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Classes defined by grammars or automata \\ F.3.3 Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Functional constructs", treatment = "T Theoretical or Mathematical", } @Article{Bovet:1988:PFV, author = "Daniel P. Bovet and S. {De Agostino} and R. Petreschi", title = "Parallelism and the feedback vertex set problem", journal = j-INFO-PROC-LETT, volume = "28", number = "2", pages = "81--85", day = "24", month = jun, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68R10 (05C20 68Q25)", MRnumber = "89k:68116", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Rome La Sapienza, Rome, Italy", classification = "723; 921; C4240 (Programming and algorithm theory)", corpsource = "Dept. of Math., Rome Univ., Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; complexity; computational complexity; computer programming --- Algorithms; digraph; digraphs; directed graphs; feedback vertex set problem; Graph Theory; logspace-complete; logspace-complete problem; mathematical techniques; parallel algorithm; parallel algorithms; theory; verification", pubcountry = "Netherlands A06", subject = "G.1.0 Mathematics of Computing, NUMERICAL ANALYSIS, General, Parallel algorithms \\ G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous", treatment = "T Theoretical or Mathematical", } @Article{Auffray:1988:LSP, author = "Yves Auffray", title = "Linear strategy for propositional modal resolution", journal = j-INFO-PROC-LETT, volume = "28", number = "2", pages = "87--92", day = "24", month = jun, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68T15 (03B35 03B45)", MRnumber = "90f:68154", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ de Caen, Caen, Fr", classification = "723; C1230 (Artificial intelligence); C4210 (Formal logic)", corpsource = "Lab. d'Inf. Caen Univ., France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "completeness; computer metatheory; deduction system; formal languages; Formal Logic; formal logic; linear strategy; modal logics; modal system; propositional modal logics; propositional modal resolution; theorem proving; theory; verification", pubcountry = "Netherlands A07", subject = "F.4.1 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Computational logic", treatment = "T Theoretical or Mathematical", } @Article{Ebert:1988:CET, author = "J{\"u}rgen Ebert", title = "Computing {Eulerian} trails", journal = j-INFO-PROC-LETT, volume = "28", number = "2", pages = "93--97", day = "24", month = jun, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68R10 (05C38 05C45 68Q25)", MRnumber = "89i:68100", MRreviewer = "R{\u{a}}zvan Andonie", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "EWH Koblenz, Koblenz, West Ger", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., EWH Koblenz, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm theory; algorithms; Algorithms; array; computer programming; cycle tracing; decidability; digraphs; directed graphs; edge oriented algorithm; edge-oriented algorithm; Eulerian trails; Eulerian trials; linear implementations; linear time; mathematical techniques --- Graph Theory; offline traversal; online traversal; temporary storage; theory; vertices", pubcountry = "Netherlands A08", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms", treatment = "T Theoretical or Mathematical", } @Article{Anderson:1988:ASN, author = "James H. Anderson and Mohamed G. Gouda", title = "Atomic semantics of nonatomic programs", journal = j-INFO-PROC-LETT, volume = "28", number = "2", pages = "99--103", day = "24", month = jun, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Texas at Austin, Austin, TX, USA", classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Texas Univ., Austin, TX, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "atomic model; atomic semantics; computer metatheory; computer programming --- Theory; concurrency; concurrent programs; interleaving semantics; languages; nonatomic programs; parallel programming; Programming Theory; programming theory; reasoning; shared registers; theory; verification", pubcountry = "Netherlands A09", subject = "D.3.3 Software, PROGRAMMING LANGUAGES, Language Constructs, Concurrent programming structures \\ F.3.2 Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Algebraic approaches to semantics", treatment = "T Theoretical or Mathematical", } @Article{Schevon:1988:PAR, author = "Catherine A. Schevon and Jeffrey Scott Vitter", title = "A parallel algorithm for recognizing unordered depth-first search", journal = j-INFO-PROC-LETT, volume = "28", number = "2", pages = "105--110", day = "24", month = jun, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q10 (68Q25 68R10)", MRnumber = "89j:68052", MRreviewer = "Norbert Blum", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Brown Univ, Providence, RI, USA", classification = "723; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Brown Univ., Providence, RI, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm theory; algorithms; Algorithms; computer programming; computer systems, digital --- Parallel Processing; concurrent reading; concurrent-read exclusive-write; depth-first search; directed graphs; directed spanning forest; exclusive-write PRAM model; parallel algorithm; parallel algorithms; parallel random access machine; theory; transitive closure; trees (mathematics); unordered depth-first search", pubcountry = "Netherlands A10", subject = "G.1.0 Mathematics of Computing, NUMERICAL ANALYSIS, General, Parallel algorithms \\ B.7.1 Hardware, INTEGRATED CIRCUITS, Types and Design Styles, Memory technologies \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms", treatment = "T Theoretical or Mathematical", } @Article{Brandwajn:1988:LID, author = "Alexandre Brandwajn", title = "Load imbalance in {DASD} dynamic reconnection", journal = j-INFO-PROC-LETT, volume = "28", number = "3", pages = "111--119", day = "4", month = jul, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of California, Santa Cruz, CA, USA", classification = "722; C1140C (Queueing theory); C5320C (Storage on moving magnetic media); C5470 (Performance evaluation and testing)", corpsource = "California Univ., Santa Cruz, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer systems, digital --- Performance; DASD dynamic reconnection; data storage units; design; disk subsystem; iteration; iterative methods; load imbalance; magnetic disc storage; measurement; multiclass loss system; performance; performance evaluation; performance modeling; polynomial equations; polynomials; probability; queueing model; queueing theory; rotating disk subsystems; rotational position sensing; theory", pubcountry = "Netherlands A01", subject = "J.2 Computer Applications, PHYSICAL SCIENCES AND ENGINEERING, Engineering \\ C.4 Computer Systems Organization, PERFORMANCE OF SYSTEMS \\ G.m Mathematics of Computing, MISCELLANEOUS, Queueing theory", treatment = "T Theoretical or Mathematical", } @Article{Mishra:1988:SAU, author = "Prateek Mishra", title = "Strictness Analysis of the Untyped $\lambda$-Calculus", journal = j-INFO-PROC-LETT, volume = "28", number = "3", pages = "121--125", day = "4", month = jul, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q55 (03B40)", MRnumber = "89h:68103", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "State Univ of New York at Stony Brook, Stony Brook, NY, USA", classification = "723; C4210 (Formal logic)", corpsource = "Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; computer metatheory; computer programming --- Algorithms; computer programming languages; convergent terms; formal logic; function arguments; head evaluation; lazy evaluation; strictness; Theory; theory; type structure; untyped lambda-calculus; verification", pubcountry = "Netherlands A02", subject = "F.4.1 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Lambda calculus and related systems", treatment = "T Theoretical or Mathematical", } @Article{Aguilar-Martin:1988:CSR, author = "J. Aguilar-Martin and Claudi Alsina", title = "Characterizations of some rescaling functions", journal = j-INFO-PROC-LETT, volume = "28", number = "3", pages = "127--132", day = "4", month = jul, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "39B20", MRnumber = "89m:39013", MRreviewer = "B. Crstici", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Cent Natl de Recherches Scientifiques, Toulouse, Fr", classification = "723; C1120 (Analysis); C4240 (Programming and algorithm theory)", corpsource = "Lab. d'Autom. et d'Anal. des Syst., CNRS, Toulouse, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "data processing; data-dependent mapping; functional equations; mappings; normalizing; programming theory; rescaling functions; theory; verification", pubcountry = "Netherlands A03", subject = "H.1.1 Information Systems, MODELS AND PRINCIPLES, Systems and Information Theory, Information theory \\ G.m Mathematics of Computing, MISCELLANEOUS", treatment = "T Theoretical or Mathematical", } @Article{Weiss:1988:BCS, author = "Mark Allen Weiss and Robert Sedgewick", title = "Bad cases for {Shaker}-sort", journal = j-INFO-PROC-LETT, volume = "28", number = "3", pages = "133--136", day = "4", month = jul, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68P10 (68Q25)", MRnumber = "89m:68019", MRreviewer = "Ian Parberry", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Florida Int Univ, University Park, FL, USA", classification = "723; C4240 (Programming and algorithm theory); C6130 (Data handling techniques)", corpsource = "Sch. of Comput. Sci., Florida Int. Univ., Miami, FL, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; computational complexity; computer programming --- Algorithms; computer systems programming; increment sequences; measurement; mop-up time; network sorter; performance; quadratic worst-case; shaker-sort; Shaker-sort; shellsort; Shellsort; Sorting; sorting; theory; verification", pubcountry = "Netherlands A04", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching", treatment = "T Theoretical or Mathematical", } @Article{Morrison:1988:PAC, author = "John F. Morrison", title = "Parallel $p$-adic computation", journal = j-INFO-PROC-LETT, volume = "28", number = "3", pages = "137--140", day = "4", month = jul, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q99 (11A05 11Y16 68M05)", MRnumber = "89m:68105", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Towson State Univ, Baltimore, MD, USA", classification = "722; 723; C4240 (Programming and algorithm theory)", corpsource = "Dept. of Math. and Comput. Sci., Towson State Univ., Baltimore, MD, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; computer metatheory; computer programming --- Algorithms; computer systems, digital --- Parallel Processing; digital arithmetic; finite segment p-adic arithmetic; Hensel codes; p-adic arithmetic; parallel algorithms; parallel p-adic computation; parallel p-adic system; performance; programming theory; rational numbers; theory; verification", pubcountry = "Netherlands A05", subject = "F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism", treatment = "T Theoretical or Mathematical", } @Article{Luccio:1988:PSP, author = "Fabrizio Luccio and A. Pietracaprina and G. Pucci", title = "A probabilistic simulation of {PRAMs} on a bounded degree network", journal = j-INFO-PROC-LETT, volume = "28", number = "3", pages = "141--147", day = "4", month = jul, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q10 (68Q35)", MRnumber = "89h:68047", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Pisa, Pisa, Italy", classification = "722; 723; C4240 (Programming and algorithm theory); C5320G (Semiconductor storage)", corpsource = "Dept. of Comput. Sci., Pisa Univ., Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; area requirements; bounded degree network; computational complexity; computer programming --- Algorithms; computer simulation; computer systems, digital; design; interconnection network; memory cells; mesh-of-trees; mesh-of-trees interconnection network; MT roots; parallel algorithms; Parallel Processing; parallel random access machines; PRAM computation; probabilistic simulation; RAM; random-access storage; theory; time complexity; verification; VLSI; VLSI grid model", pubcountry = "Netherlands A06", subject = "B.7.1 Hardware, INTEGRATED CIRCUITS, Types and Design Styles, VLSI (very large scale integration) \\ C.4 Computer Systems Organization, PERFORMANCE OF SYSTEMS, Modeling techniques \\ F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism \\ I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms \\ B.7.1 Hardware, INTEGRATED CIRCUITS, Types and Design Styles, Memory technologies", treatment = "T Theoretical or Mathematical", } @Article{Chan:1988:OMP, author = "M. Y. Chan and W. L. Chung", title = "Optimal multidisk partial match file designs", journal = j-INFO-PROC-LETT, volume = "28", number = "3", pages = "149--155", day = "4", month = jul, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Texas at Dallas, Richardson, TX, USA", classification = "723; C1180 (Optimisation techniques); C4240 (Programming and algorithm theory); C6120 (File organisation)", corpsource = "Dept. of Comput. Sci., Texas Univ., Dallas, TX, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "data processing; design; disk modulo allocation; file buckets; file organisation; File Organization; hashing functions; information science --- Information Retrieval; management; multidisk file design; multidisk partial match file designs; multiple independently accessible disks; optimal assignments; optimisation; partial match queries; partial match query; redundancy; theory; verification", pubcountry = "Netherlands A07", subject = "H.3.2 Information Systems, INFORMATION STORAGE AND RETRIEVAL, Information Storage, File organization \\ D.4.3 Software, OPERATING SYSTEMS, File Systems Management, File organization", treatment = "T Theoretical or Mathematical", } @Article{Ural:1988:STS, author = "Hasan Ural and Bo Yang", title = "A structural test selection criterion", journal = j-INFO-PROC-LETT, volume = "28", number = "3", pages = "157--163", day = "4", month = jul, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68N05", MRnumber = "89h:68012", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Ottawa, Ottawa, Ont, Can", classification = "723; 921; C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Ottawa Univ., Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "all du-paths; complexity; computational complexity; computer software; input variables; mathematical techniques --- Graph Theory; OI-paths; output input path; output variable; performance; program flowgraph; program testing; programming theory; structural test selection; test selection criterion; Testing; theory; verification", pubcountry = "Netherlands A08", subject = "D.2.5 Software, SOFTWARE ENGINEERING, Testing and Debugging \\ G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous", treatment = "T Theoretical or Mathematical", } @Article{ODunlaing:1988:TLB, author = "Colm {\'O}'D{\'u}nlaing", title = "A tight lower bound for the complexity of path-planning for a disc", journal = j-INFO-PROC-LETT, volume = "28", number = "4", pages = "165--170", day = "29", month = jul, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68U05 (68Q25 90B10)", MRnumber = "89k:68148", MRreviewer = "Franz Aurenhammer", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Courant Inst of Mathematical Sciences, New York, NY, USA", classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Courant Inst. of Math. Sci., New York, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algebraic decision tree; Algorithms; complexity; computational complexity; computational geometry; computer programming; disc; lower bounds; motion planning; path planning; path-planning; planar room; polygonal boundary; polygonal obstacles; robotics --- Theory; shortest obstacle-avoiding path; theory; verification", pubcountry = "Netherlands A01", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Path and circuit problems \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Routing and layout", treatment = "T Theoretical or Mathematical", } @Article{Imase:1988:FTR, author = "Makoto Imase and Yoshifumi Manabe", title = "Fault-Tolerant Routings in a $\kappa$-Connected Network", journal = j-INFO-PROC-LETT, volume = "28", number = "4", pages = "171--175", day = "29", month = jul, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68M10 (68R10 90B10)", MRnumber = "89k:68005", MRreviewer = "Antal Iv{\'a}nyi", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "NTT, Musashino, Jpn", classification = "723; 921; B0250 (Combinatorial mathematics); B6110 (Information theory)B6150 (Communication system theory); B6210 (Telecommunication applications)", corpsource = "NTT Software Labs., Tokyo, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "communications network; computer networks; computer systems, digital --- Distributed; fault-tolerant measurements; fault-tolerant routings; fixed bidirectional routing; graph theory; kappa-connected network; mathematical techniques --- Graph Theory; Reliability; route graph; switching theory; telecommunication networks; theory; verification", pubcountry = "Netherlands A02", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Network problems \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Routing and layout \\ D.4.7 Software, OPERATING SYSTEMS, Organization and Design, Distributed systems", treatment = "T Theoretical or Mathematical", } @Article{Chung:1988:APR, author = "Moon Jung Chung and M. S. Krishnamoorthy", title = "Algorithms of placing recovery points", journal = j-INFO-PROC-LETT, volume = "28", number = "4", pages = "177--181", day = "29", month = jul, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68N05 (68Q25)", MRnumber = "89f:68010", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Rensselaer Polytechnic Inst, Troy, NY, USA", classification = "723; 921; C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Rensselaer Polytech. Inst., Troy, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; complexity; computational complexity; computer programming --- Algorithms; computer programs; computer software; directed graph; mathematical techniques --- Graph Theory; NP-complete; programming theory; recomputation time; recovery points; Reliability; roll-back time; system recovery; theory; verification", pubcountry = "Netherlands A03", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms", treatment = "T Theoretical or Mathematical", } @Article{Du:1988:STS, author = "Jianzhong Du and Joseph Y.-T. T. Leung", title = "Scheduling tree-structured tasks with restricted execution times", journal = j-INFO-PROC-LETT, volume = "28", number = "4", pages = "183--188", day = "29", month = jul, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (68N25 68Q15 90B35)", MRnumber = "89g:68023", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Texas at Dallas, Richardson, TX, USA", classification = "722; 723; C4240 (Programming and algorithm theory)", corpsource = "Comput. Sci. Program, Texas Univ., Dallas, Richardson, TX, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "complexity; computational complexity; computer systems, digital; Multiprocessing; multiprocessing systems; multiprocessor scheduling; NP-completeness; NP-hard; NP-hardness; restricted execution times; schedule length; scheduling; theory; tree-structured tasks; verification", pubcountry = "Netherlands A04", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sequencing and scheduling \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees \\ F.1.3 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Reducibility and completeness", treatment = "T Theoretical or Mathematical", } @Article{Rosenkrantz:1988:MMF, author = "Daniel J. Rosenkrantz and Harry B. {Hunt, III}", title = "Matrix multiplication for finite algebraic systems", journal = j-INFO-PROC-LETT, volume = "28", number = "4", pages = "189--192", day = "29", month = jul, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q20 (65F99 68Q10)", MRnumber = "89m:68053", MRreviewer = "D. Z. Spicer", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "State Univ of New York at Albany, Albany, NY, USA", classification = "921; C4140 (Linear algebra); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., State Univ. of New York, Albany, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "arbitrary multiplication operator; closed semiring; commutative addition operator; computer programming --- Algorithms; computer systems, digital --- Parallel Processing; design; finite algebraic systems; integer matrix multiplication; mathematical techniques; Matrix Algebra; matrix algebra; matrix closure; matrix multiplication; parallel algorithms; parallel computation; SIMD; theory; verification", pubcountry = "Netherlands A05", subject = "F.2.1 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Computations on matrices \\ I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms \\ C.1.2 Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors), Single-instruction-stream, multiple-data-stream processors (SIMD)", treatment = "T Theoretical or Mathematical", } @Article{Takada:1988:GIE, author = "Yuji Takada", title = "Grammatical Inference for Even Linear Languages Based on Control Sets", journal = j-INFO-PROC-LETT, volume = "28", number = "4", pages = "193--199", day = "29", month = jul, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q50 (68Q45)", MRnumber = "89f:68041", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Fujitsu Ltd, Shizuoka, Jpn", classification = "721; C4210 (Formal logic); C4220 (Automata theory)", corpsource = "Int. Inst. for Adv. Study of Social Inf. Sci., Fujitsu Ltd., Shizuoka, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; alphabet; automata theory; control sets; correctness; even linear languages; finite automata; fixed even linear grammar; Formal Languages; formal languages; grammars; grammatical inference; grammatical inference problem; languages; regular sets; theory; time complexity; unique regular control set; verification", pubcountry = "Netherlands A06", subject = "G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous \\ F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Algebraic language theory \\ G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous", treatment = "T Theoretical or Mathematical", } @Article{Chen:1988:PSI, author = "Guan-Ing Chen and Ten Hwang Lai", title = "Preemptive scheduling of independent jobs on a hypercube", journal = j-INFO-PROC-LETT, volume = "28", number = "4", pages = "201--206", day = "29", month = jul, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q10 (68M20 68Q25 90B35)", MRnumber = "89h:68038", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Ohio State Univ, Columbus, OH, USA", classification = "722; 723; C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. and Inf. Sci., Ohio State Univ., Columbus, OH, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; computer programming --- Algorithms; computer systems, digital; decidability; finishing time; hypercube; independent jobs; minimum-finishing-time schedule; parallel algorithms; Parallel Processing; polynomial time; preemptive scheduling; scheduling; theory; verification", pubcountry = "Netherlands A07", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sequencing and scheduling \\ G.m Mathematics of Computing, MISCELLANEOUS", treatment = "T Theoretical or Mathematical", } @Article{Brassard:1988:GRP, author = "Gilles Brassard and Sampath Kannan", title = "The generation of random permutations on the fly", journal = j-INFO-PROC-LETT, volume = "28", number = "4", pages = "207--212", day = "29", month = jul, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68P05 (68Q20)", MRnumber = "89h:68016", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ de Montreal, Montreal, Que, Can", classification = "723; 921; C4240 (Programming and algorithm theory)", corpsource = "Dept. d'Inf. et de Recherche Operationnelle, Montreal Univ., Que., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm theory; algorithms; Algorithms; balanced tree scheme; balanced trees; computer programming; continuous rehashing; data processing --- Data Structures; data structure techniques; data structures; design; design of algorithms; mathematical techniques --- Trees; memory space; random permutations; theory", pubcountry = "Netherlands A08", subject = "G.3 Mathematics of Computing, PROBABILITY AND STATISTICS \\ E.1 Data, DATA STRUCTURES \\ G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous", treatment = "T Theoretical or Mathematical", } @Article{Suzuki:1988:PPR, author = "Ichiro Suzuki", title = "Proving properties of a ring of finite-state machines", journal = j-INFO-PROC-LETT, volume = "28", number = "4", pages = "213--214", day = "29", month = jul, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q05", MRnumber = "89m:68029", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Wisconsin at Milwaukee, Milwaukee, WI, USA", classification = "721; C4220 (Automata theory)", corpsource = "Dept. of Electr. Eng. and Comput. Sci., Wisconsin Univ., WI, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; Finite Automata; finite automata; finite-state machines; memory space; state transition; theory; Turing machine; Turing machine simulation; unidirectional ring", pubcountry = "Netherlands A09", subject = "F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Automata \\ G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous \\ F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Bounded-action devices", treatment = "T Theoretical or Mathematical", } @Article{Inoue:1988:SCA, author = "Katsushi Inoue and Itsuo Takanami", title = "Some considerations about {${\rm NPRIORITY(1)}$} without {ROM}", journal = j-INFO-PROC-LETT, volume = "28", number = "4", pages = "215--219", day = "29", month = jul, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q10 (68Q05 68Q15)", MRnumber = "89j:68048", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Yamaguchi Univ, Ube, Jpn", classification = "721; 722; 723; C4220 (Automata theory); C5310 (Storage system design)", corpsource = "Dept. of Electron., Tamaguchi Univ., Ube, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; computational time bounds; computer systems, digital; concurrent-read-concurrent-write; CRCW; finite automata; nondeterministic one-way pushdown automata; NPRIORITY(1); Parallel Processing; parallel random access machines; pram; pushdown automata; random-access storage; theory; verification", pubcountry = "Netherlands A10", subject = "F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism \\ F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Automata \\ B.7.1 Hardware, INTEGRATED CIRCUITS, Types and Design Styles, Memory technologies", treatment = "T Theoretical or Mathematical", } @Article{Mazurkiewicz:1988:SAR, author = "Antoni Mazurkiewicz", title = "Solvability of the asynchronous ranking problem", journal = j-INFO-PROC-LETT, volume = "28", number = "5", pages = "221--224", day = "12", month = aug, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68N25 (68Q20)", MRnumber = "89h:68015", MRreviewer = "Roman Swiniarski", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Warszawa, Pol", classification = "722; 723; C1160 (Combinatorial mathematics); C4290 (Other computer theory); C5620 (Computer networks and techniques)", corpsource = "Comput. Sci. Inst., Polish Acad. of Sci., Warszawa, Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; Asynchronous Ranking Problem; asynchronous ranking problem; combinatorial mathematics; Computer Systems, Digital; Distributed; distributed processing; Mathematical Techniques --- Graph Theory; prime numbers; protocol; Solvability Criterion; theory", pubcountry = "Netherlands A01", subject = "F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Computability theory \\ G.1.2 Mathematics of Computing, NUMERICAL ANALYSIS, Approximation, Chebyshev approximation and theory \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Network problems \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees \\ F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Unbounded-action devices \\ F.2.1 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Number-theoretic computations \\ F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Algebraic language theory \\ C.2.5 Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Local Networks, Rings", treatment = "T Theoretical or Mathematical", } @Article{Iyer:1988:ONR, author = "Ananth V. Iyer and H. Donald Ratliff and G. Vijayan", title = "Optimal node ranking of trees", journal = j-INFO-PROC-LETT, volume = "28", number = "5", pages = "225--229", day = "12", month = aug, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68R10 (05C05 68Q25)", MRnumber = "89h:68119", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Chicago, IL, USA", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Graduate Sch. of Bus., Chicago Univ., IL, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; computational complexity; Computer Programming --- Algorithms; design; General Node Coloring Problem; graph colouring; Mathematical Techniques; node coloring; Node Separator; node separator tree; Optimal Node Ranking; optimal node ranking; optimisation; theory; Trees; trees; trees (mathematics)", pubcountry = "Netherlands A02", review = "ACM CR 8904-0248", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees \\ G.1.6 Mathematics of Computing, NUMERICAL ANALYSIS, Optimization, Nonlinear programming \\ B.7.2 Hardware, INTEGRATED CIRCUITS, Design Aids, Layout \\ B.7.1 Hardware, INTEGRATED CIRCUITS, Types and Design Styles, VLSI (very large scale integration)", treatment = "T Theoretical or Mathematical", } @Article{Platt:1988:ACU, author = "Don Platt and Moneeb A. Magdy", title = "Adaptive control using switched capacitor filters", journal = j-INFO-PROC-LETT, volume = "28", number = "5", pages = "231--234", day = "12", month = aug, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Aust", classification = "713; 731; C1340E (Self-adjusting systems); C7420 (Control engineering)", corpsource = "Dept. of Electr. and Comput. Eng., Wollongong Univ., NSW, Australia", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "adaptive control; adaptive controller; algorithms; Computers, Digital --- Applications; Control Systems, Adaptive; design; Electric Filters, Switched; Fault-Tolerance; fixed controller; limited capability processors; process computer control; process control; Process Control --- Theory; reliability; software failure; Software Failures; supervisory computer; supervisory loop; switched capacitor circuits; Switched Capacitor Filters; switched capacitor filters; theory; Theory", pubcountry = "Netherlands A03", subject = "C.3 Computer Systems Organization, SPECIAL-PURPOSE AND APPLICATION-BASED SYSTEMS, Process control systems \\ J.7 Computer Applications, COMPUTERS IN OTHER SYSTEMS, Process control \\ J.7 Computer Applications, COMPUTERS IN OTHER SYSTEMS, Industrial control \\ B.7.1 Hardware, INTEGRATED CIRCUITS, Types and Design Styles \\ B.4.2 Hardware, INPUT/OUTPUT AND DATA COMMUNICATIONS, Input/Output Devices, Channels and controllers \\ I.2.8 Computing Methodologies, ARTIFICIAL INTELLIGENCE, Problem Solving, Control Methods, and Search, Dynamic programming", treatment = "T Theoretical or Mathematical", } @Article{Li:1988:RPP, author = "Shuo-Yen Robert Li", title = "Reconstruction of polygons from projections", journal = j-INFO-PROC-LETT, volume = "28", number = "5", pages = "235--240", day = "12", month = aug, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68U05", MRnumber = "89h:68145", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Morristown, NJ, USA", classification = "723; C1250 (Pattern recognition)", corpsource = "Bell Commun. Res., Morristown, NJ, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; computer vision; convex polygon; Convex Polygon; design; Geometric Probe; line probe; Line Probe; mathematical projection; Mathematical Techniques --- Geometry; picture processing; planar object; Probes; projection probe; Projection Probe; robotic sensory devices; Robotics; theory", pubcountry = "Netherlands A04", subject = "I.3.7 Computing Methodologies, COMPUTER GRAPHICS, Three-Dimensional Graphics and Realism, Visible line/surface algorithms \\ I.2.9 Computing Methodologies, ARTIFICIAL INTELLIGENCE, Robotics, Sensors \\ I.5.4 Computing Methodologies, PATTERN RECOGNITION, Applications, Computer vision \\ I.4.7 Computing Methodologies, IMAGE PROCESSING, Feature Measurement, Projections \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations", treatment = "T Theoretical or Mathematical", } @Article{Karloff:1988:UTS, author = "Howard J. Karloff and Ramamohan Paturi and Janos Simon", title = "Universal traversal sequences of length {$n^{O(\log n)}$} for cliques", journal = j-INFO-PROC-LETT, volume = "28", number = "5", pages = "241--243", day = "12", month = aug, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (68R10)", MRnumber = "90d:68033", MRreviewer = "William Gasarch", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Chicago, IL, USA", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Chicago Univ., IL, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; Cliques; cliques; computational complexity; Computer Programming --- Algorithms; Connectivity; Explicit Construction; Graph Theory; graph theory; graphs; logarithmic space complexity classes; Mathematical Techniques; reachability problem; Space-Bounded Computation; theory; undirected graphs; Universal Traversal Sequences; universal traversal sequences", pubcountry = "Netherlands A05", review = "ACM CR 8905-0325", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Path and circuit problems \\ F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism \\ F.1.3 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Relations among complexity classes", treatment = "T Theoretical or Mathematical", } @Article{Romeuf:1988:SPU, author = "Jean-Fran{\c{c}}ois Romeuf", title = "Shortest path under rational constraint", journal = j-INFO-PROC-LETT, volume = "28", number = "5", pages = "245--248", day = "12", month = aug, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68R10 (05C38 68Q70 90B10)", MRnumber = "89j:68124", MRreviewer = "J. Bond", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Mont-Saint-Aignan, Fr", classification = "921; C1160 (Combinatorial mathematics); C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "Lab. d'Inf., Rouen Univ., Mont-Saint-Aignan, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; Automata Theory --- Finite Automata; complexity; computational complexity; Computer Programming --- Algorithms; directed graphs; finite automata; Graph Theory; graph theory; Mathematical Techniques; Rational Constraint; rational constraint; Shortest Path Problems; shortest paths; theory; undirected graph; valuated alphabet; Valuated Graphs; valuated graphs", pubcountry = "Netherlands A06", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Path and circuit problems \\ G.3 Mathematics of Computing, PROBABILITY AND STATISTICS, Probabilistic algorithms (including Monte Carlo)", treatment = "T Theoretical or Mathematical", } @Article{Fortnow:1988:TIP, author = "Lance Fortnow and Michael Sipser", title = "Are there interactive protocols for {CO-NP} languages?", journal = j-INFO-PROC-LETT, volume = "28", number = "5", pages = "249--251", day = "12", month = aug, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q15 (03D15 68Q05 68Q45)", MRnumber = "89i:68040", MRreviewer = "Satoru Miyano", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Cambridge, MA, USA", classification = "721; C4210 (Formal logic); C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Math., MIT, Cambridge, MA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; Automata Theory; co-NP Languages; co-NP languages; co-NP Problems; computational complexity; Formal Languages; formal languages; Interactive Protocols; interactive protocols; languages; Oracles; theory; Turing machines; verification", pubcountry = "Netherlands A07", subject = "F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Algebraic language theory \\ F.1.3 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Reducibility and completeness \\ F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation \\ F.3.1 Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs, Mechanical verification \\ F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Bounded-action devices \\ F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Relations among models \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms", treatment = "T Theoretical or Mathematical", } @Article{Ciaccia:1988:UAE, author = "Paolo Ciaccia and Dario Maio and Paolo Tiberio", title = "A unifying approach to evaluating block accesses in database organizations", journal = j-INFO-PROC-LETT, volume = "28", number = "5", pages = "253--257", day = "12", month = aug, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68P20 (68P15)", MRnumber = "89j:68034", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Bologna, Italy", classification = "723; 902; 922; C1140Z (Other and miscellaneous); C4210 (Formal logic); C4250 (Database theory); C6120 (File organisation)", corpsource = "Dept. of Electr. Eng. and Comput. and Inf. Sci., Bologna Univ., Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; Block Accesses; block accesses; Blocking Factor; database organizations; Database Systems; database theory; file organisation; Information Science --- Information Retrieval; Nonrecursive Discrete Density Function; nonrecursive discrete density function; performance; Probability; probability; probability function; recursive functions; theory; Theory", pubcountry = "Netherlands A08", review = "ACM CR 8906-0402", subject = "H.3.2 Information Systems, INFORMATION STORAGE AND RETRIEVAL, Information Storage, File organization \\ G.3 Mathematics of Computing, PROBABILITY AND STATISTICS, Probabilistic algorithms (including Monte Carlo) \\ D.4.3 Software, OPERATING SYSTEMS, File Systems Management, Access methods \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures", treatment = "T Theoretical or Mathematical", } @Article{Das:1988:FFI, author = "P. K. Das and D. Q. M. Fay", title = "Fault-tolerant and flexible interconnection of multiple processors", journal = j-INFO-PROC-LETT, volume = "28", number = "5", pages = "259--268", day = "12", month = aug, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Belfast, North Irel", classification = "722; 723; C4230 (Switching theory); C5440 (Multiprocessor systems and techniques)", corpsource = "Dept. of Comput. Sci., Queen's Univ. of Belfast, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; Computer Systems, Digital; design; Dynamic Reconfiguration; dynamic reconfiguration; fault tolerant computing; Fault-Tolerant Computing; flexible interconnection; languages; multiple processors; Multiprocessor Interconnection; multiprocessor interconnection networks; one-sided baseline system; Parallel Processing; parallel processing; performance; processor interconnection; redundant switches; reliability; theory; transputers", pubcountry = "Netherlands A09", review = "ACM CR 8911-0801", subject = "C.1.2 Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors), Interconnection architectures \\ C.2.1 Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Architecture and Design, Network topology \\ B.6.2 Hardware, LOGIC DESIGN, Reliability and Testing, Redundant design \\ F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Automata \\ D.4.1 Software, OPERATING SYSTEMS, Process Management \\ D.4.5 Software, OPERATING SYSTEMS, Reliability, Fault-tolerance", treatment = "T Theoretical or Mathematical", } @Article{Miller:1988:CIJ, author = "Leslie L. Miller and S. K. Gadia and S. Kothari and K. C. Liu", title = "Completeness issues for join dependencies derived from the universal relation join dependency", journal = j-INFO-PROC-LETT, volume = "28", number = "5", pages = "269--274", day = "12", month = aug, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68P15", MRnumber = "89j:68029", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Ames, IA, USA", classification = "723; C4250 (Database theory)", corpsource = "Dept. of Comput. Sci., Iowa State Univ., Ames, IA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; Completeness; Database Systems; database theory; Join Dependencies; join dependencies; performance; Relational; relational databases; theory; Universal Relation Join Dependency; universal relation join dependency", pubcountry = "Netherlands A10", subject = "F.1.3 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Reducibility and completeness \\ H.2.1 Information Systems, DATABASE MANAGEMENT, Logical Design, Data models", treatment = "T Theoretical or Mathematical", } @Article{Bertossi:1988:DNI, author = "Alan A. Bertossi", title = "On the domatic number of interval graphs", journal = j-INFO-PROC-LETT, volume = "28", number = "6", pages = "275--280", day = "29", month = aug, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q20 (05C35 68Q25 68R10)", MRnumber = "89h:68054", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Pisa, Pisa, Italy", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Pisa Univ., Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm theory; algorithms; analysis of algorithms; computational complexity; computer programming --- Algorithms; domatic number; dominating set; Graph Theory; graph theory; intersecting intervals; interval graphs; mathematical techniques; maximum cardinality partition; nodes; real line; theory", review = "ACM CR 8911-0824", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms \\ G.2.1 Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics, Combinatorial algorithms \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures", treatment = "T Theoretical or Mathematical", } @Article{Wang:1988:STG, author = "D. W. Wang and Yue-Sun Kuo", title = "A study on two geometric location problems", journal = j-INFO-PROC-LETT, volume = "28", number = "6", pages = "281--286", day = "29", month = aug, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68U05 (68Q25)", MRnumber = "89i:68121", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Natl Taiwan Univ, Taipei, Taiwan", classification = "723; 921; C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci. and Inf. Eng., Nat. Taiwan Univ., Taipei, Taiwan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; circle intersection graphs; computational complexity; computational geometry; computer programming --- Algorithms; dynamic programming algorithm; Euclidean p-center problem; geometric location problems; Geometry; mathematical programming, dynamic; mathematical techniques; maximum independent set problem; NP-hard; p-center problem; theory", review = "ACM CR 8904-0239", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching \\ G.1.6 Mathematics of Computing, NUMERICAL ANALYSIS, Optimization, Nonlinear programming \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures \\ F.1.3 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Reducibility and completeness", treatment = "T Theoretical or Mathematical", } @Article{Vidyasankar:1988:CLR, author = "K. Vidyasankar", title = "Converting {Lamport}'s regular register to atomic register", journal = j-INFO-PROC-LETT, volume = "28", number = "6", pages = "287--290", day = "29", month = aug, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q10", MRnumber = "90g:68045", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Memorial Univ of Newfoundland, St. John's, Newfoundl, Can", classification = "722; 723; C4220 (Automata theory); C4230 (Switching theory)", corpsource = "Dept. of Comput. Sci., Memorial Univ. of Newfoundland, St. John's, Nfld., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; atomic register; automata theory; Boolean functions; Boolean registers; computer metatheory; computer systems, digital; design; Distributed; Lamport registers; multivalued n-reader 1-writer registers; regular register; regular resister; safe register; shared register; switching theory; theory", subject = "B.4.3 Hardware, INPUT/OUTPUT AND DATA COMMUNICATIONS, Interconnections (subsystems), Asynchronous/synchronous operation \\ B.5.1 Hardware, REGISTER-TRANSFER-LEVEL IMPLEMENTATION, Design, Arithmetic and logic units", treatment = "T Theoretical or Mathematical", } @Article{Hartmanis:1988:SOS, author = "Juris Hartmanis and Lane Hemachandra", title = "On sparse oracles separating feasible complexity classes", journal = j-INFO-PROC-LETT, volume = "28", number = "6", pages = "291--295", day = "29", month = aug, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q15 (68Q30)", MRnumber = "89i:68041", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Cornell Univ, Ithaca, NY, USA", classification = "723; C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; co-NP; computational complexity; computer metatheory; feasible complexity classes; formal languages; high self-referential Kolmogorov complexity; Kolmogorov complexity; languages; non-self-printable sets; NP; P; p-printability; polynomial-time hierarchy; PSPACE; relativation; sparse oracles; theory", subject = "E.4 Data, CODING AND INFORMATION THEORY, Formal models of communication \\ F.1.3 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Reducibility and completeness \\ F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Relativized computation \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures", treatment = "T Theoretical or Mathematical", } @Article{Chen:1988:TAC, author = "Gen-Huey Chen and M. S. Yu and L. T. Liu", title = "Two algorithms for constructing a binary tree from its traversals", journal = j-INFO-PROC-LETT, volume = "28", number = "6", pages = "297--299", day = "29", month = aug, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q20 (68P05)", MRnumber = "89i:68048", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Natl Taiwan Univ, Taipei, Taiwan", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci. and Inf. Eng., Nat. Taiwan Univ., Taipei, Taiwan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm theory; algorithms; analysis of algorithms; binary tree; computer programming --- Algorithms; construction algorithms; data processing --- Data Structures; data structures; mathematical techniques; performance; postorder traversals; preorder; theory; traversals; tree traversal; Trees; trees (mathematics)", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures \\ G.1.6 Mathematics of Computing, NUMERICAL ANALYSIS, Optimization, Nonlinear programming \\ F.2.3 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Tradeoffs among Complexity Measures", treatment = "T Theoretical or Mathematical", } @Article{Ho:1988:EPA, author = "Chin Wen Ho and Richard C. T. Lee", title = "Efficient parallel algorithms for finding maximal cliques, clique trees, and minimum coloring on chordal graphs", journal = j-INFO-PROC-LETT, volume = "28", number = "6", pages = "301--309", day = "29", month = aug, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q20 (05C35 68R10)", MRnumber = "89k:68055", MRreviewer = "G. Berman", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Natl Tsing Hua Univ, Hsinchu, Taiwan", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Inst. of Comput. and Decision Sci., Nat. Tsing Hua Univ., Hsinchu, Taiwan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm theory; algorithms; chordal graphs; clique trees; complexity; computational complexity; computer programming --- Algorithms; computer systems, digital --- Parallel Processing; graph colouring; graph theory; Graph Theory; mathematical techniques; maximal cliques; minimum coloring; parallel algorithms; performance; theory; trees (mathematics); verification", review = "ACM CR 8909-0674 8909-0673", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees \\ F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures", treatment = "T Theoretical or Mathematical", } @Article{Liskiewicz:1988:ART, author = "Maciej Li{\'s}kiewicz and Krzysztof Lory{\'s}", title = "Alternating real-time computations", journal = j-INFO-PROC-LETT, volume = "28", number = "6", pages = "311--316", day = "29", month = aug, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q05 (03D10 03D15)", MRnumber = "89j:68040", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Wroclaw, Wroclaw, Pol", classification = "721; C4210 (Formal logic); C4220 (Automata theory)", corpsource = "Inst. of Comput. Sci., Wroclaw Univ., Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; alternating real-time computations; alternating real-time pushdown automata; automata theory; computational power; deterministic automata; deterministic machines; formal languages; languages; multitape alternating machines; performance; pushdown automata; real time tuning machines; real-time systems; real-time Turing machines; rudimentary languages; theory; Turing Machines; Turing machines; work tapes", subject = "F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Bounded-action devices \\ F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Automata \\ F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Alternation and nondeterminism \\ F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Algebraic language theory", treatment = "T Theoretical or Mathematical", } @Article{Chan:1988:TUD, author = "Edward P. F. Chan and Hector J. Hernandez", title = "Testing unboundedness of database schemes and functional dependencies", journal = j-INFO-PROC-LETT, volume = "28", number = "6", pages = "317--326", day = "29", month = aug, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Alberta, Edmonton, Alberta, Can", classification = "723; C4250 (Database theory)", corpsource = "Dept. of Comput. Sci., Alberta Univ., Edmonton, Alta., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; database schema design; database schemes; database systems; database theory; functional dependencies; query processing; Relational; theory; unboundedness; weak instance model", review = "ACM CR 8907-0487", subject = "H.2.1 Information Systems, DATABASE MANAGEMENT, Logical Design, Normal forms \\ H.2.1 Information Systems, DATABASE MANAGEMENT, Logical Design, Schema and subschema \\ F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Unbounded-action devices \\ F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Bounded-action devices", treatment = "T Theoretical or Mathematical", } @Article{Loui:1988:CEC, author = "Michael C. Loui and Teresa A. Matsushita and Douglas B. West", title = "Corrigendum: {``Election in a Complete Network with a Sense of Direction''} {[Inform. Process. Lett. {\bf 22}(4), 17 April 1986, pp. 185--187]}", journal = j-INFO-PROC-LETT, volume = "28", number = "6", pages = "327--327", day = "29", month = aug, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See \cite{Loui:1986:ECN}.", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Coordinated Sci. Lab., Illinois Univ., Urbana, IL, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "algorithm theory; algorithms; complete network; election; sense of direction; theory", subject = "F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Unbounded-action devices \\ C.2.5 Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Local Networks, Rings", treatment = "T Theoretical or Mathematical", } @Article{Minoux:1988:LSL, author = "Michel Minoux", title = "{LTUR}: a simplified linear-time unit resolution algorithm for {Horn} formulae and computer implementation", journal = j-INFO-PROC-LETT, volume = "29", number = "1", pages = "1--12", day = "15", month = sep, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68T15 (03B05 03B35 03B70 68T25)", MRnumber = "89j:68136", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Paris, Fr", classification = "723; C1230 (Artificial intelligence); C4240 (Programming and algorithm theory); C6110 (Systems analysis and programming)", corpsource = "Lab. MASI, Paris 6 Univ., France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; Artificial Intelligence; computational complexity; computer implementation; Computer Metatheory--Programming Theory; Computer Programming; data structures; design; FORTRAN computer code; FORTRAN listings; Horn expression; Horn Formulas; Hornlog; interpreters; Linear-Time Unit Resolution Algorithm; linear-time unit resolution algorithm; Logic Programming; logic programming; LTUR; ltur Algorithm; predicate logic-based languages; Propositional Calculus; propositional calculus; propositional Horn formulae; Satisfiability; testing for satisfiability; theory", subject = "F.4.1 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Logic programming \\ I.2.3 Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Logic programming", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Huang:1988:FDT, author = "Shing Tsaan Huang", title = "A fully distributed termination detection scheme", journal = j-INFO-PROC-LETT, volume = "29", number = "1", pages = "13--18", day = "15", month = sep, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q10 (68M10)", MRnumber = "89j:68047", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Hsinchu, Taiwan", classification = "722; 723; C6150J (Operating systems)", corpsource = "Inst. of Comput. and Decision Sci., Nat. Tsing Hua Univ., Hsinchu, Taiwan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Computer Metatheory; Computer Systems, Digital; connection topology; design; Distributed; Distributed Computations; distributed processing; Distributed Termination Detection; fully distributed termination detection scheme; Message Passing; performance; theory", subject = "D.2.4 Software, SOFTWARE ENGINEERING, Program Verification, Correctness proofs \\ D.1.m Software, PROGRAMMING TECHNIQUES, Miscellaneous \\ D.4.7 Software, OPERATING SYSTEMS, Organization and Design, Distributed systems", treatment = "T Theoretical or Mathematical", } @Article{Raoult:1988:POP, author = "Jean-Claude Raoult", title = "Proving open properties by induction", journal = j-INFO-PROC-LETT, volume = "29", number = "1", pages = "19--23", day = "15", month = sep, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "04A10 (04A25 06A10 54F05)", MRnumber = "90k:04001", MRreviewer = "S. Rudeanu", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Rennes, Fr", classification = "723; 921; C1160 (Combinatorial mathematics)", corpsource = "Inst. de Recherche en Inf. et Syst. Al{\'e}atoires, Campus Univ. de Beaulieu, Rennes, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Computer Metatheory; Induction; induction; infinite products; Mathematical Techniques; Noetherian Induction; noetherian partial orders; Open Properties; open properties; Partially Ordered Sets; Set Theory; set theory; theory; topology; verification", subject = "I.2.6 Computing Methodologies, ARTIFICIAL INTELLIGENCE, Learning, Induction \\ G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous \\ F.4.1 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Computational logic", treatment = "T Theoretical or Mathematical", } @Article{Reichling:1988:DCI, author = "Matthias Reichling", title = "On the detection of a common intersection of $k$ convex objects in the plane", journal = j-INFO-PROC-LETT, volume = "29", number = "1", pages = "25--29", day = "15", month = sep, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68U05 (68Q25 90B99)", MRnumber = "89j:68150", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Wuerzburg, West Ger", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Lehrstuhl f{\"u}r Inf. I, Wurzburg Univ., West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; Common Intersection; common intersection; complexity; computational complexity; Computational Geometry; computational geometry; Computer Programming; convex n-gons; Convex Polygons; detection; Disks; extremal point; k convex objects; k disks; Mathematical Techniques--Geometry; plane; theory", subject = "G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations", treatment = "T Theoretical or Mathematical", } @Article{Burton:1988:PAP, author = "F. Warren Burton and G. P. McKeown and V. J. Rayward-Smith", title = "On process assignment in parallel computing", journal = j-INFO-PROC-LETT, volume = "29", number = "1", pages = "31--34", day = "15", month = sep, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Salt Lake City, UT, USA", classification = "722; 723; C4240 (Programming and algorithm theory); C6150J (Operating systems)", corpsource = "Dept. of Comput. Sci., Utah Univ., Salt Lake City, UT, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computational complexity; Computer Systems, Digital; Dynamic Allocation; dynamic allocation; length; List Schedules; list scheduling; MIMD Computers; operating systems (computers); parallel algorithms; parallel computing; Parallel Processing; Process Assignment; process assignment; Scheduling; scheduling; theory", subject = "D.1.m Software, PROGRAMMING TECHNIQUES, Miscellaneous \\ F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sequencing and scheduling", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Makinen:1988:LSH, author = "Erkki Makinen", title = "On linear search heuristics", journal = j-INFO-PROC-LETT, volume = "29", number = "1", pages = "35--36", day = "15", month = sep, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Tampere, Finl", classification = "723; C1230 (Artificial intelligence); C6120 (File organisation)", corpsource = "Dept. of Comput. Sci., Tampere Univ., Finland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "accessed item; Computer Programming; Data Processing; Data Structures; data structures; front; heuristic programming; insertions; Linear Search Heuristics; linear search heuristics; list; new head; new rear; old head; old rear; pointers; rear; records; restructuring rule; Restructuring Rules; RO; rotation rule; Rotation Rules; search problems; Self-Adjusting Data Structure; theory", subject = "I.2.8 Computing Methodologies, ARTIFICIAL INTELLIGENCE, Problem Solving, Control Methods, and Search, Heuristic methods \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Atkinson:1988:PAB, author = "Michael D. Atkinson and N. Santoro", title = "A practical algorithm for {Boolean} matrix multiplication", journal = j-INFO-PROC-LETT, volume = "29", number = "1", pages = "37--38", day = "15", month = sep, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25", MRnumber = "89j:68065", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Ottawa, Ont, Can", classification = "723; 921; C4140 (Linear algebra); C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Sch. of Comput. Sci., Carleton Univ., Ottawa, Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; Auxiliary Storage; auxiliary storage; Boolean algebra; Boolean Matrices; Boolean matrix multiplication; computational complexity; Computer Programming; Mathematical Techniques--Matrix Algebra; matrix algebra; Matrix Multiplication; n*n Boolean matrices; theory; Time Complexity; time complexity; verification", subject = "F.2.1 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Computations on matrices", treatment = "T Theoretical or Mathematical", } @Article{Kessels:1988:EPS, author = "J. L. W. Kessels", title = "An exercise in proving self-stabilization with a variant function", journal = j-INFO-PROC-LETT, volume = "29", number = "1", pages = "39--42", day = "15", month = sep, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q60 (68Q10)", MRnumber = "89j:68106", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Eindhoven, Neth", classification = "722; 723; C1240 (Adaptive system theory); C1320 (Stability); C1340E (Self-adjusting systems)", corpsource = "Philips Res. Labs., Eindhoven, Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "adaptive systems; algorithms; bound function; Bound Functions; Computer Metatheory; Computer Systems, Digital; correctness; Dijkstra; Distributed; languages; loop termination; measurement; Mutual Exclusion; performance; self-adjusting systems; self-stabilization; Self-Stabilizing Distributed Systems; self-stabilizing systems; stability; theory; Token Passing; variant function; Variant Functions", subject = "F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Algebraic language theory \\ I.2.8 Computing Methodologies, ARTIFICIAL INTELLIGENCE, Problem Solving, Control Methods, and Search, Dynamic programming \\ D.3.4 Software, PROGRAMMING LANGUAGES, Processors, Compilers", treatment = "T Theoretical or Mathematical", } @Article{Sassa:1988:TOS, author = "Masataka Sassa and Ikuo Nakata", title = "Time-optimal short-circuit evaluation of {Boolean} expressions", journal = j-INFO-PROC-LETT, volume = "29", number = "1", pages = "43--51", day = "15", month = sep, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q20 (68N20 94C10)", MRnumber = "90f:68070", MRreviewer = "A. A. Mullin", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Sakura-mura, Jpn", classification = "723; 921; C4210 (Formal logic)", corpsource = "Inst. of Inf. Sci. and Electron., Tsukuba Univ., Ibaraki, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; Boolean expressions; Boolean Expressions; Boolean functions; Code Generation; Computer Metatheory--Boolean Functions; Computer Programming Languages; Database Systems--Query Languages; evaluation sequence; Expected Execution Time; languages; Mathematical Programming, Dynamic; measurement; Optimization; performance; reordering; Short-Circuit Evaluation; Theory; theory; time-optimal short-circuit evaluation", subject = "F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Algebraic language theory \\ I.2.8 Computing Methodologies, ARTIFICIAL INTELLIGENCE, Problem Solving, Control Methods, and Search, Dynamic programming \\ D.3.4 Software, PROGRAMMING LANGUAGES, Processors, Compilers", treatment = "T Theoretical or Mathematical", } @Article{Arora:1988:MCD, author = "R. K. Arora and M. N. Gupta", title = "More comments on: {``Distributed termination detection algorithm for distributed computations'' [Arora, Gupta and S. P. Rana, Inform. Process. Lett. {\bf 22} (1986), no. 6, 311--314; R. B. Tan, G. Tel and J. van Leeuwen, ibid. {\bf 23} (1986), no. 3, 163; MR 87j:68034a b]}", journal = j-INFO-PROC-LETT, volume = "29", number = "1", pages = "53--55", day = "15", month = sep, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q10", MRnumber = "89j:68043", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See \cite{Tan:1986:CDT,Arora:1986:DTD}.", acknowledgement = ack-nhfb, classification = "C6150J (Operating systems)", corpsource = "Indian Inst. of Technol., New Delhi, India", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "counterexample; distributed computations; distributed processing; distributed termination detection algorithm; network; probe-message", treatment = "T Theoretical or Mathematical", } @Article{Arnold:1988:LAS, author = "Andr{\'e} Arnold and Paul Crubille", title = "A linear algorithm to solve fixed-point equations on transition systems", journal = j-INFO-PROC-LETT, volume = "29", number = "2", pages = "57--66", day = "30", month = sep, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q20 (68Q25 68Q70 68Q90 68R10)", MRnumber = "90c:68024", MRreviewer = "Toshimasa Watanabe", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Talence, Fr", classification = "723; 921; C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Dept. d'Inf., Bordeaux I Univ., Talence, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; computational complexity; Computer Programming; Directed Graphs; directed graphs; fixed-point equations; Fixed-Point Equations; formal logic; Least Fixed Points; linear algorithm; Linear Algorithms; Mathematical Techniques--Graph Theory; parallel algorithms; program verification; temporal logic; theory; Time Complexity; time complexity; Transition Systems; transition systems; verification", subject = "G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous \\ F.4.1 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Computational logic", treatment = "T Theoretical or Mathematical", } @Article{Szalas:1988:IRP, author = "Andrzej Sza{\l}as", title = "An incompleteness result in {Process Algebra}", journal = j-INFO-PROC-LETT, volume = "29", number = "2", pages = "67--70", day = "30", month = sep, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q10 (68Q05 68Q55 68Q60)", MRnumber = "90b:68027", MRreviewer = "R{\"u}diger Valk", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Warsaw, Pol", classification = "722; 723; 921; C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Inst. of Inf., Warsaw Univ., Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Communicating Processes; Computer Metatheory; Computer Systems, Digital; Concurrency; decidability; decidable; Distributed; equational theory; Incompleteness; incompleteness; Mathematical Techniques--Algebra; parallel algorithms; Process Algebra; process algebra; rewriting systems; theory", subject = "D.3.3 Software, PROGRAMMING LANGUAGES, Language Constructs, Concurrent programming structures \\ D.4.1 Software, OPERATING SYSTEMS, Process Management, Concurrency \\ I.1.m Computing Methodologies, ALGEBRAIC MANIPULATION, Miscellaneous", treatment = "T Theoretical or Mathematical", } @Article{Rytter:1988:EPC, author = "Wojciech Rytter", title = "On efficient parallel computations of costs of paths on a grid graph", journal = j-INFO-PROC-LETT, volume = "29", number = "2", pages = "71--74", day = "30", month = sep, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (68R10 90B10)", MRnumber = "89j:68071", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Warsaw, Pol", classification = "721; 722; 723; 921; C4210 (Formal logic); C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "Inst. of Inf., Warsaw Univ., Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; Automata Theory--Finite Automata; computational complexity; Computer Programming--Algorithms; Computer Systems, Digital; Context-Free Languages; context-free languages; directed acyclic graphs; directed graphs; edit- distance; EREW PRAM; Exclusive Read Exclusive Write; finite automata; grid graph; Grid Graphs; languages; Mathematical Techniques--Graph Theory; parallel algorithms; Parallel Computations; parallel computations; Parallel Processing; Parallel Random-Access Machines; theory; two-head finite automata; verification", subject = "F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism \\ G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous \\ F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Algebraic language theory \\ I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Algebraic algorithms", treatment = "T Theoretical or Mathematical", } @Article{Hoffmann:1988:ERG, author = "Frank Hoffmann and Klaus Kriegel", title = "Embedding rectilinear graphs in linear time", journal = j-INFO-PROC-LETT, volume = "29", number = "2", pages = "75--79", day = "30", month = sep, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q20 (05C10 68Q25 68R10)", MRnumber = "89k:68056", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Berlin, East Ger", classification = "723; 921; C4240 (Programming and algorithm theory)", corpsource = "Karl-Weierstrass-Inst. f{\"u}r Math., Acad. der Wissenschaften, East Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; computational complexity; Computer Programming; directed graphs; Graph Embedding; graph embedding; linear-time algorithm; Linear-Time Algorithms; Mathematical Techniques--Graph Theory; Rectilinear; rectilinear graphs; theory; verification", subject = "G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous", treatment = "T Theoretical or Mathematical", } @Article{Blikle:1988:GTM, author = "Andrzej Blikle", title = "A guided tour of the mathematics of {MetaSoft} '88", journal = j-INFO-PROC-LETT, volume = "29", number = "2", pages = "81--86", day = "30", month = sep, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Warsaw, Pol", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory); C6110B (Software engineering techniques)", corpsource = "Inst. of Comput. Sci., Polish Acad. of Sci., Warsaw, Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Computer Software; computer support tools; denotational models; denotations; formal specification; languages; mathematical foundations; Mathematical Techniques; Metasoft; MetaSoft; MetaSoft'88; programming theory; semantic domains; set theory; Software Design; software design; Software Development; Software Engineering; software specification; Software Validation; theory; three-valued predicates", subject = "F.3.2 Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Denotational semantics \\ D.2.1 Software, SOFTWARE ENGINEERING, Requirements/Specifications \\ F.3.2 Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Algebraic approaches to semantics \\ F.4.1 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Computability theory", treatment = "T Theoretical or Mathematical", } @Article{Watjen:1988:DSL, author = "Dietmar W{\"a}tjen and Erwin Unruh", title = "On the degree of synchronization of $k\,${lT0L} and $k\,${lET0L} systems", journal = j-INFO-PROC-LETT, volume = "29", number = "2", pages = "87--89", day = "30", month = sep, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q45", MRnumber = "89j:68086", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Braunschweig, West Ger", classification = "721; C4210 (Formal logic)", corpsource = "Inst. f{\"u}r Theor. Inf., Tech. Univ. Braunschweig, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Automata Theory; Degree of Synchronization; Formal Languages; formal languages; infinite hierarchy; k1ET0L systems; k1T0L systems; L Systems; L systems; language families; languages; synchronization; theory; verification", subject = "F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Algebraic language theory \\ F.4.2 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems, Parallel rewriting systems", treatment = "T Theoretical or Mathematical", } @Article{deLuca:1988:TSL, author = "Aldo {de Luca} and Mariacristina Pelagalli and Stefano Varricchio", title = "Test sets for languages of infinite words", journal = j-INFO-PROC-LETT, volume = "29", number = "2", pages = "91--95", day = "30", month = sep, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q45", MRnumber = "89j:68083", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Rome, Italy", classification = "721; C4210 (Formal logic)", corpsource = "Dept. of Math., Rome Univ., Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; Automata Theory; Ehrenfeucht conjecture; finite alphabet; finite equivalent subsystem; Formal Languages; formal languages; Infinite Words; infinite words; Omega-Languages; performance; Test Sets; test sets; theory; verification; word equation; Word Equations", subject = "F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Algebraic language theory \\ G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous", treatment = "T Theoretical or Mathematical", } @Article{Louka:1988:DPT, author = "Basile Louka and Maurice Tchuente", title = "Dynamic programming on two-dimensional systolic arrays", journal = j-INFO-PROC-LETT, volume = "29", number = "2", pages = "97--104", day = "30", month = sep, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q80 (90C39)", MRnumber = "89m:68103", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Yaounde, Cameroon", classification = "723; 921; C1160 (Combinatorial mathematics); C1180 (Optimisation techniques); C4240 (Programming and algorithm theory)", corpsource = "Fac. des Sci., Yaounde Univ., Cameroon", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "cellular arrays; combinatorial optimization; computational complexity; Computer Systems, Digital--Parallel Processing; dynamic programming; graph theory; Mathematical Programming, Dynamic; Mathematical Techniques--Graph Theory; parallel algorithms; recurrence relation; theory; two- dimensional systolic arrays; verification", subject = "I.2.8 Computing Methodologies, ARTIFICIAL INTELLIGENCE, Problem Solving, Control Methods, and Search, Dynamic programming \\ G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous", treatment = "T Theoretical or Mathematical", } @Article{Mittal:1988:FBA, author = "Hari Ballabh Mittal", title = "A fast backtrack algorithm for graph isomorphism", journal = j-INFO-PROC-LETT, volume = "29", number = "2", pages = "105--110", day = "30", month = sep, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q20 (05C20 68Q25 68R10)", MRnumber = "89j:68062", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "New Delhi, India", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Sch. of Comput. Syst. Sci., Jawaharlal Nehru Univ., New Delhi, India", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; Backtrack Algorithms; computational complexity; Computer Programming; design; Digraphs; digraphs; directed graphs; Distance Matrices; distance matrices; distance matrix; fast backtrack algorithm; Graph Isomorphism; graph isomorphism; Graph Partitioning; Mathematical Techniques--Graph Theory; recursive procedure; search problems; search tree; theory; trees (mathematics)", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms \\ I.2.8 Computing Methodologies, ARTIFICIAL INTELLIGENCE, Problem Solving, Control Methods, and Search, Backtracking \\ I.2.8 Computing Methodologies, ARTIFICIAL INTELLIGENCE, Problem Solving, Control Methods, and Search, Graph and tree search strategies", treatment = "T Theoretical or Mathematical", } @Article{Ibarra:1988:SSC, author = "Oscar H. Ibarra and Tao Jiang and Bala Ravikumar", title = "Some subclasses of context-free languages in {${\rm NC}^1$}", journal = j-INFO-PROC-LETT, volume = "29", number = "3", pages = "111--117", day = "26", month = oct, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q15 (68Q45)", MRnumber = "89j:68055", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Minneapolis, MN, USA", classification = "721; C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Minnesota Univ., Minneapolis, MN, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "ALOGTIME reductions; Automata Theory; Boolean Circuits; bracketed context free languages; computational complexity; Context Free Languages; context-free languages; deterministic linear context free languages; Dyck Language; languages; Logic Circuits; NC/sup 1/; one-sided Dyck language; parallel algorithms; Structured Context-Free Languages; structured context-free languages; theory; verification", subject = "F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Bounded-action devices \\ F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Classes defined by grammars or automata \\ G.1.0 Mathematics of Computing, NUMERICAL ANALYSIS, General, Parallel algorithms", treatment = "T Theoretical or Mathematical", } @Article{Shannon:1988:LPA, author = "Gregory E. Shannon", title = "A linear-processor algorithm for depth-first search in planar graphs", journal = j-INFO-PROC-LETT, volume = "29", number = "3", pages = "119--123", day = "26", month = oct, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q20 (68Q25 68R10)", MRnumber = "89i:68052", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "West Lafayette, IN, USA", classification = "723; 921; C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Purdue Univ., West Lafayette, IN, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; computational complexity; Computer Programming; cyclic separator; Cyclic Separators; depth-first search; Depth-First Search; linear-processor algorithm; Mathematical Techniques--Graph Theory; Parallel Algorithms; parallel algorithms; parallel RAM algorithm; Parallel Random Access Machines; Planar Graphs; planar graphs; search problems; theory; trees (mathematics)", subject = "G.1.0 Mathematics of Computing, NUMERICAL ANALYSIS, General, Parallel algorithms \\ G.4 Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm analysis \\ I.2.8 Computing Methodologies, ARTIFICIAL INTELLIGENCE, Problem Solving, Control Methods, and Search, Graph and tree search strategies \\ I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms", treatment = "T Theoretical or Mathematical", } @Article{Narendran:1988:PUT, author = "Paliath Narendran and Friedrich Otto", title = "Preperfectness is undecidable for {Thue} systems containing only length-reducing rules and a single commutation rule", journal = j-INFO-PROC-LETT, volume = "29", number = "3", pages = "125--130", day = "26", month = oct, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "03D03 (03D40 68Q50)", MRnumber = "90a:03058", MRreviewer = "John P. Helm", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Schenectady, NY, USA", classification = "723; C4210 (Formal logic)", corpsource = "General Electric Co., Res. and Dev. Center, Schenectady, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Automata Theory--Computability and Decidability; commutation rule; Commutation Rules; Computer Metatheory; Computer Programming Languages; decidability; languages; length-preserving rule; Length-Reducing Rules; length-reducing rules; Partial Commutativity; Preperfectness; rewriting systems; theory; Theory; Thue Systems; Thue systems; undecidable; verification", subject = "F.4.2 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems, Thue systems \\ G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous", treatment = "T Theoretical or Mathematical", } @Article{Vossen:1988:NCF, author = "Gottfried Vossen", title = "A new characterization of {FD} implication with an application to update anomalies", journal = j-INFO-PROC-LETT, volume = "29", number = "3", pages = "131--135", day = "26", month = oct, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68P15", MRnumber = "89i:68023", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "La Jolla, CA, USA", classification = "723; C4250 (Database theory); C6160D (Relational DBMS)", corpsource = "Dept. of Comput. Sci. and Eng., California Univ., San Diego, La Jolla, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Database Systems; database theory; Dynamic Updates; dynamic updates; formal description; Functional Dependencies; functional dependencies; Relational; relational databases; theory; Update Anomalies; update anomalies; Update Normal Form; verification", subject = "H.2.m Information Systems, DATABASE MANAGEMENT, Miscellaneous \\ H.2.1 Information Systems, DATABASE MANAGEMENT, Logical Design, Schema and subschema \\ G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous", treatment = "T Theoretical or Mathematical", } @Article{Bodlaender:1988:CFU, author = "Hans L. Bodlaender", title = "The complexity of finding uniform emulations on fixed graphs", journal = j-INFO-PROC-LETT, volume = "29", number = "3", pages = "137--141", day = "26", month = oct, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (05C99 68R10)", MRnumber = "90e:68044", MRreviewer = "Pavel Tomasta", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Utrecht, Neth", classification = "722; 723; 921; C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Utrecht Univ., Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "complexity; computational complexity; Computer Simulation; Computer Systems, Digital; directed graphs; Fixed Graphs; fixed graphs; graph theory; Mathematical Techniques--Graph Theory; NP-complete; NP-completeness; parallel algorithms; Parallel Processing; Processor Networks; structure-preserving simulations; theory; Uniform Emulations; uniform emulations; verification; virtual machines", subject = "F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism \\ F.1.3 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Reducibility and completeness \\ G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous \\ G.1.0 Mathematics of Computing, NUMERICAL ANALYSIS, General, Parallel algorithms", treatment = "T Theoretical or Mathematical", } @Article{vandenBroek:1988:CIR, author = "P. M. {Van Den Broek}", title = "Confluence of indirection reductions in graph rewrite systems", journal = j-INFO-PROC-LETT, volume = "29", number = "3", pages = "143--148", day = "26", month = oct, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q50 (68R10)", MRnumber = "90a:68053", MRreviewer = "Itsuo Takanami", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Enschede, Neth", classification = "723; 921; C4210 (Formal logic)", corpsource = "Dept. of Comput. Sci., Twente Univ., Enschede, Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Computer Metatheory; Computer Programming Languages; confluence; Confluence Property; equivalence relations; Functional Languages; Graph Rewrite Systems; graph rewrite systems; graph theory; Indirection Graphs; indirection graphs; indirection reductions; languages; Mathematical Techniques--Graph Theory; rewriting systems; theory; Theory; verification", subject = "G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous \\ F.4.2 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems, Parallel rewriting systems", treatment = "T Theoretical or Mathematical", } @Article{Haldar:1988:RBT, author = "S. Haldar and D. K. Subramanian", title = "Ring based termination detection algorithm for distributed computations", journal = j-INFO-PROC-LETT, volume = "29", number = "3", pages = "149--153", day = "26", month = oct, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See comments \cite{Tel:1989:CRB}.", acknowledgement = ack-nhfb, affiliationaddress = "Bangalore, India", classification = "723; C4240 (Programming and algorithm theory); C6150J (Operating systems)", corpsource = "Dept. of Comput. Sci. and Autom., Indian Inst. of Sci., Bangalore, India", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; Computer Programming; Computer Systems, Digital--Distributed; correctness argument; Determination Detection Algorithms; distributed computations; distributed processing; distributed program; Distributed Termination; performance; performance aspects; Process Communication; program verification; protocol; protocols; reliability; ring based termination detection; symmetric algorithm; termination detection; theory; verification", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory \\ G.4 Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm analysis \\ I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms", treatment = "T Theoretical or Mathematical", } @Article{Korel:1988:DPS, author = "Bogdan Korel and Janusz Laski", title = "Dynamic program slicing", journal = j-INFO-PROC-LETT, volume = "29", number = "3", pages = "155--163", day = "26", month = oct, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Detroit, MI, USA", classification = "723; C4240 (Programming and algorithm theory); C6110 (Systems analysis and programming)", corpsource = "Dept. of Comput. Sci., Wayne State Univ., Detroit, MI, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Arrays; Computer Programming; Computer Software--Testing; Data Processing--Data Structures; data structures; debugging; Dynamic Data Structures; dynamic data structures; dynamic program slice; Dynamic Program Slicing; performance; Program Debugging; program debugging; program slicing; programming theory; stad; STAD; theory", subject = "I.2.8 Computing Methodologies, ARTIFICIAL INTELLIGENCE, Problem Solving, Control Methods, and Search, Dynamic programming \\ D.2.5 Software, SOFTWARE ENGINEERING, Testing and Debugging, Debugging aids \\ G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Nawrocki:1988:FBO, author = "Jerzy R. Nawrocki and Andrzej Urbanski", title = "Fixed-sized blocks optimization", journal = j-INFO-PROC-LETT, volume = "29", number = "4", pages = "165--169", day = "12", month = nov, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Poznan, Pol", classification = "723; C6150C (Compilers, interpreters and other processors)", corpsource = "Comput. Centre, Tech. Univ. of Poznan, Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; allocation; compilation; Computer Operating Systems--Storage Allocation; Computer Programming; Computer Programming languages--Pascal; data structures; deallocation; design; Dynamic Storage Allocation; fixed-sized blocks; fixed-sized blocks method; Fixed-Sized Blocks Optimization; languages; optimization procedures; PASCAL-like records; PL/I-like dynamics arrays; program compilers; storage allocation; theory; worst-case storage", subject = "I.2.8 Computing Methodologies, ARTIFICIAL INTELLIGENCE, Problem Solving, Control Methods, and Search, Dynamic programming \\ D.3.3 Software, PROGRAMMING LANGUAGES, Language Constructs \\ E.2 Data, DATA STORAGE REPRESENTATIONS", treatment = "P Practical", } @Article{Bozapalidis:1988:VFS, author = "Symeon Bozapalidis and Stavros Ioulidis", title = "Varieties of formal series on trees and {Eilenberg}'s theorem", journal = j-INFO-PROC-LETT, volume = "29", number = "4", pages = "171--175", day = "12", month = nov, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q45", MRnumber = "90a:68045", MRreviewer = "D. M. Campbell", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Thessaloniki, Greece", classification = "721; 921; C4210 (Formal logic)", corpsource = "Dept. of Math., Aristotle Univ., Thessaloniki, Greece", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Automata Theory; bijection; Eilenberg theorem; Eilenberg's Theorem; epimorphisms; Formal Languages; formal languages; formal series; Formal Series on Trees; languages; Mathematical Techniques--Algebra; monomorphisms; theory; Tree Algebras; tree algebras; trees; trees (mathematics); verification", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees \\ F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Algebraic language theory", treatment = "T Theoretical or Mathematical", } @Article{Cho:1988:CHB, author = "Sang Cho and D{\~u}ng T. H{\`u}ynh", title = "On a complexity hierarchy between {${\rm L}$} and {${\rm NL}$}", journal = j-INFO-PROC-LETT, volume = "29", number = "4", pages = "177--182", day = "12", month = nov, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q15 (03D15)", MRnumber = "89m:68038", MRreviewer = "Marius Zimand", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Richardson, TX, USA", annote = "The original paper has no accents on the second author name, but MathSciNet does. Perhaps the journal typesetting system lacked the needed accents.", classification = "721; 921; C4210 (Formal logic); C4220 (Automata theory)", corpsource = "Comput. Sci. Program, Texas Univ., Richardson, TX, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Automata Theory; automata theory; auxiliary worktapes; Complexity Hierarchy; complexity hierarchy; computational complexity; Formal Languages; formal languages; languages; languages log-space reducible; Mathematical Programming; Nondeterministic Auxiliary Counter Machines; one-way one-turn nondeterministic auxiliary counter machines; theory; Unary 0-1 Knapsack Problem; unary 0-1 knapsack problem; verification", subject = "F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Bounded-action devices \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory \\ F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Alternation and nondeterminism", treatment = "P Practical", } @Article{Ouksel:1988:IDS, author = "Mohamed Ouksel and Peter Scheuermann", title = "Implicit data structures for linear hashing schemes", journal = j-INFO-PROC-LETT, volume = "29", number = "4", pages = "183--189", day = "12", month = nov, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68P10", MRnumber = "90c:68013", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", abstract = "The authors define two implicit data structures and study their relationship to the whole class of hashing functions that are variations of linear hashing. Both of the structures, the linear binary trie and the linear binary search tree, have the common property that their growth emulates the pattern of splittings in linear hashing. The authors show that certain linear hashing schemes based on digital search correspond to a linear binary trie which is maintained completely in implicit fashion. Next, they show how linear hashing can be extended into an order-preserving method that organizes the specific set of records whose directory corresponds to a linear binary search tree. This implicit data structure lends itself to a sequential storage scheme which requires no pointers, thus providing for a compact representation of the directory.", acknowledgement = ack-nhfb, affiliation = "Arizona State Univ", affiliationaddress = "Tempe, AZ, USA", classification = "723; C6120 (File organisation)", corpsource = "Dept. of Comput. Sci., Arizona State Univ., Tempe, AZ, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; compact representation; Data Processing; Data Structures; data structures; digital search; file organisation; hashing functions; Implicit Data Structures; implicit data structures; Linear Binary Search Tree; linear binary search tree; Linear Binary Trie; linear binary trie; Linear Hashing; linear hashing schemes; Mathematical Techniques--Trees; order-preserving method; sequential storage scheme; splittings; theory; verification", subject = "E.2 Data, DATA STORAGE REPRESENTATIONS, Hash-table representations \\ I.2.8 Computing Methodologies, ARTIFICIAL INTELLIGENCE, Problem Solving, Control Methods, and Search, Graph and tree search strategies \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees \\ E.1 Data, DATA STRUCTURES, Trees", treatment = "P Practical", } @Article{Park:1988:EBE, author = "Chan-Ik Park and Kyu Ho Park and Myunghwan Kim", title = "Efficient backward execution in {AND\slash OR} process model", journal = j-INFO-PROC-LETT, volume = "29", number = "4", pages = "191--198", day = "12", month = nov, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Seoul, South Korea", classification = "723; C6110 (Systems analysis and programming); C6170 (Expert systems)", corpsource = "Dept. of Electr. Eng., Korea Adv. Inst. of Sci. and Technol., Seoul, South Korea", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; and/or Process Model; AND/OR process model; backtrack literals; Backward Execution Algorithm; Computer Metatheory--Programming Theory; Computer Programming; Computer Systems, Digital--Parallel Processing; Data Dependency Graph; data dependency graph; literals; Logic Programming; logic programming; logic programs; Mathematical Techniques--Graph Theory; multiple failure situation; Multiple Failures; Nested Loop Model; nested loop model; parallel programming; static analysis; Theory; theory", subject = "I.2.3 Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Logic programming \\ F.4.1 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Logic programming \\ F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism", treatment = "P Practical", } @Article{Leiss:1988:DDT, author = "Ernst L. Leiss", title = "On the degree of dominator trees", journal = j-INFO-PROC-LETT, volume = "29", number = "4", pages = "199--200", day = "12", month = nov, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Houston, TX, USA", classification = "723; 921; C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Houston Univ., TX, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "complexity; Computer Metatheory--Programming Theory; Computer Programming--Theory; Dominator Trees; dominator trees; flowgraph; Flowgraphs; Graph Theory; Mathematical Techniques; Program Complexity Measures; programming theory; theory; trees (mathematics); verification", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees", treatment = "T Theoretical or Mathematical", } @Article{KrusemanAretz:1988:RAP, author = "F. E. J. {Kruseman Aretz}", title = "On a recursive ascent parser", journal = j-INFO-PROC-LETT, volume = "29", number = "4", pages = "201--206", day = "12", month = nov, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Eindhoven, Neth", classification = "721; 723; C4210 (Formal logic); C6150C (Compilers, interpreters and other processors)", corpsource = "Philips Res. Labs., Eindhoven, Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; Automata Theory; Bottom-Up Parsing; bottom-up parsing strategy; Computer Programming--Algorithms; Formal Languages; grammars; mutually recursive procedures; program compilers; recursive ascent parser; Recursive Ascent Parsing Algorithm; recursive functions; Recursive Parsing; reliability; stack alphabet; theory; top-down parsing strategy", subject = "F.4.2 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems, Parsing \\ D.3.4 Software, PROGRAMMING LANGUAGES, Processors, Interpreters", treatment = "P Practical", } @Article{Schreiber:1988:ADS, author = "Fabio A. Schreiber and G. Rosolini", title = "An algebraic description of some state-dependent failure mechanisms", journal = j-INFO-PROC-LETT, volume = "29", number = "4", pages = "207--211", day = "12", month = nov, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Parma, Italy", classification = "723; 921; C5470 (Performance evaluation and testing); C6150J (Operating systems)", corpsource = "Dipartimento di Matematica, Parma Univ., Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algebraic description; algorithms; Computer Software; Computer Systems, Digital--Reliability; failure behaviour; fault tolerant computing; Load Distribution; Mathematical Techniques--Algebra; reliability; Reliability; software reliability; State-Dependent Failure Mechanisms; state-dependent failure mechanisms; theory; transaction processing", subject = "I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms \\ D.2.4 Software, SOFTWARE ENGINEERING, Program Verification, Reliability", treatment = "P Practical", } @Article{Pramanik:1988:HTH, author = "Sakti Pramanik and Myoung Ho Kim", title = "{HCB} tree a height compressed {$B$} tree for parallel processing", journal = j-INFO-PROC-LETT, volume = "29", number = "4", pages = "213--220", day = "12", month = nov, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "East Lansing, MI, USA", classification = "723; 903; 921; C6150J (Operating systems); C6160B (Distributed DBMS)", corpsource = "Dept. of Comput. Sci., Michigan State Univ., East Lansing, MI, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "B Trees; Binary Trees; Computer Systems, Digital--Parallel Processing; data distribution; Data Processing; Data Structures; database machines; distributed databases; HCB tree; height compressed B tree; Information Science--Information Retrieval; Mathematical Techniques--Trees; measurement; parallel disks; parallel processing; parallel programming; performance; storage structure; theory; trees (mathematics)", subject = "E.1 Data, DATA STRUCTURES, Trees \\ F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism \\ G.m Mathematics of Computing, MISCELLANEOUS, Queueing theory \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees", treatment = "P Practical", } @Article{Gallo:1988:PSS, author = "Giorgio Gallo and Maria Grazia Scutell{\`a}", title = "Polynomially solvable satisfiability problems", journal = j-INFO-PROC-LETT, volume = "29", number = "5", pages = "221--227", day = "24", month = nov, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q15 (03B05 03D15 68T15)", MRnumber = "89m:68041", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Pisa, Italy", classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Pisa Univ., Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; Computational Complexity; computational complexity; Computer Metatheory; Computer Programming--Algorithms; Horn Clauses; Horn clauses; HORN-SAT; input size; linear time; NP Completeness; NP-complete; polynomially solvable; polynomially solvable satisfiability problems; propositional formula; propositional letters; Satisfiability; subclasses; theory; verification", subject = "F.2.1 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Computations on polynomials \\ F.4.1 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Logic programming", treatment = "T Theoretical or Mathematical", } @Article{Boom:1988:LVR, author = "H. J. Boom", title = "Lazy variable-renumbering makes substitution cheap", journal = j-INFO-PROC-LETT, volume = "29", number = "5", pages = "229--232", day = "24", month = nov, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q55 (03B40 03B70 68Q25)", MRnumber = "89m:68083", MRreviewer = "David B. Benson", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Montreal, Que, Can", classification = "723; C6120 (File organisation)", corpsource = "Dept. of Comput. Sci., Concordia Univ., Montreal, Que., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "alpha conversion; beta-conversion; Bond Variables; Computer Metatheory--Formal Logic; Computer Programming--Theory; Data Processing; data structure; Data Structures; data structures; formal logic; Lazy Variable Renumbering; lazy variable renumbering; Program Transformation; program transformation; repeated complex substitution; Substitution; Symbol Manipulation; symbol manipulation; theory; Variable Bindings; variable bindings", subject = "F.4.1 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Lambda calculus and related systems \\ E.1 Data, DATA STRUCTURES \\ G.m Mathematics of Computing, MISCELLANEOUS", treatment = "T Theoretical or Mathematical", } @Article{Veroy:1988:OSA, author = "Boris S. Veroy", title = "Optimal search algorithm for a minimum of a discrete periodic bimodal function", journal = j-INFO-PROC-LETT, volume = "29", number = "5", pages = "233--239", day = "24", month = nov, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "90C10 (68Q25 68R10)", MRnumber = "90b:90099", MRreviewer = "Petra Weidner", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See also corrigenda \cite{Veroy:1989:COS}.", acknowledgement = ack-nhfb, affiliationaddress = "Newark, NJ, USA", classification = "723; B6210 (Telecommunication applications); C1180 (Optimisation techniques); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. and Inf. Sci., New Jersey Inst. of Technol., Newark, NJ, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; communication network; computational complexity; Computer Metatheory; Computer Programming; discrete periodic bimodal function; Discrete Periodic Bimodal Functions; experimentation; minimisation; minimum; Optimal Algorithms; optimal search algorithm; optimality; partition analysis; recursive computing; Search Algorithms; search problems; telecommunication networks; theory; verification; Worst Case Complexity", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching \\ C.2.1 Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Architecture and Design \\ G.1.6 Mathematics of Computing, NUMERICAL ANALYSIS, Optimization", treatment = "T Theoretical or Mathematical", } @Article{Schorn:1988:CST, author = "Peter Schorn", title = "A canonical simplifier for trigonometric expressions in the kinematic equation", journal = j-INFO-PROC-LETT, volume = "29", number = "5", pages = "241--246", day = "24", month = nov, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q40", MRnumber = "90c:68040", MRreviewer = "Juris Borzovs", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Chapel Hill, NC, USA", classification = "723; 921; 931; C1110 (Algebra); C4190 (Other numerical methods)", corpsource = "Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algebra; algorithm; algorithms; Canonical Simplifier; canonical simplifier; computational geometry; Computer Programming--Algorithms; function symbols; Kinematic Equation; kinematic equation; Kinematics; kinematics; Mathematical Techniques--Matrix Algebra; normal form; performance; pi; rational multiples; rational numbers; real domain; robot kinematics; Robotics; theory; Trigonometric Expressions; trigonometric expressions; verification", subject = "G.1.3 Mathematics of Computing, NUMERICAL ANALYSIS, Numerical Linear Algebra \\ I.1.1 Computing Methodologies, ALGEBRAIC MANIPULATION, Expressions and Their Representation, Simplification of expressions", treatment = "T Theoretical or Mathematical", } @Article{Ozguner:1988:RAF, author = "F{\"u}sun {\"O}zg{\"u}ner and C. Aykanat", title = "A reconfiguration algorithm for fault tolerance in a hypercube multiprocessor", journal = j-INFO-PROC-LETT, volume = "29", number = "5", pages = "247--254", day = "24", month = nov, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68M15 (68Q10)", MRnumber = "90b:68004", MRreviewer = "Ian Parberry", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Columbus, OH, USA", classification = "723; 921; C4230 (Switching theory); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Electr. Eng., Ohio State Univ., Columbus, OH, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; Computer Fault Tolerance; Computer Programming; Computer Systems, Digital--Parallel Processing; fault tolerance; fault tolerant computing; fault-free subcube; hypercube multiprocessor; Hypercube Multiprocessors; Mathematical Techniques--Combinatorial Mathematics; maximum dimension; multiprocessor interconnection networks; Parallel Algorithms; parallel algorithms; reconfiguration algorithm; Reconfiguration Algorithms; theory; verification", subject = "F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism \\ G.1.0 Mathematics of Computing, NUMERICAL ANALYSIS, General, Parallel algorithms \\ G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous", treatment = "T Theoretical or Mathematical", } @Article{Chrobak:1988:NRS, author = "Marek Chrobak and Richard Harter", title = "A note on random sampling", journal = j-INFO-PROC-LETT, volume = "29", number = "5", pages = "255--256", day = "24", month = nov, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q20 (62-04 68Q25)", MRnumber = "89m:68047", MRreviewer = "A. D. Booth", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Riverside, CA, USA", classification = "723; 922; C4240 (Programming and algorithm theory)", corpsource = "Dept. of Math. and Comput. Sci., California Univ., Riverside, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm theory; algorithms; Computer Programming--Algorithms; Exchange Algorithm; positive integers; Probability--Random Processes; Random Sampling; random sampling; Sampling; theory; verification", subject = "G.3 Mathematics of Computing, PROBABILITY AND STATISTICS", treatment = "T Theoretical or Mathematical", } @Article{McCune:1988:SCS, author = "William W. McCune", title = "{Un-Skolemizing} clause sets", journal = j-INFO-PROC-LETT, volume = "29", number = "5", pages = "257--263", day = "24", month = nov, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68T15 (03B35)", MRnumber = "89k:68133", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Argonne, IL, USA", classification = "723; C1160 (Combinatorial mathematics); C4210 (Formal logic)", corpsource = "Div. of Math. and Comput. Sci., Argonne Nat. Lab., IL, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm; Automata Theory--Theorem Proving; Automated Theorem Proving; Clause Languages; closed formula; Computer Metatheory; Computer Programming--Algorithms; constant symbols; existentially quantified variables; expressions; First-Order Logic; formal logic; function symbols; quantified formula; Satisfiability; set theory; Skolemization; theory; un-Skolemization clause sets; unsatisfiable; verification", subject = "F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Classes defined by grammars or automata \\ I.2.3 Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving", treatment = "T Theoretical or Mathematical", } @Article{Sharir:1988:SWR, author = "Micha Sharir", title = "The shortest watchtower and related problems for polyhedral terrains", journal = j-INFO-PROC-LETT, volume = "29", number = "5", pages = "265--270", day = "24", month = nov, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68U05 (90C99)", MRnumber = "90f:68171", MRreviewer = "Franz Aurenhammer", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "New York, NY, USA", classification = "723; 921; C1160 (Combinatorial mathematics); C4190 (Other numerical methods); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., New York Univ., NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm; algorithms; Algorithms; Combinatorial Complexity; combinatorial complexity; computational complexity; computational geometry; Computer Programming; convex; faces; lower envelope; Mathematical Techniques--Combinatorial Mathematics; output envelope; Polyhedral Terrains; polyhedral terrains; shortest vertical segment; shortest watchtower; Shortest Watchtower Problem; theory; top endpoint", subject = "G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations", treatment = "T Theoretical or Mathematical", } @Article{dAtri:1988:HAG, author = "Alessandro d'Atri and Marina Moscarini", title = "On hypergraph acyclicity and graph chordality", journal = j-INFO-PROC-LETT, volume = "29", number = "5", pages = "271--274", day = "24", month = nov, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68P15 (05C65 05C75 68R10)", MRnumber = "89m:68022", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Rome, Italy", classification = "723; 921; C1160 (Combinatorial mathematics); C4250 (Database theory); C6160D (Relational DBMS)", corpsource = "Dipartimento di Inf. e Sistemistica, Rome Univ., Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Acyclic Hypergraphs; Chordal Graphs; Database Systems--Relational; database theory; design; graph chordality; Graph Theory; graph theory; hypergraph acyclicity; Mathematical Techniques; Relational Database Theory; relational database theory; relational databases; theory; verification", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory \\ H.2.m Information Systems, DATABASE MANAGEMENT, Miscellaneous", treatment = "T Theoretical or Mathematical", } @Article{Dublish:1988:AFM, author = "Pratul Dublish", title = "An {$O(n^3)$} algorithm for finding the minimal opaque forest of a convex polygon", journal = j-INFO-PROC-LETT, volume = "29", number = "5", pages = "275--276", day = "24", month = nov, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68U05 (68Q25)", MRnumber = "90a:68079", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Kanpur, India", classification = "723; 921; C1160 (Combinatorial mathematics); C4190 (Other numerical methods); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci. and Eng., Indian Inst. of Technol., Kanpur, India", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Akman; algorithm; Algorithms; algorithms; computational complexity; Computational Geometry; computational geometry; Computer Programming; convex polygon; Convex Polygons; Mathematical Techniques--Geometry; Minimal Opaque Forest; minimal opaque forest; theory", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations", treatment = "T Theoretical or Mathematical", } @Article{Majster-Cederbaum:1988:UFP, author = "Mila E. Majster-Cederbaum", title = "On the uniqueness of fixed points of endofunctors in a category of complete metric spaces", journal = j-INFO-PROC-LETT, volume = "29", number = "6", pages = "277--281", day = "8", month = dec, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q55 (54H25)", MRnumber = "90b:68062", MRreviewer = "Stephen L. Bloom", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Mannheim, West Ger", classification = "723; C1160 (Combinatorial mathematics); C4210 (Formal logic)", corpsource = "Mannheim Univ., West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Complete Metric Spaces; complete metric spaces; Computer Metatheory; Computer Programming Languages; Concurrency; contracting functor; Endofunctors; endofunctors; existence proof; fixed points; formal languages; hom-contractiveness; languages; measurement; minimal fixed point; Synchronization; Theory; theory; topology; uniqueness; Uniqueness of Fixed Points; verification", subject = "D.3.1 Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory, Semantics \\ D.4.1 Software, OPERATING SYSTEMS, Process Management, Synchronization \\ D.4.1 Software, OPERATING SYSTEMS, Process Management, Concurrency \\ G.m Mathematics of Computing, MISCELLANEOUS", treatment = "T Theoretical or Mathematical", } @Article{Waxman:1988:WCP, author = "Bernard M. Waxman and Makoto Imase", title = "Worst-case performance of {Rayward-Smith}'s {Steiner} tree heuristic", journal = j-INFO-PROC-LETT, volume = "29", number = "6", pages = "283--287", day = "8", month = dec, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (68R10)", MRnumber = "89k:68073", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "St. Louis, MO, USA", classification = "723; 921; C1160 (Combinatorial mathematics); C4130 (Interpolation and function approximation); C4240 (Programming and algorithm theory)", corpsource = "Comput. and Commun. Res. Center, Washington Univ., St. Louis, MO, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; Approximation Algorithms; approximation theory; best bound; computational complexity; Computer Metatheory; Computer Programming; Mathematical Techniques--Trees; NP Completeness; performance; Rayward-Smith; Steiner tree approximation algorithm; Steiner Tree Approximation Algorithm; Steiner tree heuristic; theory; trees (mathematics); verification; worst-case performance; Worst-Case Performance", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees \\ G.1.2 Mathematics of Computing, NUMERICAL ANALYSIS, Approximation", treatment = "T Theoretical or Mathematical", } @Article{Olariu:1988:UCP, author = "Stephan Olariu", title = "On the unimodality of convex polygons", journal = j-INFO-PROC-LETT, volume = "29", number = "6", pages = "289--292", day = "8", month = dec, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68U05", MRnumber = "90b:68103", MRreviewer = "Peter Gritzmann", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Montreal, Que, Can", classification = "723; 921; C1160 (Combinatorial mathematics); C4190 (Other numerical methods)", corpsource = "Sch. of Comput. Sci., McGill Univ., Montreal, Que., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; Computational Geometry; computational geometry; Computer Programming; convex hexagons; Convex Polygons; convex polygons; Mathematical Techniques--Geometry; theory; Toussaint; unimodal vertices; Unimodality; unimodality; verification", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations", treatment = "T Theoretical or Mathematical", } @Article{Morgan:1988:AVD, author = "Carroll Morgan", title = "Auxiliary variables in data refinement", journal = j-INFO-PROC-LETT, volume = "29", number = "6", pages = "293--296", day = "8", month = dec, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68N05", MRnumber = "89k:68010", MRreviewer = "K. H. V. Booth", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Oxford, Engl", classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Comput. Lab., Oxford Univ., UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "assignments; Auxiliary Variables; auxiliary variables; Computer Metatheory--Programming Theory; Computer Programming; Data Refinement; data refinement; indirect technique; local variables; members; Program Transformation; programming theory; theory; Theory; verification", subject = "F.3.3 Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs \\ I.2.2 Computing Methodologies, ARTIFICIAL INTELLIGENCE, Automatic Programming, Program transformation", treatment = "T Theoretical or Mathematical", } @Article{Guessarian:1988:MNO, author = "Ir{\`e}ne Guessarian and Lutz Priese", title = "On the minimal number of $\times$ operators to model regularity in fair {SCCS}", journal = j-INFO-PROC-LETT, volume = "29", number = "6", pages = "297--300", day = "8", month = dec, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q10", MRnumber = "90b:68025", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Paris, Fr", classification = "721; C4210 (Formal logic); C4220 (Automata theory)", corpsource = "CNRS-LITP, Paris VII Univ., France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "* operators; Automata Theory; epsilon-free omega-regular language; fair computations; fair SCCS; Fairness; finite automata; formal languages; languages; minimal number; parallel product; regularity; sccs; sequential SCCS processes; strict SCCS process; strictly fair language; strongly; synchronous product operator; Synchronous Product Operators; theory; transition-fair languages; verification; weakly", subject = "F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Algebraic language theory \\ F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Classes defined by grammars or automata \\ F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Automata \\ F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, SCCS", treatment = "T Theoretical or Mathematical", } @Article{Lamb:1988:BSE, author = "David Alex Lamb", title = "Benign side effects", journal = j-INFO-PROC-LETT, volume = "29", number = "6", pages = "301--305", day = "8", month = dec, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Kingston, Ont, Can", classification = "723; C6110B (Software engineering techniques); C6140D (High level languages)", corpsource = "Dept. of Comput. and Inf. Sci., Queen's Univ., Kingston, Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; Benign Side Effects; benign side effects; Computer Programming Languages; Computer Programming--Program Debugging; Computer Software; debugging; design; Design; high level languages; interface; invisible; module; performance; performance monitoring; programming; programming language design; reliability; software engineering; theory; Trace Specifications; trace specifications; verification", subject = "D.2.4 Software, SOFTWARE ENGINEERING, Program Verification \\ D.3.3 Software, PROGRAMMING LANGUAGES, Language Constructs, Procedures, functions, and subroutines \\ D.2.5 Software, SOFTWARE ENGINEERING, Testing and Debugging", treatment = "P Practical", } @Article{Shankar:1988:EPC, author = "Narayan Shankar and Vijaya Ramachandran", title = "Efficient parallel circuits and algorithms for division", journal = j-INFO-PROC-LETT, volume = "29", number = "6", pages = "307--313", day = "8", month = dec, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Urbana, IL, USA", classification = "721; 723; C4240 (Programming and algorithm theory)", corpsource = "Coordinated Sci. Lab., Illinois Univ., Urbana, IL, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; asymptotically small size; bit operations; computational complexity; Computer Programming--Algorithms; Computer Systems, Digital--Parallel Processing; Computers, Digital; depth; design; Dividing Circuits; division; efficient parallel algorithms; efficient parallel circuits; efficient PRAM algorithms; exclusive memory writes; logspace uniform family; n-bit number; n-bit result; parallel algorithm; Parallel Algorithms; parallel algorithms; Parallel Circuits; Parallel Random Access Machines; polynomial-time uniform family; shared memory machine; Size Bounds; theory", subject = "B.7.1 Hardware, INTEGRATED CIRCUITS, Types and Design Styles, Memory technologies \\ B.7.1 Hardware, INTEGRATED CIRCUITS, Types and Design Styles, Advanced technologies \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Path and circuit problems", treatment = "T Theoretical or Mathematical", } @Article{Moriya:1988:CPP, author = "Tetsuo Moriya", title = "Closure property of principal cones under substitution", journal = j-INFO-PROC-LETT, volume = "29", number = "6", pages = "315--317", day = "8", month = dec, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q45", MRnumber = "89k:68085", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Tokyo, Jpn", classification = "721; C4210 (Formal logic)", corpsource = "Center for Inf. Sci., Kokushikan Univ., Tokyo, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Automata Theory; Closure Property; closure property; Cone Generators; cone generators; design; Formal Languages; formal languages; languages; Principal Cones; principal cones; Syntactic Substitution; syntactic substitution; theory; verification", subject = "F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Algebraic language theory \\ F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Classes defined by grammars or automata \\ G.m Mathematics of Computing, MISCELLANEOUS", treatment = "T Theoretical or Mathematical", } @Article{Veroy:1988:ACD, author = "Boris S. Veroy", title = "Average complexity of divide-and-conquer algorithms", journal = j-INFO-PROC-LETT, volume = "29", number = "6", pages = "319--326", day = "8", month = dec, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25", MRnumber = "89m:68068", MRreviewer = "Johan H{\aa}stad", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See also corrigenda \cite{Veroy:1989:CAC}.", acknowledgement = ack-nhfb, affiliationaddress = "Newark, NJ, USA", classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. and Inf. Sci., New Jersey Inst. of Technol., Newark, NJ, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm theory; algorithms; Algorithms; Average Computational Complexity; average computational complexity; computational complexity; Computer Metatheory; Computer Programming; Divide-And-Conquer Algorithms; divide-and-conquer algorithms; lower bounds; theory; upper bounds; verification; Worst-Case Computational Complexity", subject = "I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms \\ F.1.3 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes \\ G.m Mathematics of Computing, MISCELLANEOUS", treatment = "T Theoretical or Mathematical", } @Article{Hagerup:1988:SSP, author = "Torben Hagerup", title = "On saving space in parallel computation", journal = j-INFO-PROC-LETT, volume = "29", number = "6", pages = "327--329", day = "8", month = dec, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q10", MRnumber = "89k:68043", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Saarbr{\"u}cken, West Ger", classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Fachbereich Inf., Univ. des Saarlandes, Saarbrucken, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; Computer Programming; Computer Systems, Digital--Parallel Processing; Concurrent-Read Concurrent-Write pram; CRCW PRAM; CRCW PRAM model of computation; Parallel Algorithms; parallel algorithms; parallel computation; parallel computing; Parallel Random Access Machines; space requirements; space saving; theory; verification", subject = "F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism \\ G.1.0 Mathematics of Computing, NUMERICAL ANALYSIS, General, Condition (and ill-condition) \\ B.7.1 Hardware, INTEGRATED CIRCUITS, Types and Design Styles, Memory technologies", treatment = "T Theoretical or Mathematical", } @Article{Foster:1989:LBA, author = "M. J. Foster and Ronald I. Greenberg", title = "Lower bounds on the area of finite-state machines", journal = j-INFO-PROC-LETT, volume = "30", number = "1", pages = "1--7", day = "16", month = jan, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q35 (68Q25)", MRnumber = "89m:68069", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "New York, NY, USA", classification = "721; B1130B (Computer-aided circuit analysis and design); C4220 (Automata theory); C7410D (Electronic engineering)", corpsource = "Dept. of Comput. Sci., Columbia Univ., New York, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; Automata Theory; circuit layout CAD; Computer Programming--Algorithms; Custom VLSI; design; deterministic finite-state machine; Finite Automata; finite automata; Finite State Machines; finite-state machines; fixed alphabets; Integrated Circuits, VLSI--computer Aided Design; layout algorithm; Layout Algorithms; Lower Bounds; silicon compilers; symbols; theory; verification; VLSI", subject = "B.7.1 Hardware, INTEGRATED CIRCUITS, Types and Design Styles, VLSI (very large scale integration) \\ B.7.2 Hardware, INTEGRATED CIRCUITS, Design Aids, Layout \\ F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Automata", treatment = "T Theoretical or Mathematical", } @Article{Salowe:1989:IIS, author = "Jeffrey S. Salowe", title = "{$L$}-infinity interdistance selection by parametric search", journal = j-INFO-PROC-LETT, volume = "30", number = "1", pages = "9--14", day = "16", month = jan, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68U05 (68Q25)", MRnumber = "89m:68137", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Charlottesville, VA, USA", classification = "723; 921; C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Virginia Univ., Charlottesville, VA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; Cartesian sum; computational geometry; Computational Geometry; Computer Programming; geometry; interdistance selection; Mathematical Techniques--Geometry; Multidimensional Interdistance Selection; multidimensional interdistance selection problem; parametric search; Parametric Search; ranking problem; running time; search problems; selection problem; Selection Problem; sublinear-time selection; theory", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations \\ G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching", treatment = "T Theoretical or Mathematical", } @Article{Roth:1989:NWC, author = "Peter Roth", title = "A note on word chains and regular languages", journal = j-INFO-PROC-LETT, volume = "30", number = "1", pages = "15--18", day = "16", month = jan, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q45", MRnumber = "89m:68079", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Frankfurt am Main, West Ger", classification = "721; C4210 (Formal logic)", corpsource = "Johann Wolfgang Goethe-Univ., Fachbereich Inf., Frankfurt am Main, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Automata Theory; computability; Formal Languages; formal languages; languages; Regular Languages; regular languages; theory; two-letter alphabets; verification; Word Chains; word chains", subject = "F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Algebraic language theory", treatment = "T Theoretical or Mathematical", } @Article{Darondeau:1989:BE, author = "Ph. Darondeau", title = "Bisimulation and effectiveness", journal = j-INFO-PROC-LETT, volume = "30", number = "1", pages = "19--20", day = "16", month = jan, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q10 (68Q90)", MRnumber = "89m:68033", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Rennes, Fr", classification = "723; C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "IRISA, Rennes, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Bisimulation; computability; Computer Metatheory; concurrency; effective transition system; effectiveness; greatest bisimulation equivalence; parallel algorithms; quotient; recursive functions; theory; Transition Systems", subject = "G.m Mathematics of Computing, MISCELLANEOUS", treatment = "T Theoretical or Mathematical", } @Article{Sandhu:1989:RTH, author = "Ravinderpal Singh Sandhu", title = "The reflected tree hierarchy for protection and sharing", journal = j-INFO-PROC-LETT, volume = "30", number = "1", pages = "21--26", day = "16", month = jan, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68N25 (05C05 68R10)", MRnumber = "89m:68011", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Columbus, OH, USA", classification = "723; 921; C6120 (File organisation); C6130 (Data handling techniques)", corpsource = "Dept. of Comput. and Inf. Sci., Ohio State Univ., Columbus, OH, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Access Control; Computer Metatheory; Computer Systems, Digital--Time Sharing; efficient representation; file organisation; Information Sharing; leaves; Mathematical Techniques; mirror image; protection; protection groups; Reflected Tree Hierarchy; reflected tree hierarchy; Resource Sharing; rooted tree; security of data; shared resources; sharing; theory; Trees; trees (mathematics); verification", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees \\ F.1.3 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Complexity hierarchies \\ D.4.6 Software, OPERATING SYSTEMS, Security and Protection, Access controls", treatment = "P Practical", } @Article{Lingas:1989:SIN, author = "Andrzej Lingas and Marek Karpi{\'n}ski", title = "Subtree isomorphism is {NC} reducible to bipartite perfect matching", journal = j-INFO-PROC-LETT, volume = "30", number = "1", pages = "27--32", day = "16", month = jan, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68R10 (05C05 68Q25)", MRnumber = "89k:68120", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Linkoping, Swed", classification = "921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of comput. and Inf. Sci., Linkoping Univ., Sweden", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; Bipartite Graphs; bipartite perfect matching; Computer Programming--Algorithms; Mathematical Techniques; NC reducible; NC Reduction; parallel algorithms; Perfect Matching; PRAM; random NC/sup 3/; Subgraph Isomorphism; Subtree Isomorphism; subtree isomorphism; theory; Trees; trees (mathematics); verification", subject = "G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous \\ I.2.8 Computing Methodologies, ARTIFICIAL INTELLIGENCE, Problem Solving, Control Methods, and Search, Graph and tree search strategies", treatment = "T Theoretical or Mathematical", } @Article{Chakrabarti:1989:ISEa, author = "P. P. Chakrabarti and S. Ghose and A. Pandey and S. C. {De Sarkar}", title = "Increasing search efficiency using multiple heuristics", journal = j-INFO-PROC-LETT, volume = "30", number = "1", pages = "33--36", day = "16", month = jan, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Kharagpur, India", classification = "723; C1230 (Artificial intelligence); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci. and Eng., Indian Inst. of Technol., Kharagpur, India", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "admissibility; AI; algorithm theory; algorithms; Algorithms; Artificial Intelligence; artificial intelligence; Computer Programming; efficiency; Eight Puzzle Problem; experimentation; Heuristic Algorithms; Mathematical Techniques--Heuristic; measurement; Multiple Heuristics; multiple heuristics; performance; Search Algorithms; search efficiency; search problems; theory; verification", subject = "I.2.8 Computing Methodologies, ARTIFICIAL INTELLIGENCE, Problem Solving, Control Methods, and Search, Heuristic methods \\ I.2.8 Computing Methodologies, ARTIFICIAL INTELLIGENCE, Problem Solving, Control Methods, and Search, Graph and tree search strategies", treatment = "T Theoretical or Mathematical", } @Article{Turan:1989:LBS, author = "Gy{\"o}rgy Tur{\'a}n", title = "Lower bounds for synchronous circuits and planar circuits", journal = j-INFO-PROC-LETT, volume = "30", number = "1", pages = "37--40", day = "16", month = jan, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q15 (68Q25 94C10)", MRnumber = "90f:68064", MRreviewer = "Jaroslav Ne{\v{s}}et{\v{r}}il", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Szeged, Hung", classification = "721; 723; C4230 (Switching theory)", corpsource = "Hungarian Acad. of Sci., Szeged, Hungary", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Boolean Circuits; Boolean Complexity; Boolean Functions; Boolean functions; circuit complexity; computational complexity; Computer Metatheory; Logic Circuits--Theory; Lower Bounds; one-output Boolean functions; planar circuit complexity; Planar Circuits; planar circuits; switching theory; synchronous circuit complexity; Synchronous Circuits; synchronous circuits; theory; verification", subject = "F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Unbounded-action devices \\ F.1.3 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes \\ G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous", treatment = "T Theoretical or Mathematical", } @Article{Galil:1989:PED, author = "Zvi Galil and Victor Pan", title = "Parallel evaluation of the determinant and of the inverse of a matrix", journal = j-INFO-PROC-LETT, volume = "30", number = "1", pages = "41--45", day = "16", month = jan, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "65F05 (65W05 68Q25)", MRnumber = "90a:65056", MRreviewer = "Bruno Codenotti", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "New York, NY, USA", classification = "723; 921; C4140 (Linear algebra); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Columbia Univ., New York, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; Arithmetic Algorithms; Boolean cost; characteristic polynomial; Computational Complexity; computational complexity; Computer Programming; Computer Systems, Digital--Parallel Processing; det A; determinant; Determinants; integer input matrix; inverse; Mathematical Techniques--Matrix Algebra; matrix; matrix algebra; Matrix Inversion; Parallel Algorithms; parallel algorithms; parallel arithmetic algorithms; polynomials; randomized parallel algorithm; rationals; theory; verification", subject = "G.1.0 Mathematics of Computing, NUMERICAL ANALYSIS, General, Parallel algorithms \\ G.1.3 Mathematics of Computing, NUMERICAL ANALYSIS, Numerical Linear Algebra, Matrix inversion \\ G.1.5 Mathematics of Computing, NUMERICAL ANALYSIS, Roots of Nonlinear Equations, Polynomials, methods for", treatment = "T Theoretical or Mathematical", } @Article{Gereb-Graus:1989:TNC, author = "Mih{\'a}ly Ger{\'e}b-Graus and Ramamohan Paturi and Endre Szemer{\'e}di", title = "There are no $p$-complete families of symmetric {Boolean} functions", journal = j-INFO-PROC-LETT, volume = "30", number = "1", pages = "47--49", day = "16", month = jan, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q15 (03G05 06E30 68R05)", MRnumber = "90h:68051", MRreviewer = "Norbert Blum", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Chicago, IL, USA", classification = "723; C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Math., Stat. and Comput. Sci., Illinois Univ., Chicago, IL, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Boolean Functions; Boolean functions; completeness; complexity theory; computational complexity; Computer Metatheory; p Complete Families; p-complete families; Symmetric Boolean Functions; symmetric Boolean functions; theory; verification", subject = "F.1.3 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Reducibility and completeness", treatment = "T Theoretical or Mathematical", } @Article{Hehner:1989:RP, author = "Eric C. R. Hehner", title = "Real-time programming", journal = j-INFO-PROC-LETT, volume = "30", number = "1", pages = "51--56", day = "16", month = jan, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Toronto, Ont, Can", classification = "723; C4240 (Programming and algorithm theory); C6110 (Systems analysis and programming)", corpsource = "Dept. of Comput. Sci., Toronto Univ., Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Buffering; Communication Primitives; communication primitives; Computer Metatheory--Programming Theory; Computer Programming; CSP; design; Formal Semantics; formal semantics; interactive programming; programming theory; Real Time Programming; real-time programming; real-time systems; theory; Theory; Time Complexity", subject = "D.1.m Software, PROGRAMMING TECHNIQUES, Miscellaneous \\ C.3 Computer Systems Organization, SPECIAL-PURPOSE AND APPLICATION-BASED SYSTEMS, Real-time systems", treatment = "T Theoretical or Mathematical", } @Article{Fleischer:1989:CCM, author = "Rudolf Fleischer", title = "Communication complexity of multi-processor systems", journal = j-INFO-PROC-LETT, volume = "30", number = "2", pages = "57--65", day = "30", month = jan, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25", MRnumber = "90i:68047", MRreviewer = "A. V. An\={\i}s\={\i}mov", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Saarbr{\"u}cken, West Ger", classification = "722; 723; C4240 (Programming and algorithm theory); C5440 (Multiprocessor systems and techniques); C5620 (Computer networks and techniques)", corpsource = "Saarbrucken Univ., West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "common bus; Communication Complexity; communication complexity; computational complexity; Computer Metatheory; Computer Systems, Digital; Computers, Digital--Data Communication Systems; design; Deterministic Complexity; deterministic complexity; distributed processing; Las Vegas; lower bound; multi-processor systems; Multiprocessing; multiprocessing systems; multiprocessors; Nondeterministic Complexity; nondeterministic complexity; protocols; standardization; theory; verification", subject = "C.1.2 Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors) \\ C.4 Computer Systems Organization, PERFORMANCE OF SYSTEMS \\ C.2.2 Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Protocols \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Network problems", treatment = "T Theoretical or Mathematical", } @Article{Wong:1989:NAC, author = "Wing Shing Wong and Robert J. T. Morris", title = "A new approach to choosing initial points in local search", journal = j-INFO-PROC-LETT, volume = "30", number = "2", pages = "67--72", day = "30", month = jan, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "90C27", MRnumber = "90a:90162", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Holmdel, NJ, USA", classification = "723; 921; C1160 (Combinatorial mathematics); C1180 (Optimisation techniques); C4240 (Programming and algorithm theory)", corpsource = "AT and T Bell Labs., Holmdel, NJ, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; arbitrary partitioning; combinatorial mathematics; Combinatorial Optimization; computational complexity; Computer Programming; experimentation; global combinatorial optimization; Global Optimization; initial points; Local Search; local search; Multistart Methods; optimisation; Optimization; performance; Search Algorithms; search operators; search problems; search space; state space; systematic initial point procedure; theory; u-spheres; verification", subject = "G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching", treatment = "T Theoretical or Mathematical", } @Article{Kim:1989:MDC, author = "June Hyoung Kim and Kyu Ho Park and Myunghwan Kim", title = "A model of distributed control: dependency and uncertainty", journal = j-INFO-PROC-LETT, volume = "30", number = "2", pages = "73--77", day = "30", month = jan, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68N25 (68M10)", MRnumber = "90k:68016", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Seoul, South Korea", classification = "722; 723; 731; C5620 (Computer networks and techniques); C6150J (Operating systems)", corpsource = "Dept. of Electr. Eng., Korea Adv. Inst. of Sci. and Technol., Seoul, South Korea", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; communication overhead; Computer Systems, Digital; Control Systems; Cooperating Processes; cooperating processes; dependency; Distributed; distributed control; distributed processing; Local Consistency Constraints; operating systems; operating systems (computers); scheduling; state information; theory; uncertainty; Weak Copy Consistency Constraints; weak copy consistency constraints", subject = "H.2.4 Information Systems, DATABASE MANAGEMENT, Systems, Distributed systems \\ D.4.7 Software, OPERATING SYSTEMS, Organization and Design, Distributed systems \\ G.m Mathematics of Computing, MISCELLANEOUS", treatment = "T Theoretical or Mathematical", } @Article{Consel:1989:PEP, author = "Charles Consel and Olivier Danvy", title = "Partial evaluation of pattern matching in strings", journal = j-INFO-PROC-LETT, volume = "30", number = "2", pages = "79--86", day = "30", month = jan, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Paris, Fr", classification = "721; 723; C4220 (Automata theory); C4240 (Programming and algorithm theory); C6130 (Data handling techniques); C6150C (Compilers, interpreters and other processors)", corpsource = "Paris VI Univ., France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; Automata Theory--Finite Automata; compilers; Computer Programming; data handling; deterministic automata; Deterministic Finite Automata; deterministic finite automaton; finite automata; Knuth-Morris-Pratt Algorithm; languages; Partial Evaluation; partial evaluation; pattern matcher; Pattern Matching; pattern matching; program compilers; programming theory; strings; theory", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Pattern matching \\ D.3.3 Software, PROGRAMMING LANGUAGES, Language Constructs, Data types and structures", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Shonkwiler:1989:IAC, author = "R. Shonkwiler", title = "An image algorithm for computing the {Hausdorff} distance efficiently in linear time", journal = j-INFO-PROC-LETT, volume = "30", number = "2", pages = "87--89", day = "30", month = jan, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68U05", MRnumber = "90c:68079", MRreviewer = "Ivan Stojmenovi{\'c}", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Atlanta, GA, USA", classification = "723; C4240 (Programming and algorithm theory); C6130B (Graphics techniques)", corpsource = "Sch. of Mathe., Georgia Inst. of Technol., Atlanta, GA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; breadth-first search; computational complexity; Computational Geometry; computational geometry; Computer Graphics; computer graphics; Computer Programming; distance table; Hausdorff distance; Hausdorff Distance Algorithm; image algorithm; Image Algorithms; linear time; measurement; metric; metric space; parallel algorithms; search problems; theory", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations \\ G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous \\ I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms", treatment = "T Theoretical or Mathematical", } @Article{Mihail:1989:CAP, author = "Milena Mihail", title = "On coupling and the approximation of the permanent", journal = j-INFO-PROC-LETT, volume = "30", number = "2", pages = "91--95", day = "30", month = jan, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (15A15 65F99)", MRnumber = "90k:68071", MRreviewer = "Brian Conolly", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Cambridge, MA, USA", classification = "921; 922; C1110 (Algebra); C1140Z (Other and miscellaneous); C4240 (Programming and algorithm theory)", corpsource = "Aiken Comput. Lab., Harvard Univ., Cambridge, MA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; computational complexity; coupling technique; Coupling Techniques; Markov Chains; Markov chains; Markov processes; Mathematical Techniques; Matrix Algebra; matrix algebra; nontrivial bound; permanent; Permanents of Matrices; Probability--Random Processes; programming theory; theory; variation distance", subject = "G.1.2 Mathematics of Computing, NUMERICAL ANALYSIS, Approximation \\ F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Probabilistic computation", treatment = "T Theoretical or Mathematical", } @Article{Martel:1989:FPQ, author = "Charles U. Martel and Dan Gusfield", title = "A fast parallel quicksort algorithm", journal = j-INFO-PROC-LETT, volume = "30", number = "2", pages = "97--102", day = "30", month = jan, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68P10 (68Q25)", MRnumber = "89k:68026", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Davis, CA, USA", classification = "723; C4240 (Programming and algorithm theory); C6130 (Data handling techniques)", corpsource = "Div. of Comput. Sci., California Univ., Davis, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; computational complexity; Computer Programming--Algorithms; Computer Systems Programming; Computer Systems, Digital--Multiprocessing; Concurrent Read Concurrent Write; concurrent-read concurrent- write; CRCW; Fast Parallel Quicksort; Parallel Algorithms; parallel algorithms; parallel quicksort algorithm; shared memory computer; Shared Memory Computers; Sorting; sorting; theory", subject = "G.1.0 Mathematics of Computing, NUMERICAL ANALYSIS, General, Parallel algorithms \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching \\ F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism", treatment = "T Theoretical or Mathematical", } @Article{vanEmdeBoas:1989:SMS, author = "Peter {Van Emde Boas}", title = "Space measures for storage modification machines", journal = j-INFO-PROC-LETT, volume = "30", number = "2", pages = "103--110", day = "30", month = jan, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q05 (68Q15)", MRnumber = "89m:68028", MRreviewer = "M. Dal Cin", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Amsterdam, Neth", classification = "721; 723; C1160 (Combinatorial mathematics); C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Math. and Comput. Sci., Amsterdam Univ., Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Automata Theory; Complexity Theory; complexity theory; computational complexity; Computer Metatheory; graph theory; Kolmogorov-Uspenskii machine; logarithmic space measure; machine models; measurement; pointer based models; pointer machines; polynomial time overhead simulations; RAM; Random Access Machines; random access machines; random-access storage; space complexity; Space Measures; Storage Modification Machines; storage modification machines; theory; time complexity; Turing machine space; Turing Machines; Turing machines; uniform space measure; verification", subject = "F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation \\ F.1.3 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Relations among complexity measures", treatment = "T Theoretical or Mathematical", } @Article{Itoh:1989:EAD, author = "Toshiya Itoh and Shigeo Tsujii", title = "An efficient algorithm for deciding quadratic residuosity in finite fields {${\rm GF}(p^m)$}", journal = j-INFO-PROC-LETT, volume = "30", number = "3", pages = "111--114", day = "13", month = feb, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "11Y16 (68Q40)", MRnumber = "90b:11142", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Tokyo Inst of Technology", affiliationaddress = "Tokyo, Jpn", classification = "723; C1110 (Algebra); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Electr. and Electro. Eng., Tokyo Inst. of Technol., Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; computational complexity; Computer Programming; efficient algorithm; Euler; Euler's Criterion; Finite Fields; finite fields; Galois Fields; Jacobi; Jacobi's Symbol; Legendre; Legendre's Symbol; matrices; matrix algebra; matrix operations; quadratic residuosity; theory; verification", subject = "G.1.4 Mathematics of Computing, NUMERICAL ANALYSIS, Quadrature and Numerical Differentiation", treatment = "T Theoretical or Mathematical", } @Article{Jokinen:1989:CGC, author = "Matti O. Jokinen", title = "Customizable garbage collectors", journal = j-INFO-PROC-LETT, volume = "30", number = "3", pages = "115--118", day = "13", month = feb, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Univ of Turku", affiliationaddress = "Turku, Finl", classification = "723; C6120 (File organisation)", corpsource = "Dept. of Comput. Sci., Turku Univ., Finland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; Computer Programming --- Algorithms; Computer Programming Languages --- lisp; Computer Systems Programming; customizable garbage collectors; Data Processing --- Data Structures; data structures; design; Garbage Collection; garbage collection; Mark and Sweep Collectors; mark-and-sweep collectors; Memory Management; performance; Reference Counters; reference counters; storage management; theory; user program; user-defined routines; Utility Programs", subject = "E.1 Data, DATA STRUCTURES \\ D.3.3 Software, PROGRAMMING LANGUAGES, Language Constructs, Data types and structures", treatment = "P Practical", } @Article{Provan:1989:SEW, author = "J. Scott Provan", title = "Shortest enclosing walks and cycles in embedded graphs", journal = j-INFO-PROC-LETT, volume = "30", number = "3", pages = "119--125", day = "13", month = feb, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68U05 (68Q25 68R10 90B10)", MRnumber = "89k:68149", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Univ of North Carolina", affiliationaddress = "Chapel Hill, NC, USA", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Oper. Res., North Carolina Univ., Chapel Hill, NC, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; Computational Complexity; computational complexity; Computer Metatheory; Embedded Graphs; embedded graphs; general connected region; Graph Theory; graph theory; graphs; Mathematical Techniques; nonnegatively weighted graph; NP-hard; polynomial; shortest closed cycle; shortest closed walk; Shortest Enclosing Cycles; Shortest Enclosing Walks; theory; topological ball; verification; Weighted Graphs", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Path and circuit problems", treatment = "T Theoretical or Mathematical", } @Article{Gerstel:1989:BCO, author = "O. Gerstel and Y. Mansour and S. Zaks", title = "Bit complexity of order statistics on a distributed star network", journal = j-INFO-PROC-LETT, volume = "30", number = "3", pages = "127--132", day = "13", month = feb, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (68M10)", MRnumber = "89k:68065", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Technion-Israel Inst of Technology", affiliationaddress = "Haifa, Isr", classification = "723; C4240 (Programming and algorithm theory); C5620 (Computer networks and techniques)", corpsource = "Dept. of Comput. Sci., Technion Israel Inst. of Technol., Haifa, Israel", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; asynchronous distributed star network; Bit Complexity; bit complexity; computational complexity; Computer Metatheory; Computer Programming --- Algorithms; Computer Systems, Digital --- Distributed; distributed processing; distributed star network; k-selection problem; lower bound; Order Statistics; order statistics; performance; ranking; sorting; theory; verification", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Network problems \\ F.1.3 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes", treatment = "T Theoretical or Mathematical", } @Article{Rolim:1989:NBC, author = "Jos{\'e} D. P. Rolim and Sheila A. Greibach", title = "A note on the best-case complexity", journal = j-INFO-PROC-LETT, volume = "30", number = "3", pages = "133--138", day = "13", month = feb, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q15 (03D05 03D15)", MRnumber = "90b:68032", MRreviewer = "Peter Clote", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Odense Univ", affiliationaddress = "Odense, Den", classification = "721; 723; C4240 (Programming and algorithm theory)", corpsource = "Inst. for Matematik og Datalogi, Odense Univ., Denmark", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Automata Theory; Best Case Complexity; best-case complexity; Complexity Theory; complexity theory; computational complexity; Computer Metatheory; languages; performance; theory; verification; Worst Case Complexity", subject = "F.1.3 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Complexity hierarchies \\ F.4.1 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Recursive function theory", treatment = "T Theoretical or Mathematical", } @Article{Kelter:1989:PPS, author = "Udo Kelter", title = "The pitfall paradox and its solution with virtual objects", journal = j-INFO-PROC-LETT, volume = "30", number = "3", pages = "139--143", day = "13", month = feb, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Univ of Dortmund", affiliationaddress = "Dortmund, West Ger", classification = "723; 921; C1160 (Combinatorial mathematics); C4250 (Database theory); C5620 (Computer networks and techniques)", corpsource = "Dept. of Comput. Sci., Dortmund Univ., West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Database Systems; database theory; Directed Acyclic Graphs; directed acyclic graphs; directed graphs; Distributed; M-pitfall protocol; Mathematical Techniques --- Graph Theory; Non two Phase Locking Protocol; non-two-phase locking protocol; performance; Pitfall Paradox; pitfall paradox; Pitfall Protocol; protocols; S-locks; standardization; theory; Transaction Processing; trees; trees (mathematics); Virtual Objects; virtual objects; X-locks", subject = "C.2.2 Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Protocols \\ K.1 Computing Milieux, THE COMPUTER INDUSTRY, Standards \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory \\ G.m Mathematics of Computing, MISCELLANEOUS, Queueing theory", treatment = "T Theoretical or Mathematical", } @Article{Staunstrup:1989:BSO, author = "Jorgen Staunstrup and Jurg Nievergelt", title = "The behavior of shared objects: concepts, pitfalls, and a new model", journal = j-INFO-PROC-LETT, volume = "30", number = "3", pages = "145--151", day = "13", month = feb, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Aarhus Univ", affiliationaddress = "Aarhus, Den", classification = "721; 722; 723; C4220 (Automata theory); C5440 (Multiprocessor systems and techniques)", corpsource = "Dept. of Comput. Sci. Aarhus Univ., Denmark", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Automata Theory; automata theory; Computer Systems, Digital; Concurrency; concurrent access; Database Systems --- Distributed; Distributed; distributed database; distributed processing; finite automata; functional behaviour; multiprocessing systems; Nonatomic Operations; overlapping operations; performance; Predictor Automata; predictor automata; Shared Objects; shared objects; shared registers; specification technique; theory; time measurement; timing behavior", subject = "D.4.1 Software, OPERATING SYSTEMS, Process Management, Concurrency \\ D.4.7 Software, OPERATING SYSTEMS, Organization and Design, Distributed systems", treatment = "T Theoretical or Mathematical", } @Article{Culik:1989:VFS, author = "Karel {Culik, II}", title = "Variations of the firing squad problem and applications", journal = j-INFO-PROC-LETT, volume = "30", number = "3", pages = "153--157", day = "13", month = feb, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q80 (68Q45 90D15)", MRnumber = "89k:68109", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Univ of South Carolina", affiliationaddress = "Columbia, SC, USA", classification = "721; C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comp. Sci., South Carolina Univ., Columbia, SC, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Automata Theory; Cellular Automata; cellular automata; computational complexity; finite automata; Firing Squad Problem; firing squad problem; Formal Languages; languages; Minimal Time Solutions; minimal time solutions; One Way Cellular Arrays; one-way cellular arrays; real-time; synchronisation; synchronization; theory; verification", subject = "F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Unbounded-action devices \\ F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Algebraic language theory", treatment = "T Theoretical or Mathematical", } @Article{Ehlers:1989:URC, author = "E. M. Ehlers and S. H. {von Solms}", title = "Using random context structure grammars to represent chemical structures", journal = j-INFO-PROC-LETT, volume = "30", number = "3", pages = "159--166", day = "13", month = feb, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q50 (92A40)", MRnumber = "90c:68043", MRreviewer = "Petr K\.urka", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Rand Afrikaans Univ", affiliationaddress = "Johannesburg, S Afr", classification = "721; 804; 931; C4210 (Formal logic); C4220 (Automata theory); C7320 (Physics and Chemistry)", corpsource = "Dept. of Comput. Sci., Rand Afrikaans Univ., Johannesburg, South Africa", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; Automata Theory --- Grammars; chemical molecules; chemical structures; chemistry computing; data structures; Ethane --- Molecular Structure; formal languages; formal languages 3D grammars; grammars; languages; Models; Molecules; Random Context Structure Automata; random context structure automata; Random Context Structure Grammars; random context structure grammars; theory; three-dimensional digital structures", subject = "F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Automata \\ F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Classes defined by grammars or automata \\ J.2 Computer Applications, PHYSICAL SCIENCES AND ENGINEERING, Chemistry", treatment = "T Theoretical or Mathematical", } @Article{Lavault:1989:ANM, author = "Christian Lavault", title = "Average number of messages for distributed leader-finding in rings of processors", journal = j-INFO-PROC-LETT, volume = "30", number = "4", pages = "167--176", day = "27", month = feb, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68M10", MRnumber = "90d:68009", MRreviewer = "Wies{\l}aw Zielonka", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "INRIA", affiliationaddress = "Le Chesnay, Fr", classification = "722; 723; C4240 (Programming and algorithm theory)", corpsource = "INRIA, Le Chesnay, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm theory; algorithms; Average Message Complexity; average message complexity; Bidirectional Processor Rings; bidirectional rings; computational complexity; Computer Programming--Algorithms; Computer Systems, Digital; design; deterministic algorithm; Deterministic Algorithms; Distributed; distributed algorithm; distributed processing; distribution leader-finding; exact asymptotic average value; identification number; Probabilistic Algorithms; rings of processors; theory; unidirectional rings; verification", subject = "F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Unbounded-action devices \\ I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Network problems", treatment = "T Theoretical or Mathematical", } @Article{Chetto:1989:SPS, author = "Houssine Chetto and Maryline Chetto", title = "Scheduling periodic and sporadic tasks in a real-time system", journal = j-INFO-PROC-LETT, volume = "30", number = "4", pages = "177--184", day = "27", month = feb, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68N25 (68M15)", MRnumber = "90f:68028", MRreviewer = "Armin Cremers", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "CNRS", affiliationaddress = "Nantes, Fr", classification = "723; 913; C4240 (Programming and algorithm theory); C6150J (Operating systems)", corpsource = "Lab. d'Automat. de Nantes, ENSM, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm theory; algorithms; Computer Programming--Algorithms; Computer Systems, Digital; deadline; Distributed; distributed processing; distributed system; earliest deadline scheduling strategy; monoprocessor machine; network operating systems; performance; Periodic Tasks; Preemptive Scheduling; Real Time Distributed Systems; real-time system; real-time systems; requests; Scheduling; scheduling; Sporadic Tasks; sporadic tasks; system initialization time; theory; time-critical tasks; timing requirements; verification", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sequencing and scheduling \\ I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms \\ C.3 Computer Systems Organization, SPECIAL-PURPOSE AND APPLICATION-BASED SYSTEMS, Real-time systems", treatment = "T Theoretical or Mathematical", } @Article{Wogulis:1989:SSS, author = "James Wogulis", title = "Self-adjusting and split sequence hash tables", journal = j-INFO-PROC-LETT, volume = "30", number = "4", pages = "185--188", day = "27", month = feb, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Univ of California", affiliationaddress = "Irvine, CA, USA", classification = "723; C6120 (File organisation)", corpsource = "Dept. of Inf. and Comp. Sci., California Univ., Irvine, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; Chaining; chaining; Computer Programming--Algorithms; Data Processing; data structure; data structures; experimental data; file organisation; File Organization; Open Addressing; open addressing hashing; performance; probe length; random distribution; Self Adjusting Hash Tables; self-adjusting hash tables; Split Sequence Hash Search; split sequence hash tables; theory", subject = "E.1 Data, DATA STRUCTURES \\ E.2 Data, DATA STORAGE REPRESENTATIONS, Hash-table representations \\ I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms", treatment = "P Practical", } @Article{Raymond:1989:DAM, author = "Kerry Raymond", title = "A distributed algorithm for multiple entries to a critical section", journal = j-INFO-PROC-LETT, volume = "30", number = "4", pages = "189--193", day = "27", month = feb, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See note \cite{Satyanarayanan:1992:NRT}.", acknowledgement = ack-nhfb, affiliation = "Univ of Queensland", affiliationaddress = "St. Lucia, Aust", classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Queensland Univ., St. Lucia, Qld., Australia", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm theory; algorithms; Algorithms; Computer Programming; Computer Systems, Digital--Distributed; critical section; Critical Sections; distributed algorithm; Distributed Algorithms; distributed mutual exclusion; distributed processing; Distributed Programming; multiple entries; Mutual Exclusion; performance; synchronisation; theory; verification", subject = "D.1.m Software, PROGRAMMING TECHNIQUES, Miscellaneous \\ D.4.7 Software, OPERATING SYSTEMS, Organization and Design, Distributed systems \\ D.4.1 Software, OPERATING SYSTEMS, Process Management, Synchronization", treatment = "T Theoretical or Mathematical", } @Article{Mattern:1989:GQD, author = "Friedemann Mattern", title = "Global quiescence detection based on credit distribution and recovery", journal = j-INFO-PROC-LETT, volume = "30", number = "4", pages = "195--200", day = "27", month = feb, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q10", MRnumber = "89k:68044", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Univ of Kaiserslautern", affiliationaddress = "Kaiserslautern, West Ger", classification = "722; 723; C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Kaiserslautern Univ., West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; Computer Programming--Algorithms; Computer Systems, Digital; credit distribution; credit recovery; Distributed; Distributed Algorithms; Distributed Computing; distributed processing; Distributed Termination; Global Quiescence Detection; global quiescence detection; programming theory; Termination Detection; theory; verification", subject = "D.4.7 Software, OPERATING SYSTEMS, Organization and Design, Distributed systems", treatment = "T Theoretical or Mathematical", } @Article{Barkley:1989:PRH, author = "Ronald E. Barkley and T. Paul Lee", title = "Point representation and hashing of an interval", journal = j-INFO-PROC-LETT, volume = "30", number = "4", pages = "201--203", day = "27", month = feb, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68P10", MRnumber = "89k:68023", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", abstract = "A system managing memory from a set of non-overlapping address intervals or pools must be able to take an arbitrary memory address and identify its parent pool. To make the lookup operation efficient, we would like to use some hashing scheme. In this paper, we introduce the notion of mapping address intervals to representative points. Each pool or interval can be mapped into a point x; we show that under a similar mapping function, any address from that interval has a value x or x + 1. Given this important property, we can use any reasonable hashing technique to do efficient address lookup.", acknowledgement = ack-nhfb, affiliation = "AT\&T Bell Lab", affiliationaddress = "Summit, NJ, USA", classification = "723; C6120 (File organisation)", corpsource = "AT and T Bell Labs., Summit, NJ, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Address Lookup; address lookup; Computer Programming--Algorithms; Computer Systems Programming--Utility Programs; Data Processing; Data Structures; file organisation; Global Quiescence Detection; Hashing; hashing; interval; Intervals; lookup operation; mapping function; memory address; Memory Management; parent pool; performance; point representation; storage management; system managing memory; table lookup; theory; verification", subject = "D.4.2 Software, OPERATING SYSTEMS, Storage Management \\ E.2 Data, DATA STORAGE REPRESENTATIONS, Hash-table representations", treatment = "P Practical", } @Article{Aggarwal:1989:GMU, author = "Alok Aggarwal and Don Coppersmith and Dan Kleitman", title = "A generalized model for understanding evasiveness", journal = j-INFO-PROC-LETT, volume = "30", number = "4", pages = "205--208", day = "27", month = feb, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (68R10)", MRnumber = "90g:68056", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "IBM T. J. Watson Research Cent", affiliationaddress = "Yorktown Heights, NY, USA", classification = "723; 921; 922; C1140E (Game theory); C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "IBM Res. Div., Thomas J. Watson Res. Center, Yorktown Heights, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; column; computational complexity; Computer Programming--Algorithms; connected components; Decision Theory and Analysis; entries; Evasiveness; game theory; generalized decision tree model; Graph Connectivity; Graph Theory; graph theory; Mathematical Techniques; matrix algebra; Monotone Graph Property; n-vertex graph; oracle; rows; submatrix; Symmetric Matrices; symmetric nxn matrix; theory; understanding evasiveness; Undirected Graphs; verification", subject = "G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous", treatment = "T Theoretical or Mathematical", } @Article{Robson:1989:SSS, author = "J. M. Robson", title = "Separating strings with small automata", journal = j-INFO-PROC-LETT, volume = "30", number = "4", pages = "209--214", day = "27", month = feb, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q05 (03D05)", MRnumber = "90b:68022", MRreviewer = "Dani{\`e}le Beauquier", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Australian Natl Univ", affiliationaddress = "Canberra, Aust", classification = "721; C4220 (Automata theory)", corpsource = "Dept. of Comput. Sci., Australian Nat. Univ., Canberra, ACT, Australia", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Automata Theory; Finite Automata; finite automata; finite automaton; languages; Small Automata; small automata; String Separation; strings; theory; Upper Bounds; verification", subject = "D.3.3 Software, PROGRAMMING LANGUAGES, Language Constructs, Data types and structures \\ F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Automata \\ E.4 Data, CODING AND INFORMATION THEORY, Data compaction and compression", treatment = "T Theoretical or Mathematical", } @Article{Culberson:1989:FAC, author = "Joseph C. Culberson and Piotr Rudnicki", title = "A fast algorithm for constructing trees from distance matrices", journal = j-INFO-PROC-LETT, volume = "30", number = "4", pages = "215--220", day = "27", month = feb, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68R10 (68Q25)", MRnumber = "90f:68140", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Univ of Alberta", affiliationaddress = "Edmonton, Alberta, Can", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Alberta Univ., Edmonton, Alta., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm; algorithm theory; algorithms; Computer Programming--Algorithms; Distance Matrices; distance matrices; fast algorithm; Mathematical Techniques; Random Trees; theory; Tree Construction; tree-realizable distance matrix; Trees; trees; trees (mathematics); Trees of Bounded Degree; verification", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees \\ I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms \\ G.4 Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm analysis \\ F.2.1 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Computations on matrices", treatment = "T Theoretical or Mathematical", } @Article{Vidyasankar:1989:EWM, author = "K. Vidyasankar", title = "An elegant $1$-writer multireader multivalued atomic register", journal = j-INFO-PROC-LETT, volume = "30", number = "5", pages = "221--223", day = "13", month = mar, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Memorial Univ of Newfoundland", affiliationaddress = "St. John's, Newfoundl, Can", classification = "722; 723; C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Memorial Univ. of Newfoundland, St. John's, Nfld., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "1-writer multireader multivalued atomic register; 1-writer registers; Atomic Registers; Computer Systems, Digital; Concurrent Reading; Concurrent Writing; construction; Distributed; multireader atomic register; parallel programming; performance; programming theory; Safe Registers; Shared Registers; theory", subject = "B.5.m Hardware, REGISTER-TRANSFER-LEVEL IMPLEMENTATION, Miscellaneous", treatment = "T Theoretical or Mathematical", } @Article{Rytter:1989:PAC, author = "Wojciech Rytter and Tomasz Szymacha", title = "Parallel algorithms for a class of graphs generated recursively", journal = j-INFO-PROC-LETT, volume = "30", number = "5", pages = "225--231", day = "13", month = mar, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q15 (68Q10 68Q50 68R10)", MRnumber = "90h:68054", MRreviewer = "Anton {\v{C}}ern\'y", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Warsaw Univ", affiliationaddress = "Warsaw, Pol", classification = "721; 723; 921; C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Inst. of Inf., Warsaw Univ., Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithmic techniques; algorithms; Algorithms; Automata Theory--Context Free Grammars; Computer Programming; Computer Systems, Digital--Parallel Processing; Context Free Graph Grammars; context-free grammars; context-free languages; general graphs; graph theory; languages; Mathematical Techniques--Graph Theory; NP-complete; Parallel Algorithms; parallel algorithms; parallel computations; parallel do; parallel programming; parallel random access machine; parsing; Polynomial Time Algorithms; polynomial time algorithms; PRAM; recognition; recursive programs; Star Graphs; theory; verification", subject = "G.1.0 Mathematics of Computing, NUMERICAL ANALYSIS, General, Parallel algorithms \\ F.4.2 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems, Grammar types \\ F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Classes defined by grammars or automata \\ F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms", treatment = "T Theoretical or Mathematical", } @Article{Kucera:1989:GSC, author = "Lud{\v{e}}k Ku{\v{c}}era", title = "Graphs with small chromatic numbers are easy to color", journal = j-INFO-PROC-LETT, volume = "30", number = "5", pages = "233--236", day = "13", month = mar, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "05C15 (05C80 68Q25 68R10)", MRnumber = "90j:05067", MRreviewer = "Stephen J. Suchower", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Charles Univ", affiliationaddress = "Prague, Czech", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Appl. Math., Charles Univ., Prague, Czechoslovakia", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computability; Computer Programming--Algorithms; Graph Coloring Algorithms; graph colouring; Graph Theory; graphs; languages; Mathematical Techniques; Polynomial Time Algorithms; polynomial time graph coloring algorithm; Small Chromatic Numbers; small chromatic numbers; theory; verification; vertices", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms", treatment = "T Theoretical or Mathematical", } @Article{Chng:1989:SSH, author = "Hock Thiam Ch'ng and B. Srinivasan and Beng Chin Ooi", title = "Study of self-organizing heuristics for skewed access patterns", journal = j-INFO-PROC-LETT, volume = "30", number = "5", pages = "237--244", day = "13", month = mar, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Monash Univ", affiliationaddress = "Clayton, Aust", classification = "723; 903; C4250 (Database theory)", corpsource = "Dept. of Comput. Sci., Monash Univ., Clayton, Vic., Australia", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; Computer Programming--Algorithms; Data Processing--Data Structures; data structures; database theory; double area; expected performance; file; first-in-first-out; individual records; Information Retrieval; Information Science; management; measurement; move-to-front, transpose; performance; Permutation Algorithms; permutation algorithms; random replacement; search performance; self-organising heuristics; Self-Organizing Heuristics; selforganizing heuristics; Sequential Search; sequential search; skewed access patterns; table; theory", subject = "E.1 Data, DATA STRUCTURES \\ G.2.1 Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics, Permutations and combinations \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching", treatment = "T Theoretical or Mathematical", } @Article{Song:1989:DDD, author = "Gyuyoun Song and Donghyeon Park and Dongmyun Lee and Kyu Ho Park and Myunghwan Kim", title = "A distributed deadlock detection algorithm: distributed graph reconstruction algorithm", journal = j-INFO-PROC-LETT, volume = "30", number = "5", pages = "245--252", day = "13", month = mar, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Korea Advanced Inst of Science \& Technology", affiliationaddress = "Seoul, South Korea", classification = "722; 723; 921; C4240 (Programming and algorithm theory)", corpsource = "Dept. of Electr. Eng., Korea Adv. Inst. of Sci. and Technol., Seoul, South Korea", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm theory; algorithms; Communication Deadlock; communication model; Computer Systems, Digital; Deadlock Detection; DGR algorithm; Distributed; distributed deadlock detection algorithm; Distributed Graph Reconstruction Algorithm; distributed graph reconstruction algorithm; distributed processing; distributed system; graph theory; idle processes; knot; management; Mathematical Techniques--Graph Theory; performance; system recovery; theory; verification; wait-for-graph", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory \\ H.2.2 Information Systems, DATABASE MANAGEMENT, Physical Design, Deadlock avoidance \\ H.2.4 Information Systems, DATABASE MANAGEMENT, Systems, Distributed systems \\ D.4.7 Software, OPERATING SYSTEMS, Organization and Design, Distributed systems", treatment = "T Theoretical or Mathematical", } @Article{Zalcstein:1989:ATS, author = "Yechezkel Zalcstein and Max Garzon", title = "An {${\rm NC}^2$} algorithm for testing similarity of matrices", journal = j-INFO-PROC-LETT, volume = "30", number = "5", pages = "253--254", day = "13", month = mar, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (15-04)", MRnumber = "90e:68052", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4140 (Linear algebra); C4240 (Programming and algorithm theory)", corpsource = "Div. of Comput. and Comput. Res., Nat. Sci. Found., Washington, DC, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "algorithm problem; computational complexity; finite abelian group isomorphism; linear algebra; logarithmic cost criterion; matrices; matrix algebra; NC/sup 2/ algorithm; parallel algorithms; polynomial time; similarity", treatment = "T Theoretical or Mathematical", } @Article{Gusfield:1989:PSM, author = "Dan Gusfield and Robert W. Irving", title = "Parametric stable marriage and minimum cuts", journal = j-INFO-PROC-LETT, volume = "30", number = "5", pages = "255--259", day = "13", month = mar, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "90B10 (05C99 68Q20 68R05 90C35)", MRnumber = "90f:90050", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Univ of California at Davis", affiliationaddress = "Davis, CA, USA", classification = "723; 921; C1140E (Game theory); C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Electr. Eng. and Comput. Sci., California Univ., Davis, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm theory; algorithms; Algorithms; Computer Programming; favor; Gale--Shapley stable marriage algorithm; game theory; graph theory; Mathematical Techniques--Graph Theory; measurement; men; minimum cuts; Network Flow; Optimization; parametric network flows; Parametric Optimization; performance; preferences; Stable Marriage Problem; theory; verification; women", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Network problems", treatment = "T Theoretical or Mathematical", } @Article{Vardi:1989:NRT, author = "Moshe Y. Vardi", title = "A note on the reduction of two-way automata to one-way automata", journal = j-INFO-PROC-LETT, volume = "30", number = "5", pages = "261--264", day = "13", month = mar, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q05 (03D05)", MRnumber = "91d:68014", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "IBM Almaden Research Cent", affiliationaddress = "San Jose, CA, USA", classification = "721; C4220 (Automata theory)", corpsource = "IBM Almaden Res. Center, San Jose, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Automata Theory; automata theory; Deterministic Automata; elementary reduction; exponential blow-up; languages; Nondeterministic Automata; One Way Automata; one-way automata; regular languages; Subset Construction; subset construction; theory; Two Way Automata; two-way automata; verification", subject = "F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Algebraic language theory \\ F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Automata", treatment = "T Theoretical or Mathematical", } @Article{Rajan:1989:EPA, author = "Vijayan Rajan and R. K. Ghosh and P. Gupta", title = "An efficient parallel algorithm for random sampling", journal = j-INFO-PROC-LETT, volume = "30", number = "5", pages = "265--268", day = "13", month = mar, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Indian Inst of Technology", affiliationaddress = "Kanpur, India", classification = "723; 913; 922; C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci. and Eng., IIT, Kanpur, India", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm theory; algorithms; Algorithms; Computer Programming; Computer Systems, Digital; Concurrent Read; concurrent read exclusive write; CREW; Crew Pram; efficient parallel algorithm; Exclusive Write; M processors; Parallel Algorithms; parallel algorithms; Parallel Random Access Machines; PRAM; Random Sampling; random sampling; SAMPLE; Sampling; SELECT; theory; unbiased random sample", subject = "G.1.0 Mathematics of Computing, NUMERICAL ANALYSIS, General, Parallel algorithms \\ F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism \\ G.3 Mathematics of Computing, PROBABILITY AND STATISTICS \\ F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Probabilistic computation", treatment = "T Theoretical or Mathematical", } @Article{Omiecinski:1989:HBJ, author = "Edward Omiecinski and Eileen Tien", title = "A hash-based join algorithm for a cube-connected parallel computer", journal = j-INFO-PROC-LETT, volume = "30", number = "5", pages = "269--275", day = "13", month = mar, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib; UnCover library database", abstract = "A hybrid-hash join algorithm presented is extended to a cube-connected parallel computer architecture. The performance of this algorithm is predicted analytically. the influence of the number of processors and the disk\slash node ratio on the algorithm's performance is examined.", acknowledgement = ack-nhfb, affiliation = "Georgia Inst of Technology", affiliationaddress = "Atlanta, GA, USA", classification = "723; C4250 (Database theory); C6160D (Relational DBMS)", corpsource = "Sch. of Inf. and Comput. Sci., Georgia Inst. of Technol., Atlanta, GA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; Analytic Cost Models; analytic model; Boolean n-cube; buffer; communication processors; Computation Cost; Computer Programming; Computer Systems, Digital--Parallel Processing; cube-connected parallel computer; database operations; Database Systems--Relational; Hash Join Algorithms; hash-based join algorithm; hypercube structure; Hypercubes; packet size; parallel algorithms; parallel architectures; relational databases; relational join operator; secondary storage device", subject = "H.2.m Information Systems, DATABASE MANAGEMENT, Miscellaneous \\ F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism \\ C.1.2 Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors), Parallel processors", treatment = "P Practical", } @Article{Nazareth:1989:ANM, author = "J. L. Nazareth and K. A. Ariyawansa", title = "On accelerating {Newton}'s method based on a conic model", journal = j-INFO-PROC-LETT, volume = "30", number = "6", pages = "277--281", day = "28", month = mar, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "90C30 (65K05)", MRnumber = "90d:90073", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Pullman, WA, USA", classification = "723; 921; C1180 (Optimisation techniques); C4130 (Interpolation and function approximation)", corpsource = "Dept. of Pure and Appl. Math., Washington State Univ., Pullman, WA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "approximation theory; Computer Programming--Algorithms; conic approximating model function; Conic Approximations; conic model; Conjugate Gradient Methods; differentiation; Hessian matrix; iterative methods; Mathematical Techniques--Iterative Methods; matrix algebra; minimisation; Newton direction; Newton's Method; Optimization; preconditioned conjugate gradient iteration; search direction; search problems; second-order derivative information; theory; Unconstrained Minimization; unconstrained minimization", subject = "G.1.5 Mathematics of Computing, NUMERICAL ANALYSIS, Roots of Nonlinear Equations", treatment = "T Theoretical or Mathematical", } @Article{deLuca:1989:FLW, author = "Aldo {de Luca} and Stefano Varricchio", title = "Factorial languages whose growth function is quadratically upper bounded", journal = j-INFO-PROC-LETT, volume = "30", number = "6", pages = "283--288", day = "28", month = mar, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q45 (20M35)", MRnumber = "90b:68049", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Naples, Italy", classification = "721; C1160 (Combinatorial mathematics); C4210 (Formal logic); C4240 (Programming and algorithm theory); C4290 (Other computer theory)", corpsource = "Dept. of Math., Rome Univ., Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Automata Theory; combinatorial mathematics; computational complexity; computational linguistics; factorial language; Factorial Languages; finite alphabet; Formal Languages; formal languages; growth function; Growth Functions; languages; monoid; quadratically upper bounded; Subword Complexity; subword complexity; theory; Upper Bounds; verification", subject = "F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Algebraic language theory \\ G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous", treatment = "T Theoretical or Mathematical", } @Article{Lindhorst:1989:RSC, author = "Greg Lindhorst and Farhad Shahrokhi", title = "On renaming a set of clauses as a {Horn} set", journal = j-INFO-PROC-LETT, volume = "30", number = "6", pages = "289--293", day = "28", month = mar, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (03B05 03B35 68T25)", MRnumber = "90b:68041", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Socorro, NM, USA", classification = "723; C1160 (Combinatorial mathematics); C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., New Mexico Inst. of Mining and Technol., Socorro, NM, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; clause set; computational complexity; Computer Metatheory; Computer Programming--Algorithms; Depth First Search; depth first search; formal logic; Horn Clauses; Horn set; Horn Sets; Propositional Calculus; propositional calculus; renaming; Search Algorithms; set theory; theory; time algorithm; verification", subject = "F.4.1 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Logic programming \\ G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous", treatment = "T Theoretical or Mathematical", } @Article{Ibarra:1989:OST, author = "Oscar H. Ibarra and Tao Jiang", title = "Optimal simulation of tree arrays by linear arrays", journal = j-INFO-PROC-LETT, volume = "30", number = "6", pages = "295--302", day = "28", month = mar, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q45 (68Q80)", MRnumber = "91c:68071", MRreviewer = "Sam M. Kim", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Minneapolis, MN, USA", classification = "721; 921; C1160 (Combinatorial mathematics); C1180 (Optimisation techniques); C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Minnesota Univ., Minneapolis, MN, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Automata Theory; communication channel; computational complexity; finite automata; finite-state machine; Linear Arrays; linear arrays; Mathematical Techniques--Trees; maximum edge length; message exchanges; n-node complete binary tree; optimal simulation; optimisation; Parallel Language Recognizers; theory; Tree Arrays; tree arrays; trees (mathematics); verification", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees \\ E.1 Data, DATA STRUCTURES", treatment = "T Theoretical or Mathematical", } @Article{Vogt:1989:NAO, author = "Carsten Vogt", title = "A new approach to optimal cache scheduling", journal = j-INFO-PROC-LETT, volume = "30", number = "6", pages = "303--310", day = "28", month = mar, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Wachtberg-Werthhoven, West Ger", classification = "723; C1180 (Optimisation techniques); C4240 (Programming and algorithm theory); C6120 (File organisation); C6150J (Operating systems)", corpsource = "FGAN/FFM, Wachtberg-Werthhoven, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; cache loads; Cache Memories; computational complexity; Computer Operating Systems; Computer Programming--Algorithms; design; disk cache; experimentation; Optimal Cache Scheduling; optimal cache scheduling; optimal paging strategy; optimisation; performance; Scheduling; scheduling; Storage Allocation; storage allocation; Storage Hierarchies; storage management; theory; time requirements; verification", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sequencing and scheduling", treatment = "T Theoretical or Mathematical", } @Article{Kotov:1989:APE, author = "V. Kotov", title = "{Andrei P. Ershov} (1931--1988)", journal = j-INFO-PROC-LETT, volume = "31", number = "1", pages = "1--2", day = "??", month = apr, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Mon Aug 15 13:51:01 MDT 1994", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "human factors; theory", subject = "A.0 General Literature, GENERAL, Biographies/Autobiographies \\ K.2 Computing Milieux, HISTORY OF COMPUTING, People \\ D.0 Software, GENERAL", } @Article{Ginat:1989:TAB, author = "David Ginat and Daniel D. Sleator and Robert E. Tarjan", title = "A tight amortized bound for path reversal", journal = j-INFO-PROC-LETT, volume = "31", number = "1", pages = "3--5", day = "12", month = apr, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68P05 (68Q25 90C10)", MRnumber = "90g:68016", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "College Park, MD, USA", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm theory; algorithms; Algorithms; Amortized Efficiency; Computer Programming; data structures; Disjoint Set Union Algorithm; disjoint set union algorithm; graph theory; Mathematical Techniques--Trees; Mutual Exclusion Algorithm; mutual exclusion algorithm; Path Compression; path compression; Path Reversal; path reversal; theory; tight amortized bound; Upper Bounds", subject = "I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Path and circuit problems \\ E.1 Data, DATA STRUCTURES", treatment = "T Theoretical or Mathematical", } @Article{Kamada:1989:ADG, author = "Tomihisa Kamada and Satoru Kawai", title = "An algorithm for drawing general undirected graphs", journal = j-INFO-PROC-LETT, volume = "31", number = "1", pages = "7--15", day = "12", month = apr, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Tokyo, Jpn", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Inf. Sci., Tokyo Univ., Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm theory; algorithms; Algorithms; Computer Programming; data structures; data-flow graphs; design; Drawing Algorithms; drawing general undirected graphs; entity-relationship diagrams; geometric distance; graph drawing algorithms; graph structures; graph theoretic distance; graph theory; information systems; Mathematical Techniques--Graph Theory; Petri nets; spring energy; Spring Model; spring model; state graphs; theory; Undirected Graphs; vertices; virtual dynamic system; Weighted Graphs; weighted graphs", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms \\ E.1 Data, DATA STRUCTURES \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Network problems", treatment = "T Theoretical or Mathematical", } @Article{Aggarwal:1989:LTA, author = "Alok Aggarwal and Dina Kravets", title = "A linear time algorithm for finding all farthest neighbors in a convex polygon", journal = j-INFO-PROC-LETT, volume = "31", number = "1", pages = "17--20", day = "12", month = apr, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68U05 (90C10)", MRnumber = "90g:68135", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Yorktown Heights, NY, USA", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "IBM Res. Div., Thomas J. Watson Res. Center, Yorktown Heights, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm theory; algorithms; Algorithms; computational geometry; Computer Programming; convex polygon; Convex Polygons; Farthest Neighbors; farthest neighbors; linear time algorithm; Linear Time Algorithms; Mathematical Techniques--Matrix Algebra; theory; verification; vertex", subject = "I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations \\ G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous \\ F.2.1 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Computations on matrices", treatment = "T Theoretical or Mathematical", } @Article{Robert:1989:DAS, author = "Yves Robert and Bernard Tourancheau and Gilles Villard", title = "Data allocation strategies for the {Gauss} and {Jordan} algorithms on a ring of processors", journal = j-INFO-PROC-LETT, volume = "31", number = "1", pages = "21--29", day = "12", month = apr, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "65W05 (65F05 68Q25)", MRnumber = "90g:65187", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Grenoble, Fr", classification = "723; 921; C4140 (Linear algebra); C4240 (Programming and algorithm theory)", corpsource = "Inst. Nat. Polytech. de Grenoble, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; allocation strategies; complexity; computational complexity; Computer Programming; Computer Systems, Digital--Parallel Processing; Data Allocation; data allocation strategies; elimination methods; experimentation; Gauss algorithm; Gauss and Jordan Algorithms; Gauss and Jordan Elimination Methods; Hypercube; hypercube; Jordan algorithms; Mathematical Techniques--Linear Algebra; matrix algebra; measurement; numerical experiments; Parallel Algorithms; parallel algorithms; parallel implementation; performance; Ring of Processors; ring of processors; theory; verification", subject = "F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism \\ I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms \\ F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Bounded-action devices", treatment = "T Theoretical or Mathematical", } @Article{Hartley:1989:DPG, author = "Richard I. Hartley", title = "Drawing polygons given angle sequences", journal = j-INFO-PROC-LETT, volume = "31", number = "1", pages = "31--33", day = "12", month = apr, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Schenectady, NY, USA", classification = "723; 921; C4240 (Programming and algorithm theory); C6130B (Graphics techniques)", corpsource = "General Electr. Res. and Dev. Center, Schenectady, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; Angle Sequences; angle sequences; angles; Computational Geometry; computational geometry; computer graphics; Computer Programming; departing edge; external angle; Geometrical Algorithms; incoming edge; Mathematical Techniques--Geometry; polygon; Polygons; theory; total turning angle; vertex", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations", treatment = "T Theoretical or Mathematical", } @Article{Kumar:1989:CCE, author = "Vijay Kumar", title = "Concurrency control on extendible hashing", journal = j-INFO-PROC-LETT, volume = "31", number = "1", pages = "35--41", day = "12", month = apr, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", abstract = "We present a deadlock-free algorithm for managing concurrent operations on extendible hashing. Extendible hashing is a dynamic file structure that grows and shrinks gracefully with the database. The algorithm uses a two-phase locking protocol and verification process at the right moment to guarantee a consistent view of the data in the execution of concurrent transactions. Unlike an algorithm where both the directory and data pages are locked for any data modification, the present algorithm eliminates the need for locking the directory thus achieving a higher level of concurrency, and reducing locking overheads.", acknowledgement = ack-nhfb, affiliation = "Univ of Missouri-Kansas City", affiliationaddress = "Kansas City, MO, USA", classification = "723; C4250 (Database theory); C6120 (File organisation); C6160B (Distributed DBMS)", corpsource = "Comput. Sci., Missouri Univ., Kansas City, MO, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; Computer Programming--Algorithms; Concurrency Control; concurrency control; concurrent operations; concurrent transactions; consistent view; Data Processing--File Organization; database; Database Systems; database theory; Deadlock Avoidance; deadlock-free algorithm; Distributed; distributed databases; dynamic file structure; Extendible Hashing; extendible hashing; file organisation; performance; protocols; theory; Two Phase Locking; two-phase locking protocol; verification; verification process", subject = "E.2 Data, DATA STORAGE REPRESENTATIONS, Hash-table representations \\ D.4.1 Software, OPERATING SYSTEMS, Process Management, Concurrency", treatment = "T Theoretical or Mathematical", } @Article{Olariu:1989:WPO, author = "S. Olariu and J. Randall", title = "{Welsh-Powell} opposition graphs", journal = j-INFO-PROC-LETT, volume = "31", number = "1", pages = "43--46", day = "12", month = apr, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "05C75 (05C15 68R10)", MRnumber = "90f:05118", MRreviewer = "Marek Kubale", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Norfolk, VA, USA", classification = "723; 921; B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics)", corpsource = "Dept. of Comput. Sci., Old Dominion Univ., Norfolk, VA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; colouring heuristics; Computer Programming--Algorithms; Graph Coloring; graph colouring; Graph Theory; Heuristic Methods; linear-time optimization algorithms; Mathematical Techniques; Optimization; optimum colouring; polynomial-time recognition algorithm; Recognition Algorithms; theory; verification; Welsh-Powell Opposition Graphs; Welsh-Powell opposition graphs", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms \\ I.2.8 Computing Methodologies, ARTIFICIAL INTELLIGENCE, Problem Solving, Control Methods, and Search, Heuristic methods", treatment = "T Theoretical or Mathematical", } @Article{Yu:1989:PLD, author = "Sheng Yu", title = "A pumping lemma for deterministic context-free languages", journal = j-INFO-PROC-LETT, volume = "31", number = "1", pages = "47--51", day = "12", month = apr, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q45 (03D05)", MRnumber = "91a:68173", MRreviewer = "Howard Straubing", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Kent, OH, USA", classification = "721; C4210 (Formal logic)", corpsource = "Dept. of Math. Sci., Kent State Univ., OH, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Automata Theory; Context Free Languages; context-free languages; Deterministic Context Free Languages; deterministic context-free; deterministic context-free languages; grammars; iteration theorem; Iteration Theorems; languages; left part theory; left-part theorem; LR(k) Grammars; LR(k) grammars; pumping lemma; Pumping Lemmas; theory; verification", subject = "F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Classes defined by grammars or automata \\ F.4.2 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems, Grammar types \\ G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous", treatment = "T Theoretical or Mathematical", } @Article{deFraysseix:1989:NOD, author = "Hubert {de Fraysseix} and Hiroshi Imai", title = "Notes on oriented depth-first search and longest paths", journal = j-INFO-PROC-LETT, volume = "31", number = "1", pages = "53--56", day = "12", month = apr, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68R10 (05C05 05C20 90B10)", MRnumber = "90k:68136", MRreviewer = "Eberhard L{\"u}dde", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Paris, Fr", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "CNRS, EHESS, Paris, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "acyclic flow graph; Acyclic Graphs; algorithms; comparable; Computer Programming--Algorithms; DFS-tree; directed graphs; directed path; Flow Graphs; Graph Theory; incident vertices; Longest Paths; longest paths; Mathematical Techniques; Oriented Depth First Search; oriented depth-first search; search problems; theory; transverse edge; Transverse Edges; verification", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching", treatment = "T Theoretical or Mathematical", } @Article{Luccio:1989:UBR, author = "F. Luccio and L. Pagli", title = "On the upper bound on the rotation distance of binary trees", journal = j-INFO-PROC-LETT, volume = "31", number = "2", pages = "57--60", day = "26", month = apr, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68P05 (68R10)", MRnumber = "90k:68025", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Pisa, Italy", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory); C6130 (Data handling techniques)", corpsource = "Dipartimento di Inf., Pisa Univ., Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; Binary Search Trees; binary search trees; Computer Programming--Algorithms; Data Processing; Data Structures; Mathematical Techniques--Trees; Rotation Distance; rotation distance; search problems; theory; Tree Transformation Algorithm; tree transformation algorithm; trees (mathematics); triangulation of polyhedra; upper bound; Upper Bounds; verification", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees \\ I.2.8 Computing Methodologies, ARTIFICIAL INTELLIGENCE, Problem Solving, Control Methods, and Search, Graph and tree search strategies", treatment = "T Theoretical or Mathematical", } @Article{Ho:1989:CCT, author = "Chin-Wen W. Ho and R. C. T. Lee", title = "Counting clique trees and computing perfect elimination schemes in parallel", journal = j-INFO-PROC-LETT, volume = "31", number = "2", pages = "61--68", day = "26", month = apr, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q20 (05C05 05C30 68R10 90B10)", MRnumber = "90k:68059", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Chung-Li, Taiwan", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Inst. of Comput. Sci. and Electron. Eng., Nat. Central Univ., Chung-Li, Taiwan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; Chordal Graphs; clique tree counting; Clique Trees; computational complexity; Computer Programming--Algorithms; Computer Systems, Digital--Parallel Processing; Concurrent-Read Concurrent-Write; Concurrent-Read Exclusive-Write; CRCW PRAM; CREW PRAM; directed graphs; Graph Theory; labeled connected chordal graph; Mathematical Techniques; O(log n) parallel computing time; O(log n) time; parallel algorithms; parallel clique tree constructing algorithm; Parallel Random Access Machines; perfect elimination scheme; Perfect Elimination Schemes; theory; trees (mathematics); verification", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees \\ F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism \\ G.1.0 Mathematics of Computing, NUMERICAL ANALYSIS, General, Parallel algorithms", treatment = "T Theoretical or Mathematical", } @Article{Sundar:1989:WDS, author = "Rajamani Sundar", title = "Worst-case data structures for the priority queue with attrition", journal = j-INFO-PROC-LETT, volume = "31", number = "2", pages = "69--75", day = "26", month = apr, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "New York, NY, USA", classification = "723; 922; C4240 (Programming and algorithm theory); C6120 (File organisation)", corpsource = "Courant Inst. of Math. Sci., New York Univ., NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computational complexity; Data Processing; Data Structures; data structures; design; performance; Priority Queue with Attrition; priority queue with attrition; Probability--Queueing Theory; theory; Worst Case Data Structures; worst-case time", subject = "G.m Mathematics of Computing, MISCELLANEOUS, Queueing theory \\ E.1 Data, DATA STRUCTURES", treatment = "T Theoretical or Mathematical", } @Article{Basart:1989:AAT, author = "J. M. Basart and L. Huguet", title = "An approximation algorithm for the {TSP} (travelling salesman problem)", journal = j-INFO-PROC-LETT, volume = "31", number = "2", pages = "77--81", day = "26", month = apr, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "90B10", MRnumber = "90c:90073", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Catalunya, Spain", classification = "723; 921; C1160 (Combinatorial mathematics); C1290 (Applications of systems theory); C4240 (Programming and algorithm theory)", corpsource = "Dept. d'Inf., Univ. Autonoma de Barcelona, Catalunya, Spain", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; approximation algorithm; Approximation Algorithms; comparison tests; computational complexity; Computer Programming; connected vertices; edge-weighted graph; graph algorithm; Graph Algorithms; graph theory; Hamiltonian Circuits; Heuristic Algorithms; Mathematical Programming; Mathematical Techniques--Graph Theory; operations research; polynomial-time heuristic algorithm; theory; Traveling Salesman Problem; travelling salesman problem", subject = "G.1.6 Mathematics of Computing, NUMERICAL ANALYSIS, Optimization \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms \\ G.1.2 Mathematics of Computing, NUMERICAL ANALYSIS, Approximation", treatment = "T Theoretical or Mathematical", } @Article{Ramakrishna:1989:ARP, author = "M. V. Ramakrishna", title = "Analysis of random probing hashing", journal = j-INFO-PROC-LETT, volume = "31", number = "2", pages = "83--90", day = "26", month = apr, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib; UnCover library database", abstract = "Random probing and uniform hashing are theoretical models of hashing schemes based on open addressing such as double hashing. P.-A. Larson provided an asymptotic analysis of random probing hashing with multi-record buckets. His analysis was based on the Poisson approximation to the binomial distribution. The problems of obtaining an exact model and analyzing finite random probing hashing was left open with the mention of the difficulties involved. We address these open problems in this paper. Also, the search performance of full hash tables is analyzed.", acknowledgement = ack-nhfb, affiliation = "Michigan State Univ", affiliationaddress = "East Lansing, MI, USA", classification = "723; 922; C6120 (File organisation)", corpsource = "Dept. of Comput. Sci., Michigan State Univ., East Lansing, MI, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Binomial Distribution; Data Processing; double hashing; Double Hashing; exact model; file organisation; File Organization; finite random probing hashing; full hash tables; measurement; multi-record buckets; open addressing; performance; performance evaluation; Poisson approximation; Probability--Random Processes; random probing hashing; Random Probing Hashing; Search Methods; search performance; theory; uniform hashing", subject = "E.2 Data, DATA STORAGE REPRESENTATIONS, Hash-table representations \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching", treatment = "T Theoretical or Mathematical", } @Article{Burton:1989:NHF, author = "F. Warren Burton", title = "A note on higher-order functions versus logical variables", journal = j-INFO-PROC-LETT, volume = "31", number = "2", pages = "91--95", day = "26", month = apr, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Burnaby, BC, Can", classification = "723; C6110 (Systems analysis and programming); C6120 (File organisation); C6140D (High level languages)", corpsource = "Sch. of Comput. Sci., Simon Fraser Univ., Burnaby, BC, Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Computer Programming Languages; Data Processing--Data Structures; data structure; data structures; Functional Programming; functional programming; functional programming language; Functional Programming Languages; Higher Order Functions; higher-order functions; languages; logic programming; logical variables; theory; Unification; unification", subject = "D.1.1 Software, PROGRAMMING TECHNIQUES, Applicative (Functional) Programming \\ D.3.2 Software, PROGRAMMING LANGUAGES, Language Classifications \\ E.1 Data, DATA STRUCTURES", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Stewart:1989:ACP, author = "Iain A. Stewart", title = "An algorithm for colouring perfect planar graphs", journal = j-INFO-PROC-LETT, volume = "31", number = "2", pages = "97--101", day = "26", month = apr, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q20 (05C15 68R10 90B10)", MRnumber = "90k:68061", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Newcastle upon Tyne, Engl", classification = "723; 921; B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Comput. Lab., Newcastle Upon Tyne Univ., UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; colouring perfect planar graphs; computational complexity; Computer Programming; Graph Algorithms; Graph Coloring; graph colouring; Lipton-Tarjan Separator Algorithm; Mathematical Techniques--Graph Theory; Perfect Graphs; Planar Graphs; recursive; theory", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms", treatment = "T Theoretical or Mathematical", } @Article{Rytter:1989:NOP, author = "Wojciech Rytter", title = "A note on optimal parallel transformations of regular expressions to nondeterministic finite automata", journal = j-INFO-PROC-LETT, volume = "31", number = "2", pages = "103--109", day = "26", month = apr, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q45", MRnumber = "90k:68094", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Coventry, Engl", classification = "721; 723; C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Warwick Univ., Coventry, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; Automata Theory; Computer Systems, Digital--Parallel Processing; Finite Automata; finite automata; homomorphism; log n time; Nondeterministic Finite Automata; nondeterministic finite automata; optimal parallel transformations; parallel algorithms; Parallel Random Access Machines; parallel random-access machine; Parallel Transformations; recursive construction; Regular Expressions; regular expressions; theory; verification", subject = "F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Automata \\ F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism \\ F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Alternation and nondeterminism \\ E.1 Data, DATA STRUCTURES, VAX/VMS", treatment = "T Theoretical or Mathematical", } @Article{Skillicorn:1989:PPC, author = "D. B. Skillicorn and D. T. Barnard", title = "Parallel parsing on the {Connection Machine}", journal = j-INFO-PROC-LETT, volume = "31", number = "3", pages = "111--117", day = "8", month = may, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Kingston, Ont, Can", classification = "721; 723; C4210 (Formal logic); C4240 (Programming and algorithm theory); C6150C (Compilers, interpreters and other processors)", corpsource = "Dept. of Comput. and Inf. Sci., Queen's Univ., Kingston, Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; Automata Theory; computational complexity; Computer Programming--Algorithms; Computer Systems, Digital--Parallel Processing; Connection Machine; Formal Languages; grammars; languages; lexing algorithm; LL(1) grammars; logarithmic time; Parallel Parsing; parallel programming; parsing; program compilers; theory", subject = "F.4.2 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems, Parsing \\ F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Classes defined by grammars or automata \\ F.1.3 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes", treatment = "P Practical", } @Article{Matsuoka:1989:AEW, author = "Satoshi Matsuoka and Tomihisa Kamada and Satoru Kawai", title = "Asymptotic evaluation of window visibility", journal = j-INFO-PROC-LETT, volume = "31", number = "3", pages = "119--126", day = "8", month = may, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory); C6180 (User interfaces)", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "asymptotic evaluation; average size; computational geometry; Computer Graphics; Computer Programming--Algorithms; design; Interval Visibility; measurement; performance; Priority Ordering; theory; total ordering relation; user interfaces; Window Visibility; window visibility", subject = "I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms \\ I.3.m Computing Methodologies, COMPUTER GRAPHICS, Miscellaneous \\ I.6.3 Computing Methodologies, SIMULATION AND MODELING, Applications \\ G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous", treatment = "T Theoretical or Mathematical", } @Article{Tel:1989:CRB, author = "G. Tel and F. Mattern", title = "Comments on {``Ring based termination detection algorithm for distributed computations''} {[Inform. Process. Lett. {\bf 29}(3), 26 October 1988, pp. 149--153]}", journal = j-INFO-PROC-LETT, volume = "31", number = "3", pages = "127--128", day = "8", month = may, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See \cite{Haldar:1988:RBT}.", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Utrecht Univ., Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "algorithm theory; algorithms; distributed computations; distributed processing; distributed systems; system recovery; termination; theory", subject = "I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms \\ D.4.7 Software, OPERATING SYSTEMS, Organization and Design, Distributed systems \\ H.2.4 Information Systems, DATABASE MANAGEMENT, Systems, Distributed systems", treatment = "T Theoretical or Mathematical", } @Article{Shih:1989:MWC, author = "Wei Kuan Shih and Wen-Lian Hsu", title = "An {$O(n \log n + m \log \log n)$} maximum weight clique algorithm for circular-arc graphs", journal = j-INFO-PROC-LETT, volume = "31", number = "3", pages = "129--134", day = "8", month = may, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (05C35 68R10)", MRnumber = "90k:68075", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "China", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Inst. of Inf. Sci., Acad. Sinica, Beijing, China", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm theory; Algorithms; algorithms; bipartite graphs; Bipartite Graphs; Circular Arc Graphs; circular-arc graphs; Computer Programming; graph theory; Mathematical Techniques--Graph Theory; maximum weight clique problem; Maximum Weight Clique Problem; Maximum Weight Independent Sets; verification", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms", treatment = "T Theoretical or Mathematical", } @Article{Bodlaender:1989:ANN, author = "Hans L. Bodlaender", title = "Achromatic number is {NP}-complete for cographs and interval graphs", journal = j-INFO-PROC-LETT, volume = "31", number = "3", pages = "135--138", day = "8", month = may, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (68R10)", MRnumber = "91a:68121", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Utrecht, Neth", classification = "723; 921; B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics)", corpsource = "Dept. of Comput. Sci., Utrecht Univ., Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Achromatic Number Problem; achromatic number problem; Cographs; cographs; Computational Complexity; Computer Metatheory; Connected Graphs; graph colouring; Graph Theory; graph theory; Interval Graphs; interval graphs; Mathematical Techniques; NP Completeness; NP-complete; theory; unlabelled graphs; verification", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory \\ F.1.3 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Reducibility and completeness", treatment = "T Theoretical or Mathematical", } @Article{Tsitsiklis:1989:URN, author = "John N. Tsitsiklis", title = "On the use of random numbers in asynchronous simulation via rollback", journal = j-INFO-PROC-LETT, volume = "31", number = "3", pages = "139--144", day = "8", month = may, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Cambridge, MA, USA", classification = "723; 922; C1220 (Simulation, modelling and identification); C7000 (Computer applications)", corpsource = "Lab. for Inf. and Decision Syst., MIT, Cambridge, MA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; Asynchronous Simulation; asynchronous simulation; Computer Simulation; Computer Systems, Digital--Distributed; digital simulation; discrete event simulation; performance; Probability--Random Processes; Random Numbers; random numbers; Rollback; rollback; sample path; stochastic system; stochastic systems; theory", subject = "C.2.4 Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Distributed Systems \\ C.4 Computer Systems Organization, PERFORMANCE OF SYSTEMS", treatment = "T Theoretical or Mathematical", } @Article{Leung:1989:PRP, author = "Joseph Y.-T. Leung", title = "Bin packing with restricted piece sizes", journal = j-INFO-PROC-LETT, volume = "31", number = "3", pages = "145--149", day = "8", month = may, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (68R05 90C27)", MRnumber = "91a:68133", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Richardson, TX, USA", classification = "723; 921; C1290 (Applications of systems theory); C4240 (Programming and algorithm theory)", corpsource = "Comput. Sci. Program, Texas Univ. at Dallas, Richardson, TX, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm theory; Algorithms; Approximation Algorithms; Bin Packing Problems; bin-packing problems; Computational Complexity; Computer Metatheory; Computer Programming; epsilon-approximation scheme; languages; Mathematical Techniques--Combinatorial Mathematics; Multiprocessor Scheduling; multiprocessor scheduling problem; NP Hardness; operations research; polynomial time; power set; rational number; restricted piece sizes; running time; scheduling; theory; verification", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Routing and layout \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sequencing and scheduling \\ G.1.2 Mathematics of Computing, NUMERICAL ANALYSIS, Approximation", treatment = "T Theoretical or Mathematical", } @Article{Lentfert:1989:DSR, author = "Patrick Lentfert and Mark H. Overmars", title = "Data structures in a real-time environment", journal = j-INFO-PROC-LETT, volume = "31", number = "3", pages = "151--155", day = "8", month = may, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68P05", MRnumber = "90k:68024", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Utrecht, Neth", classification = "723; C6120 (File organisation)", corpsource = "Dept. of Comput. Sci., Utrecht Univ., Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Data Processing; data structure; Data Structures; data structures; Database Systems; k-th element; Kth Element Searching; Maximum Searching; member queries; Member Searching; nearest neighbor queries; Nearest Neighbor Searching; query problems; range queries; Range Searching; rank queries; Real Time Computing; real-time environment; real-time systems; theory; updates; verification", subject = "E.1 Data, DATA STRUCTURES \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching \\ C.3 Computer Systems Organization, SPECIAL-PURPOSE AND APPLICATION-BASED SYSTEMS, Real-time systems", treatment = "P Practical", } @Article{Cheriyan:1989:PCF, author = "J. Cheriyan and S. N. Maheshwari", title = "The parallel complexity of finding a blocking flow in a $3$-layer network", journal = j-INFO-PROC-LETT, volume = "31", number = "3", pages = "157--161", day = "8", month = may, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (90B35)", MRnumber = "90k:68065", MRreviewer = "G{\"u}nther Ruhe", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Bombay, India", classification = "723; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Tata Inst. of Fundamental Res., Bombay, India", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "3-layer network; acyclic networks; algorithms; Blocking Flow; blocking flow; computational complexity; Computer Metatheory; Computer Programming--Algorithms; Computer Systems, Digital--Parallel Processing; CREW-PRAM model; diagraphs; graph theory; layered networks; lex-first blocking flow; Parallel Algorithms; parallel algorithms; parallel complexity; Random Algorithms; theory; Three Layer Networks; verification", subject = "G.1.0 Mathematics of Computing, NUMERICAL ANALYSIS, General, Parallel algorithms \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Network problems \\ F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism", treatment = "T Theoretical or Mathematical", } @Article{Beaudry:1989:CIT, author = "Martin Beaudry", title = "Characterization of idempotent transformation monoids", journal = j-INFO-PROC-LETT, volume = "31", number = "3", pages = "163--166", day = "8", month = may, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "20M07 (20M35 68Q15)", MRnumber = "90m:20069", MRreviewer = "Heinrich Seidel", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Sherbrooke, Que, Can", classification = "721; 723; C4220 (Automata theory)", corpsource = "Dept. de Math. et d'Inf., Sherbrooke, Univ., Que., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; Aperiodic Monoids; Automata Theory; automata theory; automaton; Computational Complexity; computational complexity; Computer Metatheory; idempotent transformation monoids; membership problem; NP-complete; polynomial time; test-transformation; theory; Transformation Monoids; verification", subject = "F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Automata \\ G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous \\ F.2.1 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Computation of transforms", treatment = "T Theoretical or Mathematical", } @Article{Gregori:1989:ULE, author = "Angelo Gregori", title = "Unit-length embedding of binary trees on a square grid", journal = j-INFO-PROC-LETT, volume = "31", number = "4", pages = "167--173", day = "22", month = may, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (68R10)", MRnumber = "90k:68068", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Pisa, Italy", classification = "921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dipartimento di Inf., Pisa Univ., Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Binary Trees; binary trees; building block; computational complexity; design; edges; Graph Embedding; Graph Theory; Grid Embedding; grid embedding; Integrated Circuits, VLSI--layout; Mathematical Techniques; NP Completeness; NP-complete problem; proof; square grid; theory; trees (mathematics); U-tree; unit-length embedding; verification", subject = "G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous \\ B.7.2 Hardware, INTEGRATED CIRCUITS, Design Aids, Layout \\ F.1.3 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Reducibility and completeness", treatment = "T Theoretical or Mathematical", } @Article{Wu:1989:FAD, author = "Xiaolin Wu", title = "Fast approximations to discrete optimal quantization", journal = j-INFO-PROC-LETT, volume = "31", number = "4", pages = "175--179", day = "22", month = may, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Lethbridge, Alberta, Can", classification = "723; 921; C4130 (Interpolation and function approximation); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Math. Sci., Lethbridge Univ., Alta., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; approximate; approximation theory; computational complexity; Computer Programming; Discrete Optimal Quantization; discrete optimal quantization; Information Theory--Data Compression; low time complexities; Mathematical Techniques--Approximation Theory; optimal bilevel quantizers; optimal K-level quantizer; Optimization; performance; Recursive Approximation; Signal Processing--Digital Techniques; theory; verification; well-behaved discrete densities", subject = "G.4 Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm analysis \\ I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms \\ G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous", treatment = "T Theoretical or Mathematical", } @Article{Chlebus:1989:PIB, author = "Bogdan S. Chlebus", title = "Parallel iterated bucket sort", journal = j-INFO-PROC-LETT, volume = "31", number = "4", pages = "181--183", day = "22", month = may, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68P10", MRnumber = "90m:68023", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Warsaw, Pol", classification = "723; C1160 (Combinatorial mathematics); C4130 (Interpolation and function approximation); C4240 (Programming and algorithm theory)", corpsource = "Inst. Inf., Warsaw Univ., Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; Computer Programming--Algorithms; Computer Systems Programming; Computer Systems, Digital--Parallel Processing; Concurrent-Read Concurrent-Write; CRCW PRAM; Integer Sorting; integers; Iterated Bucket Sort; iterated bucket sort; iterative methods; parallel algorithm; Parallel Algorithms; parallel algorithms; Parallel Random Access Machines; polynomial range; probability; Sorting; sorting; Sorting Algorithms; theory; verification", subject = "G.1.0 Mathematics of Computing, NUMERICAL ANALYSIS, General, Parallel algorithms \\ F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism \\ I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms \\ G.4 Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm analysis", treatment = "T Theoretical or Mathematical", } @Article{Malhotra:1989:IDB, author = "Vishv Mohan Malhotra and Tang Van To and Kanchana Kanchanasut", title = "An improved data-dependency-based backtracking scheme for {Prolog}", journal = j-INFO-PROC-LETT, volume = "31", number = "4", pages = "185--189", day = "22", month = may, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Bangkok, Thail", classification = "723; C4240 (Programming and algorithm theory); C6140D (High level languages)", corpsource = "Div. of Comput. Sci., AIT, Bangkok, Thailand", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; clause-head; Computer Programming Languages; Computer Programming--Algorithms; contributing goals; Data-Dependency; data-dependency-based backtracking scheme; Intelligent Backtracking; logic programming; programming theory; Prolog; PROLOG; Prolog; theory; Warren Abstract Machine", subject = "I.2.5 Computing Methodologies, ARTIFICIAL INTELLIGENCE, Programming Languages and Software, Prolog \\ I.2.8 Computing Methodologies, ARTIFICIAL INTELLIGENCE, Problem Solving, Control Methods, and Search, Backtracking", treatment = "T Theoretical or Mathematical", } @Article{Goldman:1989:SEG, author = "Sally A. Goldman", title = "A space efficient greedy triangulation algorithm", journal = j-INFO-PROC-LETT, volume = "31", number = "4", pages = "191--196", day = "22", month = may, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68U05 (68Q25)", MRnumber = "91a:68266", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Cambridge, MA, USA", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Lab. for Comput. Sci., MIT, Cambridge, MA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; computational complexity; Computational Geometry; computational geometry; Computer Programming; edge; Generalized Delaunay Triangulation; generalized Delaunay triangulation; Greedy Triangulation; Mathematical Techniques--Geometry; plane; points; simple polygon; space efficient greedy triangulation algorithm; theory; verification", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations \\ G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous", treatment = "T Theoretical or Mathematical", } @Article{Varma:1989:FRU, author = "Anujan Varma", title = "Fault-tolerant routing in unique-path multistage interconnection networks", journal = j-INFO-PROC-LETT, volume = "31", number = "4", pages = "197--201", day = "22", month = may, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Yorktown Heights, NY, USA", classification = "722; 723; C4230 (Switching theory); C5440 (Multiprocessor systems and techniques); C5470 (Performance evaluation and testing)", corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "communication; Computer Systems, Digital; correct destination; design; extra pass; fault tolerant computing; Fault Tolerant Routing; fault-tolerant routing; faulty elements; incorrect destination; intermittent faults; message routing; Multiprocessing; multiprocessor interconnection networks; multiprocessor system; Multistage Interconnection Networks; Parallel Processing; permanent faults; theory; Tightly Coupled Multiprocessors; transparent; unique-path multistage interconnection networks", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Routing and layout \\ C.1.2 Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors), Interconnection architectures", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Mattern:1989:EDT, author = "Friedemann Mattern", title = "An efficient distributed termination test", journal = j-INFO-PROC-LETT, volume = "31", number = "4", pages = "203--208", day = "22", month = may, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Kaiserslautern, West Ger", classification = "723; B6150 (Communication system theory); B6210 (Telecommunication applications); C4240 (Programming and algorithm theory); C5620 (Computer networks and techniques)", corpsource = "Dept. of Comput. Sci., Kaiserslautern Univ., West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "acknowledgement; active; algorithms; basic messages; Communicating Sequential Processes; Computer Metatheory; Computer Programming--Algorithms; CSP; design; distributed processing; distributed termination detection algorithms; Distributed Termination Test; efficient distributed termination test; message switching; one-bit status information; passive; Programming Theory; synchronous message; Termination Detection; theory", subject = "G.m Mathematics of Computing, MISCELLANEOUS \\ I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms", treatment = "T Theoretical or Mathematical", } @Article{Carson:1989:EBD, author = "Scott D. Carson and Paul Vongsathorn", title = "Error bounds on disk arrangement using frequency information", journal = j-INFO-PROC-LETT, volume = "31", number = "4", pages = "209--213", day = "22", month = may, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "College Park, MD, USA", classification = "723; 921; C4110 (Error analysis in numerical methods); C4240 (Programming and algorithm theory); C6150J (Operating systems)", corpsource = "Dept. of Comput. Sci., Inst. for Adv. Comput. Studies, Maryland Univ., College Park, MD, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computational complexity; Computer Operating Systems; design; Disk Arrangement; disk arrangement; Disk Storage; error analysis; Error Bounds; error bounds; expected seek time; Frequency Information; frequency information; information arrangement; management; Mathematical Techniques--Combinatorial Mathematics; moving-head disk; operating systems (computers); polynomial time; Storage Allocation; theory", subject = "D.4.2 Software, OPERATING SYSTEMS, Storage Management \\ D.4.3 Software, OPERATING SYSTEMS, File Systems Management \\ G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous", treatment = "T Theoretical or Mathematical", } @Article{Hochbaum:1989:AMW, author = "Dorit S. Hochbaum and Ron Shamir", title = "An {$O(n\,\log ^2n)$} algorithm for the maximum weighted tardiness problem", journal = j-INFO-PROC-LETT, volume = "31", number = "4", pages = "215--219", day = "22", month = may, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "90B35 (68Q25)", MRnumber = "90d:90041", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Berkeley, CA, USA", classification = "723; C1180 (Optimisation techniques); C4240 (Programming and algorithm theory)", corpsource = "Sch. of Bus. Adm., California Univ., Berkeley, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; computational complexity; computational geometry; Computer Programming; Data Processing--Data Structures; data structure; design; Maximum Weighted Tardiness Problem; maximum weighted tardiness problem; minimisation; minimization; scheduling; scheduling problem; Sequential Processing; theory; verification", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sequencing and scheduling \\ I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations \\ G.4 Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm analysis \\ E.1 Data, DATA STRUCTURES", treatment = "T Theoretical or Mathematical", } @Article{Ramanan:1989:ACA, author = "Prakash Ramanan", title = "Average-case analysis of the smart next fit algorithm", journal = j-INFO-PROC-LETT, volume = "31", number = "5", pages = "221--225", day = "12", month = jun, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (68R05)", MRnumber = "90k:68072", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Santa Barbara, CA, USA", classification = "723; 921; C4240 (Programming and algorithm theory); C6150J (Operating systems)", corpsource = "Dept. of Comput. Sci., California Univ., Santa Barbara, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; approximation theory; Average-Case Performance; average-case performance; Bin Packing Problem; computational complexity; Mathematical Techniques; online algorithms; online bin packing; Optimization; performance; smart next fit algorithm; Smart Next Fit Algorithms; storage allocation; theory", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Routing and layout \\ I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms", treatment = "T Theoretical or Mathematical", } @Article{Casas:1989:ACA, author = "R. Casas and J. Diaz and J. M. Steyaert", title = "Average-case analysis of {Robinson}'s unification algorithm with two different variables", journal = j-INFO-PROC-LETT, volume = "31", number = "5", pages = "227--232", day = "12", month = jun, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68T15 (03B35 68Q25)", MRnumber = "90k:68148", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Barcelona, Spain", classification = "723; 921; C1160 (Combinatorial mathematics); C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Dept. Llenguatges i Sistemes Inf., Univ. Politecnica Catalunya, Barcelona, Spain", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; average case analysis; average complexity; Average-Case Analysis; binary functions; Complexity of Algorithms; computational complexity; Computer Programming; formal logic; Mathematical Techniques--Trees; performance; Robinson; theory; trees; trees (mathematics); unifiable instances; Unification Algorithm; unification algorithm", subject = "G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous \\ G.4 Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm analysis", treatment = "T Theoretical or Mathematical", } @Article{Bermudez:1989:SCL, author = "Manuel E. Bermudez and George Logothetis", title = "Simple computation of {LALR}(1) lookahead sets", journal = j-INFO-PROC-LETT, volume = "31", number = "5", pages = "233--238", day = "12", month = jun, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Gainesville, FL, USA", classification = "721; 722; 723; 921; C1160 (Combinatorial mathematics); C4210 (Formal logic); C4220 (Automata theory)", corpsource = "Comput. and Inf. Sci., Florida Univ., Gainesville, FL, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; Automata Theory; automata theory; Computer Operating Systems--Program Compilers; Context Free Grammars; context-free grammar; context-free grammars; Follow Sets; follow sets; graph algorithms; graph theory; LALR(1) algorithms; LALR(1) lookahead sets; languages; LR(0) automaton; Mathematical Techniques--Algorithms; Parsers; set theory; theory", subject = "F.4.2 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems, Grammar types \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms", treatment = "T Theoretical or Mathematical", } @Article{Head:1989:DIR, author = "Tom Head", title = "Deciding the immutability of regular codes and languages under finite transductions", journal = j-INFO-PROC-LETT, volume = "31", number = "5", pages = "239--241", day = "12", month = jun, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q45", MRnumber = "90k:68086", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Binghamton, NY, USA", classification = "721; 723; 731; C4210 (Formal logic); C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Math. Sci., State Univ. of New York, Binghamton, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Automata Theory; binary relation; character transitions; Codes, Symbolic; Computability and Decidability; computational complexity; decidability; finite automata; finite codes; finite transducer; finite transductions; formal languages; immutability; Immutability of Codes; languages; polynomial-time decision procedure; regular codes; Regular Languages; regular languages; theory", subject = "F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Operations on languages \\ E.4 Data, CODING AND INFORMATION THEORY, Data compaction and compression \\ G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous", treatment = "T Theoretical or Mathematical", } @Article{Olariu:1989:SLT, author = "Stephan Olariu", title = "A simple linear-time algorithm for computing the {RNG} and {MST} of unimodal polygons", journal = j-INFO-PROC-LETT, volume = "31", number = "5", pages = "243--247", day = "12", month = jun, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68U05", MRnumber = "91b:68116", MRreviewer = "Peter Shor", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Norfolk, VA, USA", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory); C4290 (Other computer theory)", corpsource = "Dept. of Comput. Sci., Old Dominion Univ., Norfolk, VA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; computational complexity; Computational Geometry; computational geometry; Computer Programming--Algorithms; convex polygon; Euclidian minimum spanning tree; linear-time algorithm; Mathematical Techniques; MST; RNG; theory; trees; trees (mathematics); Unimodal Polygons; unimodal polygons; verification", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations \\ I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms \\ G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous", treatment = "T Theoretical or Mathematical", } @Article{Khuller:1989:CGC, author = "Samir Khuller", title = "On computing graph closures", journal = j-INFO-PROC-LETT, volume = "31", number = "5", pages = "249--255", day = "12", month = jun, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q20 (05C99)", MRnumber = "90g:68051", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Ithaca, NY, USA", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; computational complexity; Computer Programming--Algorithms; F-heaps; Graph Closures; graph closures; Graph Theory; graph theory; log-space transformations; Mathematical Techniques; P-complete; P-Completeness; theory; verification", subject = "G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous", treatment = "T Theoretical or Mathematical", } @Article{Feinberg:1989:CSP, author = "Ellen B. Feinberg", title = "Characterizing the shortest path of an object among obstacles", journal = j-INFO-PROC-LETT, volume = "31", number = "5", pages = "257--264", day = "12", month = jun, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68U05 (90B10)", MRnumber = "90g:68136", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Holmdel, NJ, USA", classification = "731; 921; C1180 (Optimisation techniques); C4290 (Other computer theory)", corpsource = "AT and T Bell Labs., Holmdel, NJ, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; Computational Geometry; computational geometry; Mathematical Techniques--Algorithms; minimisation; Motion Planning; Optimization--Applications; polygonal obstacles; Robotics; shortest path; Shortest Paths; theory; verification", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Path and circuit problems \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations", treatment = "T Theoretical or Mathematical", } @Article{Goldberg:1989:PAF, author = "Andrew V. Goldberg and Robert E. Tarjan", title = "A parallel algorithm for finding a blocking flow in an acyclic network", journal = j-INFO-PROC-LETT, volume = "31", number = "5", pages = "265--271", day = "12", month = jun, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (68Q22 68R10 90B10)", MRnumber = "91f:68085", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Stanford, CA, USA", classification = "721; 722; 723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Stanford Univ., CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "acyclic network; algorithms; Analysis of Algorithms; blocking flow; computational complexity; Computer Programming--Algorithms; Computer Systems, Digital--Parallel Processing; Computers, Digital--Computational Methods; directed graphs; EREW PRAM; Graph Theory; integer arc capacities; Mathematical Techniques; minimum-cost circulation; Minimum-Cost Flow Problem; parallel algorithm; parallel algorithms; Parallel Computing; theory; verification", subject = "G.1.0 Mathematics of Computing, NUMERICAL ANALYSIS, General, Parallel algorithms \\ I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms \\ G.4 Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm analysis \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Network problems", treatment = "T Theoretical or Mathematical", } @Article{Falkowski:1989:SPP, author = "Bernd-J{\"u}rgen J. Falkowski", title = "A self-optimizing {Prolog} program and the underlying statistical model", journal = j-INFO-PROC-LETT, volume = "31", number = "5", pages = "273--276", day = "12", month = jun, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Munich, West Ger", classification = "723; 922; C4240 (Programming and algorithm theory); C6110 (Systems analysis and programming); C6150C (Compilers, interpreters and other processors)", corpsource = "GSE Gesellschaft f{\"u}r Software-Eng. mbH, Munchen, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "compilers; Computer Programming; Computer Programming Languages; expert database system; languages; Logic Programming; logic programming; optimisation; program compilers; programming theory; PROLOG; Prolog Programs; self modifying program; self-optimizing Prolog program; Selfmodifying Program; Statistical Methods; statistical model; statistics; Tektronix workstation; theory; verification", subject = "I.2.3 Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Logic programming \\ G.3 Mathematics of Computing, PROBABILITY AND STATISTICS, Statistical computing \\ I.2.5 Computing Methodologies, ARTIFICIAL INTELLIGENCE, Programming Languages and Software, Prolog", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Staalmarck:1989:NCC, author = "Gunnar St{\aa}lmarck", title = "A note on the computational complexity of the pure classical implication calculus", journal = j-INFO-PROC-LETT, volume = "31", number = "6", pages = "277--278", day = "19", month = jun, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "03B05 (03D15 68Q15)", MRnumber = "90j:03011", MRreviewer = "E. Dantzin", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Alvsjo, Swed", classification = "723; C1230 (Artificial intelligence); C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Ellemtel Telecommun. Syst. Labs., Alvsjo, Sweden", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "classical propositional logic; computational complexity; Computational Complexity; Computer Metatheory; formal logic; Implication Calculus; negation-free formula; new defining atoms; NP Completeness; polynomial time bounded reduction; Propositional Logic; provability; pure classical implication calculus; reductions; Satisfiability Problem; theorem proving; theory; verification", subject = "F.1.3 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes \\ I.2.3 Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving", treatment = "T Theoretical or Mathematical", } @Article{Nagamochi:1989:MFM, author = "Hiroshi Nagamochi and Toshihide Ibaraki", title = "On max-flow min-cut and integral flow properties for multicommodity flows in directed networks", journal = j-INFO-PROC-LETT, volume = "31", number = "6", pages = "279--285", day = "19", month = jun, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "90B10", MRnumber = "90g:90065", MRreviewer = "D. de Werra", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Toyohashi, Jpn", classification = "921; C1160 (Combinatorial mathematics); C1180 (Optimisation techniques); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Inf. and Comput. Sci., Toyohashi Univ. of Technol., Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computability; directed graphs; directed networks; Directed Networks; economics; Graph Theory; Integral Flow Properties; integral flow property; linear programming; Mathematical Programming, Linear; Mathematical Techniques; Max Flow Min Cut Property; max-flow min-cut property; multicommodity flow problem; Multicommodity Flows; theory; verification", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Network problems \\ J.4 Computer Applications, SOCIAL AND BEHAVIORAL SCIENCES, Economics \\ J.2 Computer Applications, PHYSICAL SCIENCES AND ENGINEERING, Engineering", treatment = "T Theoretical or Mathematical", } @Article{Foster:1989:PAH, author = "Dean P. Foster and Rakesh V. Vohra", title = "Probabilistic analysis of a heuristics for the dual bin packing problem", journal = j-INFO-PROC-LETT, volume = "31", number = "6", pages = "287--290", day = "19", month = jun, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (68R05 90B05 90C10)", MRnumber = "90g:68061", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Chicago, IL, USA", classification = "921; 922; C1140Z (Other and miscellaneous); C1290 (Applications of systems theory); C4240 (Programming and algorithm theory)", corpsource = "Graduate Sch. of Bus., Chicago Univ., IL, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Combinatorial Mathematics; Computer Systems, Digital--Parallel Processing; Dual Bin Packing Problem; dual bin packing problem; First Fit Increasing; first fit increasing heuristics; Heuristics; job scheduling; Mathematical Techniques; on-line variant; operations research; parallel processing; probabilistic behavior; Probability; probability; relative error; theory; verification", subject = "F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Probabilistic computation \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Routing and layout", treatment = "T Theoretical or Mathematical", } @Article{Yoccoz:1989:RRP, author = "Serge Yoccoz", title = "Recursive $\omega$-rule for proof systems", journal = j-INFO-PROC-LETT, volume = "31", number = "6", pages = "291--294", day = "19", month = jun, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q60 (03B70)", MRnumber = "90k:68112", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Talence, Fr", classification = "723; C1230 (Artificial intelligence); C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "CNRS, Bordeaux I Univ., Talence, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm theory; Algorithmic Logic; algorithmic logic; algorithms; Computer Metatheory; Computer Programming--Algorithms; computer science; formal logic; infinitary rules; Proof Systems; proof systems; recursive; recursive functions; Recursive Omega Rule; theorem proving; theory; verification", subject = "I.1.m Computing Methodologies, ALGEBRAIC MANIPULATION, Miscellaneous \\ F.4.1 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Computability theory", treatment = "T Theoretical or Mathematical", } @Article{Mukkamala:1989:SPV, author = "Ravi Mukkamala", title = "Some properties of view-based replication control algorithms for distributed systems", journal = j-INFO-PROC-LETT, volume = "31", number = "6", pages = "295--298", day = "19", month = jun, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68P15", MRnumber = "90g:68035", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Norfolk, VA, USA", classification = "723; C4250 (Database theory); C6160B (Distributed DBMS)", corpsource = "Dept. of Comput. Sci., Old Dominion Univ., Norfolk, VA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; Computer Programming--Algorithms; consistency; Data Consistency; data integrity; Database Systems; Distributed; distributed databases; distributed systems; management; Replicated Resources; replicated resources; Replication Control Algorithms; theory; Update Operations; update operations; verification; View Based Algorithms; view-based replication control algorithms", subject = "H.2.4 Information Systems, DATABASE MANAGEMENT, Systems, Distributed systems", treatment = "T Theoretical or Mathematical", } @Article{Bertolazzi:1989:DSV, author = "Paola Bertolazzi and Antonio Sassano", title = "A decomposition strategy for the vertex cover problem", journal = j-INFO-PROC-LETT, volume = "31", number = "6", pages = "299--304", day = "19", month = jun, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "05C70 (68Q25 68R10 90C10)", MRnumber = "90g:05138", MRreviewer = "Karl Weber", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Rome, Italy", classification = "921; C1180 (Optimisation techniques); C4240 (Programming and algorithm theory)", corpsource = "Istituto di Analisi dei Sistemi e Inf., CNR, Roma, Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Chordal Graphs; chordal graphs; Clutters; clutters; computability; Decomposition Strategy; decomposition strategy; Graph Theory; graph theory; Mathematical Techniques; minimum weight vertex cover; polynomial function; polynomially solvable; set theory; stable set; Stable Sets; theory; verification; Vertex Cover Problem; vertex cover problem", subject = "G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous", treatment = "T Theoretical or Mathematical", } @Article{Czaja:1989:FPC, author = "Ludwik Czaja", title = "Finite processes in cause-effect structures and their composition", journal = j-INFO-PROC-LETT, volume = "31", number = "6", pages = "305--310", day = "19", month = jun, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q10 (68Q90)", MRnumber = "91a:68074", MRreviewer = "Jetty Kleijn", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Warsaw, Pol", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Inst. of Inf., Warsaw Univ., Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "c-e structures; Cause-Effect Structures; cause-effect structures; Computer Metatheory; Computer Systems, Digital--Distributed; Concurrency; concurrent systems; Finite Processes; graph theory; Mathematical Techniques--Graph Theory; parallel composition operator; parallel processing; partial sequence of occurrences; state transition rule; theory; verification", subject = "D.4.1 Software, OPERATING SYSTEMS, Process Management, Concurrency \\ F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism \\ G.m Mathematics of Computing, MISCELLANEOUS", treatment = "T Theoretical or Mathematical", } @Article{Aggarwal:1989:CCB, author = "Alok Aggarwal and Michael Hawrylycz", title = "On computing the closest boundary point on the convex hull", journal = j-INFO-PROC-LETT, volume = "31", number = "6", pages = "311--314", day = "19", month = jun, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68U05 (52-04)", MRnumber = "91a:68257", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Yorktown Heights, NY, USA", classification = "723; 921; C1180 (Optimisation techniques); C4240 (Programming and algorithm theory); C4290 (Other computer theory)", corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; Closest Boundary Point; closest boundary point; computational complexity; Computational Geometry; computational geometry; Computer Programming--Algorithms; Convex Hull; convex hull; Geometric Algorithms; Geometry; Mathematical Techniques; Optimal Bounds; theory; Upper Bounds; verification", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations", treatment = "T Theoretical or Mathematical", } @Article{Carlsson:1989:NCD, author = "Svante Carlsson and Jingsen Chen and Thomas Strothotte", title = "A note on the construction of the data structure ``deap''", journal = j-INFO-PROC-LETT, volume = "31", number = "6", pages = "315--317", day = "19", month = jun, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68P05", MRnumber = "91a:68033", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Lund, Swed", classification = "723; 922; C4240 (Programming and algorithm theory); C6120 (File organisation)", corpsource = "Dept. of Comput. Sci., Lund Univ., Sweden", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "complexity analysis; Computational Complexity; computational complexity; Computer Programming--Algorithms; Data Processing; Data Structures; data structures; deap; Deaps; Double Ended Priority Queues; double-ended priority queue; Heaps; lower bound; min-max heaps; Priority Deques; Probability--Queueing Theory; theory; verification", subject = "G.m Mathematics of Computing, MISCELLANEOUS, Queueing theory \\ E.1 Data, DATA STRUCTURES", treatment = "T Theoretical or Mathematical", } @Article{Bloniarz:1989:LBD, author = "Peter A. Bloniarz and S. S. Ravi", title = "An {$\Omega (n \log n)$} lower bound for decomposing a set of points into chains", journal = j-INFO-PROC-LETT, volume = "31", number = "6", pages = "319--322", day = "19", month = jun, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (68R05)", MRnumber = "90k:68063", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Albany, NY, USA", classification = "723; 921; C4240 (Programming and algorithm theory); C4290 (Other computer theory)", corpsource = "Dept. of Comput. Sci., State Univ. of New York, Albany, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algebraic decision trees; Algorithms; Chains; computational complexity; computational geometry; Computer Programming; Decision Trees; fixed order algebraic computation tree model; Fixed Orders; k-chain problem; lower bound; Lower Bounds; Mathematical Techniques--Trees; O(n) time; Partial Order; partial order; theory; upper bound; verification", subject = "I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms \\ G.4 Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm analysis \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory", treatment = "T Theoretical or Mathematical", } @Article{Eisinger:1989:NCR, author = "Norbert Eisinger", title = "A note on the completeness of resolution without self-resolution", journal = j-INFO-PROC-LETT, volume = "31", number = "6", pages = "323--326", day = "19", month = jun, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "03B35 (68T15)", MRnumber = "90e:03013", MRreviewer = "Mao Kang Wu", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Kaiserslautern, West Ger", classification = "723; C1230 (Artificial intelligence); C4210 (Formal logic)", corpsource = "Fachbereich Inf., Kaiserslautern Univ., West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Artificial Intelligence; Automated Deduction; automated deduction; Completeness; refutation completeness; Resolution Calculus; resolution calculus; resolution-based deduction systems; Theorem Proving; theorem proving; theory; verification", subject = "I.2.3 Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Resolution", treatment = "T Theoretical or Mathematical", } @Article{Allison:1989:DSE, author = "Lloyd Allison", title = "Direct semantics and exceptions define jumps and coroutines", journal = j-INFO-PROC-LETT, volume = "31", number = "6", pages = "327--330", day = "19", month = jun, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Clayton, Aust", classification = "723; C4210 (Formal logic)", corpsource = "Dept. of Comput. Sci., Monash Univ., Clayton, Vic., Australia", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Computer Metatheory; Computer Programming Languages; Coroutines; coroutines; Denotational Semantics; denotational semantics; Direct Semantics; direct semantics; exceptions; formal languages; Jumps; jumps; Lambda Calculus; lambda-calculus; language features; languages; sequencers; theory; Theory", subject = "F.3.2 Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Denotational semantics", treatment = "T Theoretical or Mathematical", } @Article{Damaschke:1989:HCP, author = "Peter Damaschke", title = "The {Hamiltonian} circuit problem for circle graphs is {NP}-complete", journal = j-INFO-PROC-LETT, volume = "32", number = "1", pages = "1--2", day = "3", month = jul, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (05C45 68R10 90B10)", MRnumber = "90k:68066", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Jena, East Ger", classification = "921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Sektion Math., Friedrich-Schiller-Univ. Jena, East Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "chords; Circle Graphs; circle graphs; computability; computational complexity; Graph Theory; graph theory; Hamiltonian circuit problem; Hamiltonian Circuits; Intersection Graphs; intersection graphs; Mathematical Techniques; NP Completeness; NP-complete; theory", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Path and circuit problems \\ F.1.3 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Reducibility and completeness", treatment = "T Theoretical or Mathematical", } @Article{Sarkar:1989:OPC, author = "Dilip Sarkar and Ivan Stojmenovi{\'c}", title = "An optimal parallel circle-cover algorithm", journal = j-INFO-PROC-LETT, volume = "32", number = "1", pages = "3--6", day = "3", month = jul, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68U05 (68Q25)", MRnumber = "90k:68173", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Coral Gables, FL, USA", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Math. and Comput. Sci., Miami Univ., Coral Gables, FL, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; combinatorial mathematics; computational complexity; computational geometry; Computer Programming; Computer Systems, Digital--Parallel Processing; Concurrent Read Concurrent Write; crew pram; CREW PRAM model; graph theory; Mathematical Techniques--Combinatorial Mathematics; minimum number of circular arcs; O(log n) time; O(n) processors; O(n) space; optimal parallel algorithm; optimal parallel circle-cover algorithm; parallel algorithms; Parallel Random Access Machines; theory", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms \\ G.1.0 Mathematics of Computing, NUMERICAL ANALYSIS, General, Parallel algorithms \\ I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations", treatment = "T Theoretical or Mathematical", } @Article{Gunther:1989:PIM, author = "Neil Gunther", title = "Path integral methods for computer performance analysis", journal = j-INFO-PROC-LETT, volume = "32", number = "1", pages = "7--13", day = "3", month = jul, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Palo Alto, CA, USA", classification = "722; 723; 922; C1140C (Queueing theory); C4290 (Other computer theory); C5470 (Performance evaluation and testing); C6120 (File organisation); C6150J (Operating systems)", corpsource = "Comput. Sci. Lab., Xerox Palo Alto Res. Center, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer performance analysis; Computers, Digital; critical behavior; Feynman Path Integral; Feynman path integral; induced metastable state lifetime; instability transients; measurement; metastability; performance; Performance; performance evaluation; Performance Modeling; Probability--Queueing Theory; queueing model; queueing theory; stability; theory; unstable states; virtual memory; virtual storage", subject = "G.4 Mathematics of Computing, MATHEMATICAL SOFTWARE, Portability \\ G.m Mathematics of Computing, MISCELLANEOUS, Queueing theory \\ C.4 Computer Systems Organization, PERFORMANCE OF SYSTEMS, Modeling techniques", treatment = "T Theoretical or Mathematical", } @Article{Matousek:1989:OCC, author = "Ji{\v{r}}{\'\i} Matou{\v{s}}ek", title = "On-line computation of convolutions", journal = j-INFO-PROC-LETT, volume = "32", number = "1", pages = "15--16", day = "3", month = jul, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Prague, Czech", classification = "723; 921; C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Charles Univ., Praha, Czechoslovakia", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; canonical decomposition; canonical intervals; commutative ring; computational complexity; computational geometry; Computer Programming; convolution; Convolutions; Mathematical Techniques; number sequences; on-line computation; online computation; theory", subject = "G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous \\ F.2.1 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Computation of transforms", treatment = "T Theoretical or Mathematical", } @Article{Sistla:1989:VCP, author = "A. P. Sistla", title = "On verifying that a concurrent program satisfies a nondeterministic specification", journal = j-INFO-PROC-LETT, volume = "32", number = "1", pages = "17--23", day = "3", month = jul, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q60 (03B70)", MRnumber = "90k:68110", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Waltham, MA, USA", classification = "721; 723; C4220 (Automata theory); C4240 (Programming and algorithm theory); C6110B (Software engineering techniques)", corpsource = "Comput. and Intelligent Syst. Lab., GTE Labs. Incorp., Waltham, MA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Automata Theory; automata theory; Computer Metatheory; concurrent program; Concurrent Programs; correctness specification; Correctness Specifications; formal specification; infinite-state nondeterministic omega-automaton; nondeterministic Buchi automaton; Nondeterministic Omega Automata; nondeterministic specification; parallel program verification; parallel programming; Pi /sub 2//sup 1/-complete; program verification; Programming Theory; proof system; theory; verification", subject = "D.1.3 Software, PROGRAMMING TECHNIQUES, Concurrent Programming \\ F.3.1 Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs \\ F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Alternation and nondeterminism", treatment = "T Theoretical or Mathematical", } @Article{Iwano:1989:IGP, author = "Kazuo Iwano", title = "An improvement of {Goldberg}, {Plotkin} and {Vaidya}'s maximal node-disjoint paths algorithm", journal = j-INFO-PROC-LETT, volume = "32", number = "1", pages = "25--27", day = "3", month = jul, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25", MRnumber = "91a:68130", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Tokyo, Jpn", classification = "723; 921; C4240 (Programming and algorithm theory)", corpsource = "Tokyo Res. Lab., IBM Res., Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; balance factor; breadth-first search tree; computational complexity; Computer Programming; Computer Systems, Digital--Parallel Processing; Concurrent Read Concurrent Write; concurrent-read concurrent-write random access machine model; CRCW PRAM; Depth First Search; directed graphs; Mathematical Techniques--Graph Theory; maximal node-disjoint paths; Maximal Paths; Parallel Algorithm; parallel algorithms; Parallel Random Access Machines; sublinear-time parallel algorithm; theory; undirected graphs; verification", subject = "G.1.0 Mathematics of Computing, NUMERICAL ANALYSIS, General, Parallel algorithms \\ G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching \\ F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Probabilistic computation", treatment = "T Theoretical or Mathematical", } @Article{Biskup:1989:BCN, author = "Joachim Biskup", title = "{Boyce-Codd} normal form and object normal forms", journal = j-INFO-PROC-LETT, volume = "32", number = "1", pages = "29--33", day = "3", month = jul, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68P15", MRnumber = "90g:68027", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Hildesheim, West Ger", classification = "723; C4250 (Database theory)", corpsource = "Inst. f{\"u}r Inf., Hochschule Hildesheim, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Boyce-Codd normal form; Boyce-Codd Normal Form; Database Systems; database theory; design; functional dependencies; Functional Dependencies; independent existence; management; minimal left-hand sides; object normal forms; Object Normal Forms; Relational; relational database; relational databases; theory; uniqueness; verification", subject = "H.2.1 Information Systems, DATABASE MANAGEMENT, Logical Design, Schema and subschema \\ H.2.m Information Systems, DATABASE MANAGEMENT, Miscellaneous", treatment = "T Theoretical or Mathematical", } @Article{Hagerup:1989:HRP, author = "Torben Hagerup", title = "Hybridsort revisited and parallelized", journal = j-INFO-PROC-LETT, volume = "32", number = "1", pages = "35--39", day = "3", month = jul, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68P10", MRnumber = "90g:68021", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Saarbr{\"u}cken, West Ger", classification = "723; C4240 (Programming and algorithm theory); C6130 (Data handling techniques)", corpsource = "Fachbereich Inf., Saarlandes Univ., Saarbrucken, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; computational complexity; Computer Programming--Algorithms; Computer Systems Programming; Computer Systems, Digital--Parallel Processing; Hybridsort; Hybridsort algorithm; independent uniformly distributed real numbers; linear time; parallel algorithms; Parallel Sorting; parallel sorting; Sorting; sorting; verification", subject = "F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Probabilistic computation \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching", treatment = "T Theoretical or Mathematical", } @Article{Blass:1989:MNA, author = "Andreas Blass and Yuri Gurevich", title = "On {Matijasevitch}'s nontraditional approach to search problems", journal = j-INFO-PROC-LETT, volume = "32", number = "1", pages = "41--45", day = "3", month = jul, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "03B35 (03B05 03D15 68Q15)", MRnumber = "90i:03012", MRreviewer = "M. I. Dekhtyar", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Ann Arbor, MI, USA", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Math., Michigan Univ., Ann Arbor, MI, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "3-sat Problem; computability; Computer Metatheory; differential equations; Mathematical Techniques--Differential Equations; nontraditional methods; NP-complete problem 3-SAT; propositional formulas; randomization; Satisfiability; satisfiability; Search Problems; search problems; theory; unsatisfiability; verification", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching \\ F.1.3 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Reducibility and completeness", treatment = "T Theoretical or Mathematical", } @Article{Lloyd:1989:FAF, author = "Errol L. Lloyd", title = "A fast algorithm for finding interlocking sets", journal = j-INFO-PROC-LETT, volume = "32", number = "1", pages = "47--50", day = "3", month = jul, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (68R05)", MRnumber = "90k:68070", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Pittsburgh, PA, USA", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Pittsburgh Univ., PA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; computational complexity; Computer Programming; connected components; finding interlocking sets; graph theory; interlock graph; interlock relation; Interlocking Sets; Mathematical Techniques--Graph Theory; O(n alpha (n)) algorithm; set theory; sorted endpoints; spanning forest; Spanning Forests; symmetric transitive closure; verification", subject = "G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous", treatment = "T Theoretical or Mathematical", } @Article{Choi:1989:HJI, author = "Hwang Kyu Choi and Myunghwan Kim", title = "Hybrid join: an improved sort-based join algorithm", journal = j-INFO-PROC-LETT, volume = "32", number = "2", pages = "51--56", day = "24", month = jul, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Seoul, South Korea", classification = "723; C1160 (Combinatorial mathematics); C4250 (Database theory); C6130 (Data handling techniques); C6160D (Relational DBMS)", corpsource = "Dept. of Electr. Eng., Korea Adv. Inst. of Sci. and Technol., Seoul, South Korea", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; Computer Programming; Database Systems--Relational; database theory; Hybrid Join; hybrid join; improved sort-based join algorithm; Join Algorithms; join operation; measurement; order statistics; Partitioning; partitioning; performance; ranged buckets; relational database systems; relational databases; smaller relation; Sort Based Join; sorting; theory", subject = "H.2.m Information Systems, DATABASE MANAGEMENT, Miscellaneous", treatment = "T Theoretical or Mathematical", } @Article{Boxer:1989:PCM, author = "Laurence Boxer and Russ Miller", title = "A parallel circle-cover minimization algorithm", journal = j-INFO-PROC-LETT, volume = "32", number = "2", pages = "57--60", day = "24", month = jul, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Niagara, NY, USA", classification = "723; C1180 (Optimisation techniques); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. and Inf. Sci., Niagara Univ., NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; Circle Cover; circular arcs; Computer Programming; Computer Systems, Digital--Parallel Processing; Concurrent Read Concurrent Write; crew pram; minimal set; minimisation; Minimization Algorithm; Parallel Algorithms; parallel algorithms; parallel circle-cover minimization algorithm; Parallel Random Access Machines; PRAM; theory; union", subject = "B.7.1 Hardware, INTEGRATED CIRCUITS, Types and Design Styles, Memory technologies \\ F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism", treatment = "T Theoretical or Mathematical", } @Article{Chern:1989:LBB, author = "Maw-Sheng S. Chern and G. H. Chen and Pangfeng Liu", title = "An {LC} branch-and-bound algorithm for the module assignment problem", journal = j-INFO-PROC-LETT, volume = "32", number = "2", pages = "61--71", day = "24", month = jul, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Hsinchu, Taiwan", classification = "723; 921; C1180 (Optimisation techniques); C6150J (Operating systems)", corpsource = "Dept. of Ind. Eng., Nat. Tsing Hua Univ., Hsinchu, Taiwan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; Branch-and-Bound Algorithms; communication costs; computer networks; Computer Programming; Computer Systems, Digital--Distributed; distributed processing; distributed processing system; execution costs; LC branch-and-bound algorithm; Leas Cost; Module Assignment Problem; module assignment problem; Optimal Assignment; optimal assignment; Optimization; reduction rules; scheduling; theory; verification", subject = "G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous \\ D.4.7 Software, OPERATING SYSTEMS, Organization and Design, Distributed systems \\ H.2.4 Information Systems, DATABASE MANAGEMENT, Systems, Distributed systems", treatment = "T Theoretical or Mathematical", } @Article{Kim:1989:CMM, author = "Young Joo Kim and Gil Chang Kim", title = "Coordinator: a modification to the monitor concept", journal = j-INFO-PROC-LETT, volume = "32", number = "2", pages = "73--80", day = "24", month = jul, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Seoul, South Korea", classification = "723; C6110 (Systems analysis and programming)", corpsource = "Dept. of Comput. Sci., Korea Adv. Inst. of Sci. and Technol., Seoul, South Korea", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Computer Programming Languages; Computer Systems, Digital--Distributed; Concurrent Programming; Coordinator; coordinator; languages; Monitor; monitor concept; operation level scheduling; parallel programming; quasi-concurrent guarded region; resource operations; shared resources; specialized coordinator statements; Synchronization Mechanism; synchronization mechanism; theory", subject = "D.1.3 Software, PROGRAMMING TECHNIQUES, Concurrent Programming", treatment = "P Practical", } @Article{Feitelson:1989:IWF, author = "Dror G. Feitelson and Larry Rudolph", title = "Implementation of a wait-free synchronization primitive that solves $n$-process consensus", journal = j-INFO-PROC-LETT, volume = "32", number = "2", pages = "81--83", day = "24", month = jul, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Jerusalem, Isr", classification = "722; 723; C6150J (Operating systems)", corpsource = "Dept. of Comput. Sci., Hebrew Univ. of Jerusalem, Israel", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "combining network; Computer Programming; Computer Systems, Digital; Consensus; design; fetch-and-conditional-swap; Multiprocessing; n-process consensus; relative strength; scheduling; Shared Memory; Synchronization Primitives; theory; Wait Free Synchronization; wait-free shared data objects; wait-free synchronization primitive", subject = "C.4 Computer Systems Organization, PERFORMANCE OF SYSTEMS, Design studies \\ D.4.1 Software, OPERATING SYSTEMS, Process Management, Synchronization", treatment = "P Practical", } @Article{Wolfram:1989:FCI, author = "D. A. Wolfram", title = "Forward checking and intelligent backtracking", journal = j-INFO-PROC-LETT, volume = "32", number = "2", pages = "85--87", day = "24", month = jul, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Cambridge, Engl", classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Comput. Lab., Cambridge Univ., UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Artificial Intelligence; Computational Complexity; Computer Programming; consistency tests; exponential space; FC+SR; Forward Checking; forward checking with search re-arrangement; Intelligent Backtracking; intelligent backtracking; optimisations; partial filtering; partial stacking; programming theory; Search Rearrangement; stacking; theory; time overheads; verification", subject = "I.2.8 Computing Methodologies, ARTIFICIAL INTELLIGENCE, Problem Solving, Control Methods, and Search, Backtracking", treatment = "T Theoretical or Mathematical", } @Article{Chen:1989:UFP, author = "Y. C. Chen and Z. C. Yeh and G. H. Chen", title = "Using fewer processors to reduce time complexities of semigroup computations", journal = j-INFO-PROC-LETT, volume = "32", number = "2", pages = "89--93", day = "24", month = jul, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25", MRnumber = "90j:68017", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliationaddress = "Taipei, Taiwan", classification = "722; 723; C4240 (Programming and algorithm theory)", corpsource = "Inst. of Info. Eng., Tatung Inst. of Technol., Taipei, Taiwan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; communication time; computation time; Computational Complexity; computational complexity; Computer Metatheory; Computer Programming--Algorithms; Computer Systems, Digital; execution time; fewer processors; Parallel Algorithms; parallel algorithms; Parallel Processing; Semigroup Computations; semigroup computations; theory; time complexities; verification", subject = "G.1.0 Mathematics of Computing, NUMERICAL ANALYSIS, General, Parallel algorithms \\ F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms", treatment = "T Theoretical or Mathematical", } @Article{Laih:1989:NTS, author = "Chi Sung Laih and Jau Yien Lee and Lein Harn", title = "A new threshold scheme and its application in designing the conference key distribution cryptosystem", journal = j-INFO-PROC-LETT, volume = "32", number = "3", pages = "95--99", day = "24", month = aug, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Natl Chen Kung Univ", affiliationaddress = "Tainan, Taiwan", classification = "718; 723; B6120B (Codes)", corpsource = "Dept. of Electr. Eng., Nat. Chen Kung Univ., Tainan, Taiwan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "abnegation incidents; betrayal incidents; conference key distribution cryptosystem; cross-product; Cryptography; cryptography; Data Processing--Security of Data; multiple users; N-dimensional vector space; property protection; single-system master key; Threshold Scheme; threshold scheme", treatment = "T Theoretical or Mathematical", } @Article{Janiak:1989:MRC, author = "Adam Janiak", title = "Minimization of resource consumption under a given deadline in the two-processor flow-shop scheduling problem", journal = j-INFO-PROC-LETT, volume = "32", number = "3", pages = "101--112", day = "24", month = aug, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Wroclaw Technical Univ", affiliationaddress = "Wroclaw, Pol", classification = "913; 921; C1180 (Optimisation techniques); C1290F (Industry)", corpsource = "Inst. of Eng. Cybern., Wroclaw Tech. Univ., Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Applications; Computational Complexity; continuously divisible; Heuristic Algorithms; inverse proportional; locally constrained resources; Mathematical Techniques--Algorithms; minimisation; minimization; Minimization of Resource Consumption; Optimization--Applications; resource consumption; Scheduling; scheduling; task processing times; two-processor flow-shop scheduling problem", treatment = "T Theoretical or Mathematical", } @Article{Huang:1989:TDU, author = "Shing-Tsaan Huang", title = "Termination detection by using distributed snapshots", journal = j-INFO-PROC-LETT, volume = "32", number = "3", pages = "113--119", day = "24", month = aug, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Natl Tsing-Hua Univ", affiliationaddress = "Hsin Chu, Taiwan", classification = "722; 723; 921; C4240 (Programming and algorithm theory)", corpsource = "Inst. of Comput. Sci., Nat. Tsing-Hua Univ., HsinChu, Taiwan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm; Computer Operating Systems--Design; Computer Systems, Digital; Distributed; Distributed Computation; distributed processing; distributed snapshots; Mathematical Techniques--Algorithms; programming theory; Termination Detection; termination detection", treatment = "T Theoretical or Mathematical", } @Article{Kochol:1989:EMC, author = "Martin Kochol", title = "Efficient monotone circuits for threshold functions", journal = j-INFO-PROC-LETT, volume = "32", number = "3", pages = "121--122", day = "24", month = aug, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25", MRnumber = "90h:68061", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See comment \cite{Dunne:1990:CKP}.", acknowledgement = ack-nhfb, affiliation = "Mathematical Inst SAV", affiliationaddress = "Bratislava, Czech", classification = "721; 723; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Math. Inst. SAV, Bratislava, Czechoslovakia", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Ajtai; Automata Theory--Computability and Decidability; Circuit Complexity; computational complexity; Computer Metatheory; Computer Systems Programming--Sorting; depth; efficient sorting network; Komlos; monotone circuits; size; sorting; Szemeredi; Threshold Functions; threshold functions; Threshold Logic", treatment = "T Theoretical or Mathematical", } @Article{Skiena:1989:RGC, author = "Steven S. Skiena", title = "Reconstructing graphs from cut-set sizes", journal = j-INFO-PROC-LETT, volume = "32", number = "3", pages = "123--127", day = "24", month = aug, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68R10 (05C60 68U05 90B10)", MRnumber = "90k:68141", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "State Univ of New York", affiliationaddress = "Stony Brook, NY, USA", classification = "721; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Automata Theory--Computability and Decidability; Combinatorial Geometry; computational complexity; Cut Sets; cut-set probe; cut-set sizes; edges; embedded graph; graph reconstruction; Graph Theory; graph theory; Mathematical Techniques; plane; points; straight line segments; vertices", treatment = "T Theoretical or Mathematical", } @Article{Goscinski:1989:SAP, author = "A. Goscinski", title = "A synchronization algorithm for processes with dynamic priorities in computer networks with node failures", journal = j-INFO-PROC-LETT, volume = "32", number = "3", pages = "129--136", day = "24", month = aug, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Univ of New South Wales", affiliationaddress = "Canberra, Aust", classification = "718; 722; 723; 921; B6150 (Communication system theory); B6210L (Computer communications); C5620 (Computer networks and techniques)", corpsource = "Dept. of Comput. Sci., New South Wales Univ., Canberra, ACT, Australia", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "communication protocols; computer networks; Computer Networks--Synchronization; Computer Operating Systems--Failure and Recovery; Computer Systems, Digital; concurrent; Distributed; distributed; Distributed Operating Systems; dynamic priorities; freedom from starvation; Mathematical Techniques--Algorithms; messages; Mutual Exclusion; mutual exclusion; node failures; node insertion; node removal; protocols; real-time environment; requests; synchronization algorithm; token loss", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Richardson:1989:IAV, author = "Stephen Richardson and Mahadevan Ganapathi", title = "Interprocedural analysis vs. procedure integration", journal = j-INFO-PROC-LETT, volume = "32", number = "3", pages = "137--142", day = "24", month = aug, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Stanford Univ", affiliationaddress = "Stanford, CA, USA", classification = "722; 723; C6150C (Compilers, interpreters and other processors)", corpsource = "Center for Integrated Syst., Stanford Univ., CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Code Optimization; Computer Operating Systems; Computer Systems Programming; Data-Flow Analysis; interprocedural analysis; interprocedural data-flow information; interprocedural interactions; interprocedural optimizations; Procedure Integration; procedure integration; Program Compilers; program compilers", treatment = "P Practical", } @Article{Cull:1989:CFN, author = "Paul Cull and James L. Holloway", title = "Computing {Fibonacci} numbers quickly", journal = j-INFO-PROC-LETT, volume = "32", number = "3", pages = "143--149", day = "24", month = aug, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "11Y55 (65B99 68Q25)", MRnumber = "90k:11170", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Oregon State Univ", affiliationaddress = "Corvallis, OR, USA", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Oregon State Univ., Corvallis, OR, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; Analysis of Algorithms; bit operations; computational complexity; Computers, Digital--Computational Methods; Fibonacci Numbers; Fibonacci numbers; Fibonacci sequence; Lucas numbers; Mathematical Techniques; number theory; product; running time", treatment = "T Theoretical or Mathematical", } @Article{Sagar:1989:MAT, author = "G. Sagar and Anil K. Sarje and Kamal U. Ahmed", title = "On module assignment in two-processor distributed systems: {A} modified algorithm", journal = j-INFO-PROC-LETT, volume = "32", number = "3", pages = "151--153", day = "24", month = aug, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Univ of Roorkee", affiliationaddress = "Roorkee, India", classification = "722; 723; C6150J (Operating systems)", corpsource = "Dept. of Electron. and Comput. Eng., Roorkee Univ., India", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "ASSIGN; COMBINE; Computer Programming--Algorithms; Computer Systems Programming--Multiprocessing Programs; Computer Systems, Digital; Distributed; Distributed Computing; distributed processing; graph-theoretic method; intermodule communication pattern; Interprocessor Communication; module allocation; module assignment; problem size reduction; procedures; scheduling; tree; two-processor distributed systems", treatment = "P Practical", } @Article{Morris:1989:WFI, author = "Joseph M. Morris", title = "Well-founded induction and the invariance theorem for loops", journal = j-INFO-PROC-LETT, volume = "32", number = "3", pages = "155--158", day = "24", month = aug, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q60 (03B70)", MRnumber = "91a:68188", MRreviewer = "A. Pliu{\v{s}}kevi{\v{c}}ien\.e", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Univ of Glasgow", affiliationaddress = "Glasgow, Scotl", classification = "721; 723; C1160 (Combinatorial mathematics); C1230 (Artificial intelligence)", corpsource = "Dept. of Comput. Sci., Glasgow Univ., UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Automata Theory--Theorem Proving; Computer Metatheory; formula-driven proof; function; fundamental invariance theorem; invariance theorem; Invariance Theorem; Programming Theory; set theory; theorem proving; well-founded induction; Well-Founded Induction; well-founded set", treatment = "T Theoretical or Mathematical", } @Article{Atallah:1989:OPA, author = "Mikhail J. Atallah and Danny Z. Chen", title = "An optimal parallel algorithm for the minimum circle-cover problem", journal = j-INFO-PROC-LETT, volume = "32", number = "4", pages = "159--165", day = "1", month = sep, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68U05 (52-04)", MRnumber = "91a:68259", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Purdue Univ", affiliationaddress = "West Lafayette, IN, USA", classification = "722; 723; 921; C1160 (Combinatorial mathematics); C4190 (Other numerical methods); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Purdue Univ., West Lafayette, IN, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; Analysis of Algorithms; Circle-Cover Problem; circular arcs; combinatorial mathematics; Computational Geometry; computational geometry; Computer Programming; Computer Systems, Digital--Parallel Processing; EREW PRAM model; lower bound; Mathematical Techniques--Combinatorial Mathematics; minimum circle-cover problem; optimal parallel algorithms; parallel algorithms; parallel computational models; sequential computational models; theory; verification", subject = "G.1.0 Mathematics of Computing, NUMERICAL ANALYSIS, General, Parallel algorithms \\ I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Narasimhan:1989:NHC, author = "Giri N. Narasimhan", title = "A note on the {Hamiltonian} circuit problem on directed path graphs", journal = j-INFO-PROC-LETT, volume = "32", number = "4", pages = "167--170", day = "1", month = sep, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (05C45 68R10 90B10)", MRnumber = "91a:68134", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Univ of Wisconsin-Madison", affiliationaddress = "Madison, WI, USA", classification = "921; B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics)", corpsource = "Dept. of Comput. Sci., Wisconsin Univ., Madison, WI, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "directed graphs; directed path graphs; Graph Theory; Hamiltonian Circuit; Hamiltonian circuit problem; Intersection Graph; Mathematical Techniques; NP-complete; NP-completeness; theory; verification", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Path and circuit problems \\ F.1.3 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Reducibility and completeness", treatment = "T Theoretical or Mathematical", } @Article{Bern:1989:SPE, author = "Marshall Bern and Paul Plassmann", title = "The {Steiner} problem with edge lengths $1$ and $2$", journal = j-INFO-PROC-LETT, volume = "32", number = "4", pages = "171--176", day = "1", month = sep, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (05C35 68R10 90B10)", MRnumber = "90m:68055", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Xerox Palo Alto Research Cent", affiliationaddress = "Palo Alto, CA, USA", classification = "921; B0250 (Combinatorial mathematics); B0290F (Interpolation and function approximation); C1160 (Combinatorial mathematics); C4130 (Interpolation and function approximation); C4240 (Programming and algorithm theory)", corpsource = "Xerox Palo Alto Res. Center, Palo Alto, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; approximation algorithm; Approximation Algorithms; approximation theory; complexity class; computational complexity; edge lengths; Mathematical Techniques; MAX SNP-hard; NP-completeness; shortest subgraph; Steiner problem; Steiner Tree; theory; trees (mathematics); verification", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms \\ F.1.3 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Reducibility and completeness", treatment = "T Theoretical or Mathematical", } @Article{Ligozat:1989:RBI, author = "G{\'e}rard Ligozat and H{\'e}l{\`e}ne Bestougeff", title = "On relations between intervals", journal = j-INFO-PROC-LETT, volume = "32", number = "4", pages = "177--182", day = "1", month = sep, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "03B45 (03B70 68T30)", MRnumber = "90m:03036", MRreviewer = "Xiang Li", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Univ de Paris", affiliationaddress = "Paris, Fr", classification = "723; 921; C1230 (Artificial intelligence); C4210 (Formal logic)", corpsource = "CNRS, Paris, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "artificial intelligence; Computer Metatheory; Formal Logic; formal logic; Mathematical Techniques--Set Theory; model; polygon; Primitive Relations; primitive temporal relations; temporal knowledge; Temporal Logic; theory; totally ordered set", subject = "F.4.1 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic \\ G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous \\ I.2.3 Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving", treatment = "T Theoretical or Mathematical", } @Article{Sharma:1989:EDD, author = "Mohan B. Sharma and Sitharama S. Iyengar and Narasimha K. Mandyam", title = "An efficient distributed depth-first-search algorithm", journal = j-INFO-PROC-LETT, volume = "32", number = "4", pages = "183--186", day = "1", month = sep, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Louisiana State Univ", affiliationaddress = "Baton Rouge, LA, USA", classification = "718; 723; C1160 (Combinatorial mathematics); C5620 (Computer networks and techniques)", corpsource = "Dept. of Comput. Sci., Louisiana State Univ., Baton Rouge, LA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; Computer Networks; Computers, Digital--Data Communication Systems; Depth-First-Search Algorithm; distributed depth-first-search algorithm; distributed processing; Distributed Systems; graph; Management; Mathematical Techniques--Algorithms; protocols; sequential depth-first-search algorithm; theory; trees (mathematics); verification", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms", treatment = "P Practical", } @Article{Sharir:1989:NPS, author = "Micha Sharir", title = "A note on the {Papadimitriou-Silverberg} algorithm for planning optimal piecewise-linear motion of a ladder", journal = j-INFO-PROC-LETT, volume = "32", number = "4", pages = "187--190", day = "1", month = sep, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (68U05)", MRnumber = "90k:68074", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "New York Univ", affiliationaddress = "New York, NY, USA", classification = "731; 921; C4190 (Other numerical methods)", corpsource = "Courant Inst. of Math. Sci., New York Univ., NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; Computational Geometry; computational geometry; inverse Ackermann function; ladder; Mathematical Techniques; Motion Planning; obstacle edges; optimal piecewise-linear motion; Optimization--Applications; Papadimitriou-Silverberg algorithm; planning; Robotics; theory", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations", treatment = "T Theoretical or Mathematical", } @Article{Lingas:1989:VDB, author = "Andrzej Lingas", title = "Vorono{\u{\i}} diagrams with barriers and the shortest diagonal problem", journal = j-INFO-PROC-LETT, volume = "32", number = "4", pages = "191--198", day = "1", month = sep, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68U05 (05C10 52-04)", MRnumber = "90k:68169", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Linkoping Univ", affiliationaddress = "Linkoping, Swed", classification = "721; 921; C1160 (Combinatorial mathematics); C4190 (Other numerical methods); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. and Inf. Sci., Linkoping Univ., Sweden", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Automata Theory--Computability and Decidability; barriers; Computational Complexity; computational complexity; computational geometry; Graph Theory; graph theory; Mathematical Techniques; Planar Graphs; planar straight-line graph; shortest diagonal problem; theory; verification; Voronoi Diagrams; Voronoi diagrams", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory", treatment = "T Theoretical or Mathematical", } @Article{Ellis:1989:LTA, author = "John A. Ellis and Manrique Mata and Gary MacGillivray", title = "A linear time algorithm for longest $(s, t)$-paths in weighted outerplanar graphs", journal = j-INFO-PROC-LETT, volume = "32", number = "4", pages = "199--204", day = "1", month = sep, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Univ of Victoria", affiliationaddress = "BC, Can", classification = "921; C1160 (Combinatorial mathematics); C4190 (Other numerical methods)", corpsource = "Dept. of Comput. Sci., Victoria Univ., BC, Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; Complexity of Algorithms; computational geometry; Graph Theory; graph theory; Hamiltonian Path problem; length function; linear time algorithms; Longest Path Algorithms; Mathematical Techniques; NP- complete problem; outerplanar graph; Planner Graphs; positive integer; theory; undirected graph; verification; weighted outerplanar graphs", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Path and circuit problems", treatment = "T Theoretical or Mathematical", } @Article{Egecioglu:1989:ADS, author = "{\"O}mer E{\u{g}}ecio{\u{g}}lu and Bahman Kalantari", title = "Approximating the diameter of a set of points in the {Euclidean} space", journal = j-INFO-PROC-LETT, volume = "32", number = "4", pages = "205--211", day = "1", month = sep, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68U05 (52-04)", MRnumber = "91b:68114", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Univ of California", affiliationaddress = "Santa Barbara, CA, USA", classification = "723; 921; C4130 (Interpolation and function approximation); C4190 (Other numerical methods)", corpsource = "Dept. of Comput. Sci., California Univ., Santa Barbara, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm; algorithms; approximation; Approximation Algorithms; approximation theory; Computational Geometry; computational geometry; Computer Programming--Algorithms; diameter; Euclidean space; Geometry; iteration; iterative methods; Mathematical Techniques; set of points; theory; verification", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations \\ G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous", treatment = "T Theoretical or Mathematical", } @Article{Sandhu:1989:DOS, author = "Ravinderpal Singh Sandhu", title = "The demand operation in the schematic protection model", journal = j-INFO-PROC-LETT, volume = "32", number = "4", pages = "213--219", day = "1", month = sep, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Ohio State Univ", affiliationaddress = "Columbus, OH, USA", classification = "722; 723; 912; C6130 (Data handling techniques); C6150J (Operating systems)", corpsource = "Dept. of Comput. and Inf. Sci., Ohio State Univ., Columbus, OH, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Computer Operating Systems--Design; Computer Systems, Digital; conditional demand; copy and create operations; demand operation; Management--Information Systems; operating systems (computers); Protection; schematic protection model; Schematic Protection Models; security; security of data; theory", subject = "H.2.0 Information Systems, DATABASE MANAGEMENT, General, Security, integrity, and protection \\ D.4.6 Software, OPERATING SYSTEMS, Security and Protection", treatment = "P Practical", } @Article{vandenBos:1989:PPC, author = "Jan {van den Bos}", title = "{PROCOL}: {A} protocol-constrained concurrent object-oriented language", journal = j-INFO-PROC-LETT, volume = "32", number = "5", pages = "221--227", day = "22", month = sep, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Univ of Leiden", affiliationaddress = "Leiden, Neth", classification = "722; 723; C6140D (High level languages)", corpsource = "Dept. of Comput. Sci., Leiden Univ., Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "client; client-server mappings; Computer Metatheory--Programming Theory; Computer Operating Systems--Program Translators; Computer Programming Languages; Computer Systems, Digital--Parallel Processing; Design; dynamic object environment; explicit access control; high level languages; Language Processors; languages; message transfer; Object Oriented Languages; object-oriented programming; parallel programming; parallelism; PROCOL; protocol-constrained concurrent object-oriented language; server; short-duration object binding; specification; standardization; theory; unidirectional messages; verifiable communication", subject = "D.3.4 Software, PROGRAMMING LANGUAGES, Processors \\ F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism \\ J.7 Computer Applications, COMPUTERS IN OTHER SYSTEMS, Process control", treatment = "P Practical", } @Article{Kemp:1989:OOC, author = "R. Kemp", title = "A one-to-one correspondence between two classes of ordered trees", journal = j-INFO-PROC-LETT, volume = "32", number = "5", pages = "229--234", day = "22", month = sep, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68P05 (68R10)", MRnumber = "90j:68010", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Johann Wolfgang Goethe-Univ", affiliationaddress = "Frankfurt, West Ger", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory); C6120 (File organisation)", corpsource = "Johann Wolfgang Goethe-Univ., Frankfurt Main, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; Combinatorial Mathematics; Data Processing--Data Structures; data structures; Mathematical Techniques; maximum number; nodes; one-to-one correspondence; Ordered Trees; ordered trees; postorder-traversing; stack size; theory; trees (mathematics); verification", subject = "G.2.1 Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics \\ E.1 Data, DATA STRUCTURES, Trees", treatment = "P Practical", } @Article{Francez:1989:CPD, author = "Nissim Francez", title = "Cooperating proofs for distributed programs with multiparty interactions", journal = j-INFO-PROC-LETT, volume = "32", number = "5", pages = "235--242", day = "22", month = sep, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q10 (68Q60)", MRnumber = "90m:68034a", MRreviewer = "Ryszard Janicki", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Technion-Israel Inst of Technology", affiliationaddress = "Haifa, Isr", classification = "721; 723; C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Automata Theory--Theorem Proving; Computer Metatheory; cooperating proofs; CSP programs; distributed processing; Distributed Programs; distributed programs; interprocess communication; languages; Multiparty Interactions; multiparty interactions; Partial Correctness; partial-correctness assertions; Programming Theory; programming theory; proof system; synchronization primitive; theorem proving; theory; verification", subject = "D.2.4 Software, SOFTWARE ENGINEERING, Program Verification, Correctness proofs \\ D.1.3 Software, PROGRAMMING TECHNIQUES, Concurrent Programming, CSP", treatment = "T Theoretical or Mathematical", } @Article{Everett:1989:ADH, author = "H. Everett and A. Gupta", title = "Acyclic directed hypercubes may have exponential diameter", journal = j-INFO-PROC-LETT, volume = "32", number = "5", pages = "243--245", day = "22", month = sep, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "05C20 (90B10)", MRnumber = "90h:05059", MRreviewer = "C. Peyrat", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Univ of Toronto", affiliationaddress = "Toronto, Ont, Can", classification = "721; 731; 921; C1160 (Combinatorial mathematics); C4230 (Switching theory); C5220 (Computer architecture)", corpsource = "Dept. of Comput. Sci., Toronto Univ., Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "acyclic hypercubes; Ai; Automata Theory--Computability and Decidability; diameter; directed graph; directed graphs; directed hypercubes; exponential diameter; Fibonacci number; Fibonacci Numbers; Graph Theory; Hopfield nets; Hybercubes; Mathematical Techniques; neural nets; parallel architectures; shortest paths; Systems Science and Cybernetics--Neural Nets; theory; verification", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory", treatment = "T Theoretical or Mathematical", } @Article{Cheston:1989:CST, author = "Grant A. Cheston and Art Farley and S. T. Hedetniemi and Andrzej Proskurowski", title = "Centering a spanning tree of a biconnected graph", journal = j-INFO-PROC-LETT, volume = "32", number = "5", pages = "247--250", day = "22", month = sep, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "05C05", MRnumber = "90m:05043", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Univ of Saskatchewan", affiliationaddress = "Saskatoon, Sask, Can", classification = "921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Saskatchewan Univ., Saskatoon, Sask., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm; algorithm theory; algorithms; arbitrary vertex; biconnected graph; Biconnected Graphs; Graph Theory; graph theory; Mathematical Techniques; Optimization--Applications; spanning tree; Spanning Tree Algorithm; theory; trees (mathematics)", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees", treatment = "T Theoretical or Mathematical", } @Article{MixBarrington:1989:RCS, author = "David A. {Mix Barrington} and James Corbett", title = "On the relative complexity of some languages in {${\rm NC}^1$}", journal = j-INFO-PROC-LETT, volume = "32", number = "5", pages = "251--256", day = "22", month = sep, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q15 (68Q45)", MRnumber = "91b:68033", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Univ of Massachusetts", affiliationaddress = "Amherst, MA, USA", classification = "721; 723; C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Dept. of COINS, Massachusetts Univ., Amherst, MA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Automata Theory; bracketed CFL's; Computational Complexity; computational complexity; Computer Metatheory--Boolean Functions; descriptive framework; direct connection language; Formal Languages; formal languages; languages; NC/sup 1/; one-sided Dyck languages; relative complexity; structured CFL's; theory; threshold circuits; verification", subject = "F.1.3 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes \\ F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Relations among modes \\ F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Operations on languages", treatment = "T Theoretical or Mathematical", } @Article{Clouatre:1989:GIR, author = "A. Clouatre and N. Laliberte and T. H. Merrett", title = "A general implementation of relational recursion with speedup techniques for programmers", journal = j-INFO-PROC-LETT, volume = "32", number = "5", pages = "257--262", day = "22", month = sep, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "McGill Univ", affiliationaddress = "Montreal, Que, Can", classification = "721; 723; C4250 (Database theory); C6160D (Relational DBMS)", corpsource = "Sch. of Comput. Sci., McGill Univ., Montreal, Que., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "accessible set; algorithms; Automata Theory--Recursive Functions; Computer Metatheory--Programming Theory; Database Systems; database theory; design; Fixed-Point Operators; general recursion; graphs; label computations; management; order-of-magnitude speedups; programmers; reaching accessible sets; recursive functions; Relational; relational databases; Relational Recursion; relational recursion; relational selections; relix; single-source label calculations; speedup techniques; theory; transitive closure", subject = "I.1.m Computing Methodologies, ALGEBRAIC MANIPULATION, Miscellaneous \\ H.2.m Information Systems, DATABASE MANAGEMENT, Miscellaneous", treatment = "T Theoretical or Mathematical", } @Article{Roberts:1989:ANR, author = "George H. Roberts", title = "Another note on recursive ascent", journal = j-INFO-PROC-LETT, volume = "32", number = "5", pages = "263--266", day = "22", month = sep, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "721; 723; C4210 (Formal logic); C6150C (Compilers, interpreters and other processors)", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithmic Languages; Automata Theory--Recursive Functions; Bottom-Up Parsing; bottom-up parsing; compiled LR parsers; Computer Metatheory; Computer Programming Languages--Design; grammars; language; languages; LR parsers; LR Parsing; LR state; program compilers; recursive ascent; recursive functions; theory", subject = "F.4.2 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems, Parsing", treatment = "T Theoretical or Mathematical", } @Article{Baron:1989:FLQ, author = "Gerd Baron and Friedrich Urbanek", title = "Factorial languages with quadratically upper bounded growth functions and nonlinearly upper bounded subword complexities", journal = j-INFO-PROC-LETT, volume = "32", number = "5", pages = "267--269", day = "22", month = sep, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q45", MRnumber = "91b:68055", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Technische Univ Wien", affiliationaddress = "Vienna, Austria", classification = "721; 921; C4210 (Formal logic)", corpsource = "Inst. f{\"u}r Algebra und Diskrete Math., Tech. Univ. Wien, Vienna, Austria", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Automata Theory; computational complexity; existence; Factorial Languages; factorial languages; Formal Languages; formal languages; languages; Mathematical Techniques--Applications; nonlinearly upper bounded subword complexities; quadratically upper bounded growth functions; theory; verification", subject = "F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Algebraic language theory", treatment = "T Theoretical or Mathematical", } @Article{Makinen:1989:SIP, author = "Erkki M{\"a}kinen", title = "On the subtree isomorphism problem for ordered trees", journal = j-INFO-PROC-LETT, volume = "32", number = "5", pages = "271--273", day = "22", month = sep, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68R10 (05C05 68P05 68Q25)", MRnumber = "90k:68139", MRreviewer = "Fabrizio Luccio", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See also comments \cite{Grossi:1991:FCS}.", acknowledgement = ack-nhfb, affiliation = "Univ of Tampere", affiliationaddress = "Tampere, Finl", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Tampere Univ., Finland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm theory; algorithms; Combinatorial Mathematics; Mathematical Techniques; Ordered Trees; ordered trees; Pattern Recognition; String Pattern Matching; string pattern matching; subtree isomorphism problem; theory; tree encoding; Tree Isomorphism; trees (mathematics); verification; Zaks Sequence", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Pattern matching", treatment = "T Theoretical or Mathematical", } @Article{Chakrabarti:1989:ISEb, author = "P. P. Chakrabarti and S. Ghose and A. Pandey and S. C. de Sarkar", title = "Increasing search efficiency using multiple heuristics", journal = j-INFO-PROC-LETT, volume = "32", number = "5", pages = "275--275", day = "22", month = sep, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Mon Aug 15 13:51:01 MDT 1994", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "measurement; performance; theory", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Path and circuit problems", } @Article{Shiraishi:1989:PAM, author = "Shuji Shiraishi", title = "A parallel algorithm for the maximum $2$-chain edge packing problem", journal = j-INFO-PROC-LETT, volume = "32", number = "6", pages = "277--279", day = "3", month = oct, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (05C70 68R10 90C27)", MRnumber = "90k:68076", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Fukuoka Univ", affiliationaddress = "Fukuoka, Jpn", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Appl. Math., Fukuoka Univ., Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; computational complexity; Computer Programming; Concurrent Read; Concurrent Write; CRCW PRAM; Euler Tour Technique; graph theory; Mathematical Techniques--Graph Theory; maximum 2-chain edge packing problem; parallel algorithm; Parallel Algorithms; parallel algorithms; Parallel Random Access Machines; theory; Two Chain Edge Packing; undirected graph", subject = "G.1.0 Mathematics of Computing, NUMERICAL ANALYSIS, General, Parallel algorithms \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Routing and layout \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms", treatment = "T Theoretical or Mathematical", } @Article{Abiteboul:1989:BUD, author = "Serge Abiteboul", title = "Boundedness is undecidable for {Datalog} programs with a single recursive rule", journal = j-INFO-PROC-LETT, volume = "32", number = "6", pages = "281--287", day = "3", month = oct, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q99 (68P15 68T25)", MRnumber = "90k:68130", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "INRIA", affiliationaddress = "Le Chesnay, Fr", classification = "723; C4210 (Formal logic); C4250 (Database theory)", corpsource = "INRIA, Le Chesnay, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "approximate simulation; Boundedness; boundedness; Computability and Decidability; Computer Metatheory; Database Systems; database theory; Datalog Programs; decidability; Deductive Databases; disjunctions; fixpoint; management; multiple recursive rule Datalog programs; single recursive rule; undecidability results; undecidable; verification", subject = "H.2.m Information Systems, DATABASE MANAGEMENT, Miscellaneous \\ F.4.1 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Logic programming \\ I.2.7 Computing Methodologies, ARTIFICIAL INTELLIGENCE, Natural Language Processing, DATALOG", treatment = "T Theoretical or Mathematical", } @Article{Alblas:1989:OIS, author = "Henk Alblas", title = "Optimal incremental simple multi-pass attribute evaluation", journal = j-INFO-PROC-LETT, volume = "32", number = "6", pages = "289--295", day = "3", month = oct, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Univ of Twente", affiliationaddress = "Enschede, Neth", classification = "721; 723; 921; C1160 (Combinatorial mathematics); C4210 (Formal logic); C6150C (Compilers, interpreters and other processors)", corpsource = "Dept. of Comput. Sci., Twente Univ., Enschede, Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; attribute grammar; attributive evaluation; Automata Theory--Context Free Grammars; CF grammar; compiler optimizations; Computer Operating Systems; context-free grammar; context-free grammars; incremental simple multi-pass evaluator; languages; Mathematical Techniques--Trees; Multipass Attribute Evaluation; optimal; Program Compilers; program compilers; recomputations; subtrees; theory; tree nodes; Tree Structures; tree structures; Tree Transformations; tree transformations; trees (mathematics); visits", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees \\ F.4.2 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems, Grammar types", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Padberg:1989:CMB, author = "Manfred Padberg and Antonio Sassano", title = "The complexity of matching with bonds", journal = j-INFO-PROC-LETT, volume = "32", number = "6", pages = "297--300", day = "3", month = oct, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (05C70 68R10)", MRnumber = "90j:68020", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "New York Univ", affiliationaddress = "New York, NY, USA", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Graduate Sch. of Bus. Adm., New York Univ., NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "bond structure; cardinality; complexity; Computational Complexity; computational complexity; Computer Metatheory--Computability and Decidability; cycle; disjoint subsets; edges; finite; Graph Theory; graph theory; loopless graph; matching with bonds; Mathematical Techniques; maximum-weight matching; MB; nonempty; NP-hard problem; Restricted Matching Problems; set theory; theory; undirected; union; verification", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory \\ F.1.3 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Pattern matching", treatment = "T Theoretical or Mathematical", } @Article{Drysdale:1989:NLB, author = "Robert L. {Drysdale, III} and Jerzy W. Jaromczyk", title = "A note on lower bounds for the maximum area and maximum perimeter $k$-gon problems", journal = j-INFO-PROC-LETT, volume = "32", number = "6", pages = "301--303", day = "3", month = oct, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68U05 (52-04)", MRnumber = "90j:68047", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Dartmouth Coll", affiliationaddress = "Hanover, NH, USA", classification = "723; 921; C1160 (Combinatorial mathematics); C4190 (Other numerical methods); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Math. and Comput. Sci., Dartmouth Coll., Hanover, NH, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Computation Tree Model; computational complexity; Computational Geometry; computational geometry; computational tree model; Computer Metatheory--Computability and Decidability; extremal properties; Geometry; Isoperimetric Problems; lower bound time complexity; Lower Bounds; Mathematical Techniques; maximum area; maximum perimeter k-gon problems; proof; reduction; Regular Polygons; regular polygons; set-disjointness problem; theory; Time Complexity; verification", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees", treatment = "T Theoretical or Mathematical", } @Article{Gibbons:1989:CPE, author = "A. M. Gibbons and Y. N. Srikant", title = "A class of problems efficiently solvable on mesh-connected computers including dynamic expression evaluation", journal = j-INFO-PROC-LETT, volume = "32", number = "6", pages = "305--311", day = "3", month = oct, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Univ of Warwick", affiliationaddress = "Coventry, Engl", classification = "723; C1160 (Combinatorial mathematics); C4190 (Other numerical methods); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Warwick Univ., Coventry, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Computability and Decidability; Computer Metatheory; Computer Programming--Algorithms; Computer Systems, Digital--Parallel Processing; Dynamic Expression Evaluation; dynamic expression evaluation; efficiently solvable problems; feasible parallel architectures; graph theory; languages; lower bound; maximum path length; Mesh Connected Computers; mesh-connected computers; messages; NC; P-RAM model; Parallel Algorithms; parallel algorithms; parallel computation; polylogarithmic parallel time; polynomial number; theory; time complexities", subject = "G.1.0 Mathematics of Computing, NUMERICAL ANALYSIS, General, Parallel algorithms \\ F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Classes defined by grammars or automata \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory", treatment = "T Theoretical or Mathematical", } @Article{Demolombe:1989:HSO, author = "Robert Demolombe and Arantza Illarramendi", title = "Heuristics for syntactical optimization of relational queries", journal = j-INFO-PROC-LETT, volume = "32", number = "6", pages = "313--316", day = "3", month = oct, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "O.N.E.R.A. CERT", affiliationaddress = "Toulouse, Fr", classification = "723; C4210 (Formal logic); C4250 (Database theory); C6140D (High level languages); C6160D (Relational DBMS); C7250 (Information storage and retrieval)", corpsource = "ONERA CERT, Toulouse, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Database Systems; database theory; decidability; decidable method; First Order Predicate Calculus; Heuristics; heuristics; information retrieval; Optimization; query languages; Query Optimization; query optimizations; relational databases; Relational Queries; relational queries; Syntactical Optimization; syntactical optimization; Theory; theory; Transformation Rules; transformation rules; verification", subject = "I.2.8 Computing Methodologies, ARTIFICIAL INTELLIGENCE, Problem Solving, Control Methods, and Search, Heuristic methods \\ H.2.4 Information Systems, DATABASE MANAGEMENT, Systems, Query processing", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Abiteboul:1989:AWR, author = "Serge Abiteboul and Marc Gyssens and Dirk van Gucht", title = "An alternative way to represent the cogroup of a relation in the context of nested databases", journal = j-INFO-PROC-LETT, volume = "32", number = "6", pages = "317--324", day = "3", month = oct, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68P15", MRnumber = "91a:68045", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "INRIA", affiliationaddress = "Le Chesnay, Fr", classification = "723; 921; C1110 (Algebra); C4250 (Database theory); C6140D (High level languages); C6160D (Relational DBMS)", corpsource = "INRIA, Le Chesnay, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "attributes; calculus; cogroup; Database Systems; database theory; group theory; instance-independent query; languages; Mathematical Techniques--Algebra; measurement; Nested Databases; nested databases; nested relation; Nested Relations; power; powerset algebra; query language; Query Languages; query languages; Relational Algebra; relational algebra; relational databases; theory; verification", subject = "G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous \\ H.2.3 Information Systems, DATABASE MANAGEMENT, Languages, Query languages \\ H.2.m Information Systems, DATABASE MANAGEMENT, Miscellaneous", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Toyama:1989:FKC, author = "Yoshihito Toyama", title = "Fast {Knuth--Bendix} completion with a term rewriting system compiler", journal = j-INFO-PROC-LETT, volume = "32", number = "6", pages = "325--328", day = "3", month = oct, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "NTT Basic Research Lab", affiliationaddress = "Musashino-shi, Jpn", classification = "723; C4210 (Formal logic); C6150C (Compilers, interpreters and other processors)", corpsource = "NTT Basic Res. Lab., Tokyo, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; completion process; Computer Operating Systems; Computer Programming--Algorithms; dynamic compiling; execution speed; Knuth--Bendix completion algorithm; languages; Program Compilers; program compilers; reductions; rewriting rules; rewriting systems; target code; term rewriting system compiler; Term Rewriting Systems; theory", subject = "F.4.2 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems, Parallel rewriting systems \\ D.3.4 Software, PROGRAMMING LANGUAGES, Processors, Compilers", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Veroy:1989:CAC, author = "Boris S. Veroy", title = "Corrigenda: {``Average complexity of divide-and-conquer algorithms'' [Inform. Process. Lett. {\bf 29} (1988), no. 6, 319--326; MR 89m:68068]}", journal = j-INFO-PROC-LETT, volume = "32", number = "6", pages = "329--329", day = "3", month = oct, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25", MRnumber = "90m:68064", bibdate = "Sat Apr 11 12:24:20 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See \cite{Veroy:1988:ACD}.", acknowledgement = ack-nhfb, fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", } @Article{Veroy:1989:COS, author = "Boris S. Veroy", title = "Corrigenda: {``Optimal search algorithm for a minimum of a discrete periodic bimodal function'' [Inform. Process. Lett. {\bf 29} (1988), no. 5, 233--239; MR 90b:90099]}", journal = j-INFO-PROC-LETT, volume = "32", number = "6", pages = "329--329", day = "3", month = oct, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "90C10 (68Q25 68R10)", MRnumber = "90k:90114", bibdate = "Sat Apr 11 12:24:20 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See \cite{Veroy:1988:OSA}.", acknowledgement = ack-nhfb, fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", } @Article{Fulop:1989:TTT, author = "Z. F{\"u}l{\"o}p and S. V{\'a}gv{\"o}lgyi", title = "Top-down tree transducers with deterministic top-down look-ahead", journal = j-INFO-PROC-LETT, volume = "33", number = "1", pages = "3--5", day = "27", month = oct, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q45", MRnumber = "91d:68066", MRreviewer = "Gheorghe P{\u{a}}un", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Hungarian Acad of Sciences", affiliationaddress = "Szeged, Hung", classification = "721; 921; C4220 (Automata theory)", corpsource = "Res. Group on Theory of Autom., Hungarian Acad. of Sci., Szeged, Hungary", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Automata Theory; deterministic automata; deterministic top-down look-ahead; Finite Automata; Finite State Tree Transducer; Finite Tree Automata; Mathematical Techniques--Trees; theory; trees (mathematics); verification", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees", treatment = "T Theoretical or Mathematical", } @Article{Wan:1989:AAF, author = "S. J. Wan and S. K. M. Wong", title = "An adaptive algorithm for finding a covering hypersphere", journal = j-INFO-PROC-LETT, volume = "33", number = "1", pages = "7--10", day = "27", month = oct, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68T10 (52-04)", MRnumber = "90m:68103", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Univ of Regina", affiliationaddress = "Regina, Sask, Can", classification = "723; C1240 (Adaptive system theory); C1250 (Pattern recognition)", corpsource = "Dept. of Comput. Sci., Regina Univ., Sasko., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "adaptive algorithm; Adaptive Algorithms; Adaptive Learning; adaptive systems; Algorithms; algorithms; Classification; Computer Programming; Covering Hypersphere; covering hypersphere; design; learning systems; multidimensional Euclidean space; Pattern Recognition; pattern recognition; sphere algorithm; theory; verification", subject = "I.5.2 Computing Methodologies, PATTERN RECOGNITION, Design Methodology, Classifier design and evaluation", treatment = "T Theoretical or Mathematical", } @Article{Lee:1989:AAD, author = "De-Lei Lee", title = "On access and alignment of data in a parallel processor", journal = j-INFO-PROC-LETT, volume = "33", number = "1", pages = "11--14", day = "27", month = oct, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "York Univ", affiliationaddress = "North York, Ont, Can", classification = "723; 921; C5440 (Multiprocessor systems and techniques); C6130 (Data handling techniques)", corpsource = "Dept. of Comput. Sci., York Univ., North York, Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "complete solution; Computer Systems, Digital; conflict-free access; data access; data alignment; data handling; design; interconnection network; Interconnection Networks; Mathematical Techniques--Matrix Algebra; Memory Conflicts; Memory Management; memory modules; Multiprocessing; parallel processing; parallel processor; Parallel Processors; processing elements; Shared Memory Multiprocessors; theory; verification", subject = "C.1.2 Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors), Interconnection architectures \\ C.1.2 Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors), Parallel processors \\ C.4 Computer Systems Organization, PERFORMANCE OF SYSTEMS, Design studies \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Network problems", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Majster-Cederbaum:1989:CPS, author = "Mila E. Majster-Cederbaum", title = "The contraction property is sufficient to guarantee the uniqueness of fixed points of endofunctors in a category of complete metric spaces", journal = j-INFO-PROC-LETT, volume = "33", number = "1", pages = "15--19", day = "27", month = oct, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q10 (68Q55)", MRnumber = "91a:68078", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Univ Mannheim", affiliationaddress = "Mannheim, West Ger", classification = "723; C4240 (Programming and algorithm theory); C6150J (Operating systems)", corpsource = "Fak. f{\"u}r Math. und Inf., Mannheim Univ., West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "category; Complete Metric Spaces; complete metric spaces; Computer Programming Languages; Computer Systems, Digital--Distributed; Concurrency; concurrency; concurrency control; contraction property; endofunctors; fixed points; functor; measurement; multiprocessing programs; programming languages; programming theory; semantic definition; synchronisation; Synchronization; theory; uniqueness; verification", subject = "D.4.1 Software, OPERATING SYSTEMS, Process Management, Concurrency \\ D.4.1 Software, OPERATING SYSTEMS, Process Management, Synchronization \\ G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous", treatment = "T Theoretical or Mathematical", } @Article{Misra:1989:SPS, author = "Jayadev Misra", title = "A simple proof of a simple consensus algorithm", journal = j-INFO-PROC-LETT, volume = "33", number = "1", pages = "21--24", day = "27", month = oct, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68M15 (68M10)", MRnumber = "91b:68014", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Univ of Texas at Austin", affiliationaddress = "Austin, TX, USA", classification = "722; 723; C5470 (Performance evaluation and testing); C5620 (Computer networks and techniques)", corpsource = "Dept. of Comput. Sci., Texas Univ., Austin, TX, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; Byzantine Agreement; communicating processes; Computer Programming--Algorithms; Computer Systems, Digital; Consensus Algorithms; Consensus Protocols; Fault Tolerant Capability; fault tolerant computing; protocols; simple consensus algorithm; simple proof; theory; unauthenticated Byzantine Agreement protocol; verification", subject = "I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms \\ G.4 Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm analysis", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Taubenfeld:1989:LEP, author = "Gadi Taubenfeld", title = "Leader election in the presence of $n-1$ initial failures", journal = j-INFO-PROC-LETT, volume = "33", number = "1", pages = "25--28", day = "27", month = oct, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Yale Univ", affiliationaddress = "New Haven, CT, USA", classification = "722; 723; C5620 (Computer networks and techniques)", corpsource = "Dept. of Comput. Sci., Yale Univ., New Haven, CT, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "asynchronous shared memory model; Computer Programming--Algorithms; Computer Systems, Digital; Crash Failures; deterministic leader electron protocol; Fault Tolerant Capability; initial failures; Leader Election; leader electron; multi readers regular registers; Protocols; protocols; Shared Memory; single writer; theory; verification", subject = "G.m Mathematics of Computing, MISCELLANEOUS", treatment = "T Theoretical or Mathematical", } @Article{Rao:1989:LAD, author = "A. Srinivasa Rao and C. Pandu Rangan", title = "Linear algorithm for domatic number problem on interval graphs", journal = j-INFO-PROC-LETT, volume = "33", number = "1", pages = "29--33", day = "27", month = oct, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q20 (68R10)", MRnumber = "91a:68117", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Indian Inst of Technology", affiliationaddress = "Madras, India", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci. and Eng., Indian Int. of Technol., Madras, India", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; appropriate acyclic network; computational complexity; Computer Programming--Algorithms; Domatic Number Problem; domatic number problem; Graph Theory; graph theory; Interval Graphs; interval graphs; linear algorithm; Linear Algorithms; Mathematical Techniques; maximum flow problem; sparse proper interval graphs; theory; verification", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms", treatment = "T Theoretical or Mathematical", } @Article{Dasgupta:1989:AAM, author = "Bhaskar Dasgupta and C. E. Veni Madhavan", title = "An approximate algorithm for the minimal vertex nested polygon problem", journal = j-INFO-PROC-LETT, volume = "33", number = "1", pages = "35--44", day = "27", month = oct, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68U05", MRnumber = "91a:68262", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Indian Inst of Science", affiliationaddress = "Secunderabad, India", classification = "723; 921; C1160 (Combinatorial mathematics); C4190 (Other numerical methods)", corpsource = "CMC Ltd., Secunderabad, India", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; approximate algorithm; Approximate Algorithms; Computational Geometry; computational geometry; Computer Programming; Graph Algorithms; graph theory; Mathematical Techniques--Geometry; Minimal Vertex Nested Polygon Problem; minimal vertex nested polygon problem; Shortest Path Algorithms; shortest-path finding graph algorithms; theory; verification", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Path and circuit problems", treatment = "T Theoretical or Mathematical", } @Article{Wong:1989:CCC, author = "Kam-Fai Wong", title = "Comments on {``A comparison of concatenated and superimposed code word surrogate files for very large data\slash knowledge bases''}", journal = j-INFO-PROC-LETT, volume = "33", number = "1", pages = "45--52", day = "27", month = oct, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Herioy-Watt Univ", affiliationaddress = "Edinburgh, Scotl", classification = "723; 903; C6160 (Database management systems (DBMS)); C7240 (Information analysis and indexing); C7250 (Information storage and retrieval)", corpsource = "Dept. of Comput. Sci., Heriot-Watt Univ., Edinburgh, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Artificial Intelligence--Expert Systems; concatenated; Concatenated Code Words; Data Processing--File Organization; database management systems; Database Systems; Database/Knowledge Base Retrieval; descriptor files; design; direct retrieval; direct searching; indexing; indexing techniques; information retrieval systems; Information Retrieval Systems; knowledge bases; large databases; management; Partial Matching; query response times; space requirements; superimposed code word surrogate files; Superimposed Code Words; Surrogate Files; theory", subject = "H.3.3 Information Systems, INFORMATION STORAGE AND RETRIEVAL, Information Search and Retrieval, Retrieval models \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching \\ H.3.2 Information Systems, INFORMATION STORAGE AND RETRIEVAL, Information Storage, File organization", treatment = "P Practical", } @Article{Raynal:1989:PNT, author = "Michel Raynal", title = "Prime numbers as a tool to design distributed algorithms", journal = j-INFO-PROC-LETT, volume = "33", number = "1", pages = "53--58", day = "27", month = oct, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q10 (68Q20)", MRnumber = "91a:68082", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "IRISA", affiliationaddress = "Rennes, Fr", classification = "723; C6120 (File organisation); C6150J (Operating systems)", corpsource = "IRISA, Rennes, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithm Design; Algorithms; algorithms; Computer Programming; Computer Systems, Digital--Distributed; data structures; design; Distributed Algorithms; distributed algorithms; distributed processing; global state; mutual exclusion; Mutual Exclusion Algorithms; Prime Numbers; prime numbers; termination detection algorithm; Termination Detection Algorithms; theory; tool", subject = "F.2.1 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Number-theoretic computations \\ I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms \\ G.4 Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm analysis", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Avis:1989:LBL, author = "D. Avis and J. M. Robert and R. Wenger", title = "Lower bounds for line stabbing", journal = j-INFO-PROC-LETT, volume = "33", number = "2", pages = "59--62", day = "10", month = nov, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68U05 (52B55)", MRnumber = "91e:68139", MRreviewer = "Ivan Stojmenovi{\'c}", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "McGill Univ", affiliationaddress = "Montreal, Que, Can", classification = "723; 921; C1160 (Combinatorial mathematics); C4190 (Other numerical methods); C4240 (Programming and algorithm theory)", corpsource = "McGill Univ., Montreal, Que., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "circle; computational complexity; Computational Geometry; computational geometry; Computer Programming--Algorithms; existence; fixed order algebraic decision tree lower bound; Geometry; line segments; Line Stabber; line stabber; line stabbing; Line Transversal; line transversal; Lower Bounds; Mathematical Techniques; plane; set; theory; transformation; translates; verification; width", subject = "G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous", treatment = "T Theoretical or Mathematical", } @Article{Buchta:1989:ANM, author = "Christian Buchta", title = "On the average number of maxima in a set of vectors", journal = j-INFO-PROC-LETT, volume = "33", number = "2", pages = "63--65", day = "10", month = nov, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (60D05 68R05)", MRnumber = "90m:68056", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Technische Univ Wien", affiliationaddress = "Wien, Austria", classification = "723; 921; 922; C1120 (Analysis); C1140Z (Other and miscellaneous)", corpsource = "Inst. f{\"u}r Anal., Tech. Math. und Versicherungsmath., Tech. Univ. Wien, Austria", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithm Analysis; algorithms; asymptotic behaviour; average number; Average Number of Maxima; Computational Geometry; Computer Programming--Algorithms; expected number; Mathematical Techniques; maxima; maximal vectors; Probability; probability; set; tends to infinity; theory; Vectors; vectors; verification", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations \\ F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Probabilistic computation \\ I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms", treatment = "T Theoretical or Mathematical", } @Article{Chung:1989:FCP, author = "Kuo Liang Chung and Wen Chin Chen and Ferng-Ching Lin", title = "Fast computation of periodic continued fractions", journal = j-INFO-PROC-LETT, volume = "33", number = "2", pages = "67--72", day = "10", month = nov, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "11Y65 (11A55 65B99)", MRnumber = "90m:11207", MRreviewer = "Jeffrey O. Shallit", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Natl Taiwan Univ", affiliationaddress = "Taipei, Taiwan", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci. and Inf. Eng., Nat. Taiwan Univ., Taipei, Taiwan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; approximation; computational complexity; Computer Programming--Algorithms; design; Fibonacci Numbers; Mathematical Techniques; number theory; Number Theory; periodic continued fractions; Periodic Continued Fractions; quadratic surd number; second-order linear recurrence; self-substitution concept; theory; verification", subject = "I.1.2 Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms \\ G.1.2 Mathematics of Computing, NUMERICAL ANALYSIS, Approximation \\ G.1.0 Mathematics of Computing, NUMERICAL ANALYSIS, General, Computer arithmetic", treatment = "T Theoretical or Mathematical", } @Article{Szepietowski:1989:SRA, author = "Andrzej Szepietowski", title = "Some remarks on the alternating hierarchy and closure under complement for sublogarithmic space", journal = j-INFO-PROC-LETT, volume = "33", number = "2", pages = "73--78", day = "10", month = nov, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q15 (03D15)", MRnumber = "91e:68060", MRreviewer = "Frederic Green", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Technical Univ of Gdansk", affiliationaddress = "Gdansk, Pol", classification = "721; C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Math., Tech. Univ. of Gdansk, Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Alternating Hierarchy; Automata Theory; closure under complement; Complement; computational complexity; fully space constructible; languages; single-letter alphabet; Space Complexity; space-bounded alternating hierarchy; space-bounded nondeterministic Turing machines; sublogarithmic space; theory; Turing Machines; Turing machines; verification", subject = "F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Bounded-action devices \\ F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Alternation and nondeterminism \\ F.1.3 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Complexity hierarchies", treatment = "T Theoretical or Mathematical", } @Article{Thome:1989:SCA, author = "Winfried Thome and Reinhard Wilhelm", title = "Simulating circular attribute grammars through attribute reevaluation", journal = j-INFO-PROC-LETT, volume = "33", number = "2", pages = "79--81", day = "10", month = nov, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q50", MRnumber = "90m:68083", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Univ des Saarlandes", affiliationaddress = "Saarbr{\"u}cken, West Ger", classification = "721; C4210 (Formal logic); C6150C (Compilers, interpreters and other processors)", corpsource = "Fachbereich Inf., Univ. des Saarlandes, Saarbrucken, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Attribute Reevaluation; attribute reevaluation; Automata Theory; Circular Attribute Grammars; circular attribute grammars; fixed points; grammars; ill formed; inconsistent; interactive computation; languages; program compilers; recursive data flow equations; theory; Tree Transformation; tree transformation", subject = "F.4.2 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems, Grammar types", treatment = "T Theoretical or Mathematical", } @Article{Dietzfelbinger:1989:SCO, author = "Martin Dietzfelbinger", title = "The speed of copying on one-tape off-line {Turing} machines", journal = j-INFO-PROC-LETT, volume = "33", number = "2", pages = "83--89", day = "10", month = nov, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q05 (03D10 68Q15 68Q30)", MRnumber = "91d:68012", MRreviewer = "H. J{\"u}rgensen", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Univ-GH Paderborn", affiliationaddress = "Paderborn, West Ger", classification = "721; 723; C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "Fachbereich 17, Math. Inf., Univ. GH Paderborn, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Automata Theory; bounded multi-tape TMs; cells; Computational Complexity; computational complexity; Computer Metatheory--Computability and Decidability; copying; copying speed; Kolmogorov Complexity; Kolmogorov complexity argument; one-tape off-line Turing machines; performance; string; theory; Turing Machines; Turing machines; two-way input tape; upper bound; verification; work tape", subject = "F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Bounded-action devices \\ G.m Mathematics of Computing, MISCELLANEOUS", treatment = "T Theoretical or Mathematical", } @Article{Schaffer:1989:ONR, author = "Alejandro A. Sch{\"a}ffer", title = "Optimal node ranking of trees in linear time", journal = j-INFO-PROC-LETT, volume = "33", number = "2", pages = "91--96", day = "10", month = nov, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68R10 (05C05)", MRnumber = "91c:68106", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "AT\&T Bell Lab", affiliationaddress = "Murray Hill, NJ, USA", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "AT and T Bell Labs., Murray Hill, NJ, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm; algorithms; computational complexity; Computer Programming--Algorithms; linear time; mapping; Mathematical Techniques; Node Ranking; nodes; optimal; path; rank; ranking; Separators; set; theory; Tree Ranking; Trees; trees; trees (mathematics); unrooted tree; verification", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees", treatment = "T Theoretical or Mathematical", } @Article{Ceri:1989:MSJ, author = "Stefano Ceri and Georg Gottlob and Letizia Tanca and Gio Wiederhold", title = "Magic semi-joins", journal = j-INFO-PROC-LETT, volume = "33", number = "2", pages = "97--107", day = "10", month = nov, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68P15 (68T25)", MRnumber = "90m:68030", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Stanford Univ", affiliationaddress = "Stanford, CA, USA", classification = "723; C4250 (Database theory)", corpsource = "Dept. of Comput. Sci., Stanford Univ., CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algebraic formulas; algebraic operator; algorithms; centralized; Database Systems; database theory; datalog Queries; Deductive Databases; Distributed Databases; distributed databases; equivalence transformations; full reducer program; Logic Programming; magic semi-join; management; Optimization; recursive DATALOG queries; Recursive Query Optimization; Relational; Semijoins; theory; transitive closure; verification", subject = "F.4.1 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Logic programming \\ H.2.m Information Systems, DATABASE MANAGEMENT, Miscellaneous \\ G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous", treatment = "T Theoretical or Mathematical", } @Article{Szepietowski:1989:SNS, author = "Andrzej Szepietowski", title = "Some notes on strong and weak $\log \log n$ space complexity", journal = j-INFO-PROC-LETT, volume = "33", number = "2", pages = "109--112", day = "10", month = nov, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q15 (03D15)", MRnumber = "91a:68103", MRreviewer = "Burkhard Molzan", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Technical Univ of Gdansk", affiliationaddress = "Gdansk, Pol", classification = "721; C4240 (Programming and algorithm theory)", corpsource = "Dept. of Math., Tech. Univ. of Gdansk, Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Automata Theory; computational complexity; Computer Metatheory--Computability and Decidability; nondeterministically fully space constructible; Space Complexity; space complexity; theory; Turing Machines; verification", subject = "F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Bounded-action devices \\ F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Alternation and nondeterminism", treatment = "T Theoretical or Mathematical", } @Article{Grossi:1989:SES, author = "R. Grossi and F. Luccio", title = "Simple and efficient string matching with $k$ mismatches", journal = j-INFO-PROC-LETT, volume = "33", number = "3", pages = "113--120", day = "30", month = nov, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25", MRnumber = "90m:68057", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Univ di Pisa", affiliationaddress = "Pisa, Italy", classification = "723; 921; C4240 (Programming and algorithm theory)", corpsource = "Dipartimento di Inf., Pisa Univ., Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithm Design; algorithm theory; Algorithms; computational complexity; Computer Programming; Mathematical Techniques--Trees; mismatches; permutations; String Matching; string matching; suffix tree; Suffix Trees", treatment = "T Theoretical or Mathematical", } @Article{Shoudai:1989:LFT, author = "Takayoshi Shoudai", title = "The lexicographically first topological order problem is {NLOG-complete}", journal = j-INFO-PROC-LETT, volume = "33", number = "3", pages = "121--124", day = "30", month = nov, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (68Q15)", MRnumber = "90m:68062", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Kyushu Univ", affiliationaddress = "Fukuoka, Jpn", classification = "723; 921; C4240 (Programming and algorithm theory)", corpsource = "Dept. of Math., Kyushu Univ., Fukuoka, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm theory; Algorithms; complementation; Computational Complexity; computational complexity; Computer Metatheory--Computability and Decidability; Computer Programming; lexicographically first topological order problem; Mathematical Techniques--Graph Theory; nlog Completeness; NLOG-complete; sorting; topological order problem; Topological Sorting Problem", treatment = "T Theoretical or Mathematical", } @Article{Lopriore:1989:SCC, author = "Lanfranco Lopriore", title = "Software-controlled cache coherence protocol for multicache systems", journal = j-INFO-PROC-LETT, volume = "33", number = "3", pages = "125--130", day = "30", month = nov, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Consiglio Nazionale delle Ricerche", affiliationaddress = "Pisa, Italy", classification = "723; C5220 (Computer architecture); C5440 (Multiprocessor systems and techniques); C6120 (File organisation)", corpsource = "Istituto di Elaborazione dell'Inf., Consiglio Nazionale delle Ricerche, Pisa, Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "buffer storage; Cache Coherence Protocol; coherence; Computer Software; Computer Systems, Digital; memory architecture; multicache coherence protocol; multicache systems; multiple copies; Multiprocessing; multiprocessing systems; multiprocessor interconnection networks; shared data items; software control; storage management; Tightly Coupled Multiprocessor; tightly-coupled microprocessor system", treatment = "P Practical", } @Article{McCurley:1989:AVP, author = "E. Robert McCurley", title = "Auxiliary variables in partial correctness programming logics", journal = j-INFO-PROC-LETT, volume = "33", number = "3", pages = "131--133", day = "30", month = nov, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Georgia Inst of Technology", affiliationaddress = "Atlanta, GA, USA", classification = "723; C4210 (Formal logic); C4240 (Programming and algorithm theory); C6150C (Compilers, interpreters and other processors)", corpsource = "Sch. of Inf. and Comput. Sci., Georgia Inst. of Technol., Atlanta, GA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Auxiliary Variables; Computer Metatheory--Programming Theory; Computer Programming; formal logic; Owicki-Gries Logic; Owicki-Gries logic; Partial Correctness; partial correctness programming logics; program processors; Program Transformations; Programming Logic; programming theory; proof of correctness; Theory", treatment = "T Theoretical or Mathematical", } @Article{Akl:1989:OPA, author = "Selim G. Akl and David Gries and Ivan Stojmenov{\'\i}c", title = "An optimal parallel algorithm for generating combinations", journal = j-INFO-PROC-LETT, volume = "33", number = "3", pages = "135--139", day = "30", month = nov, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q22 (68Q25 68R05)", MRnumber = "91f:68077", MRreviewer = "Peter B. Gibbons", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Queen's Univ", affiliationaddress = "Kingston, Ont, Can", classification = "723; 921; C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. and Inf. Sci., Queen's Univ., Kingston, Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithm Design; Algorithms; combinations; Computer Programming; Computer Systems, Digital--Parallel Processing; Concurrency; constant size memory; lexicographically ascending order; Mathematical Techniques--Combinatorial Mathematics; optimal parallel algorithm; Parallel Algorithms; parallel algorithms", treatment = "T Theoretical or Mathematical", } @Article{Book:1989:NSS, author = "Ronald V. Book and Shou Wen Tang", title = "A note on sparse sets and the polynomial-time hierarchy", journal = j-INFO-PROC-LETT, volume = "33", number = "3", pages = "141--143", day = "30", month = nov, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q15 (03D15 03D20 68Q05)", MRnumber = "91d:68027", MRreviewer = "Jos{\'e} L. Balc{\'a}zar", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Univ of California", affiliationaddress = "Santa Barbara, CA, USA", classification = "723; 921; C4240 (Programming and algorithm theory)", corpsource = "Dept. of Math., California Univ., Santa Barbara, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm theory; Complexity Theory; Computability and Decidability; Computer Metatheory; Mathematical Techniques--Set Theory; Polynomial Time Hierarchy; polynomial-time hierarchy; polynomials; Relativizations; set theory; Sparse Oracle Sets; sparse sets", treatment = "T Theoretical or Mathematical", } @Article{Boppana:1989:ACP, author = "Ravi B. Boppana", title = "The average-case parallel complexity of sorting", journal = j-INFO-PROC-LETT, volume = "33", number = "3", pages = "145--146", day = "30", month = nov, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68P15 (68Q25)", MRnumber = "90m:68029", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Rutgers Univ", affiliationaddress = "New Brunswick, NJ, USA", classification = "723; 921; C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Rutgers Univ., New Brunswick, NJ, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; average-case parallel complexity; Comparison Trees; computational complexity; Computational Complexity; Computer Metatheory--Computability and Decidability; Computer Programming; Computer Systems Programming--Sorting; Lower Bounds; Mathematical Techniques--Trees; parallel algorithms; Parallel Algorithms; parallel comparison tree; sorting; trees (mathematics)", treatment = "T Theoretical or Mathematical", } @Article{Rao:1989:OPA, author = "A. Srinivasa Rao and C. Pandu Rangan", title = "Optimal parallel algorithms on circular-arc graphs", journal = j-INFO-PROC-LETT, volume = "33", number = "3", pages = "147--156", day = "30", month = nov, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q22 (05C85 68R10)", MRnumber = "91c:68044", MRreviewer = "M. C. Golumbic", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Indian Inst of Technology", affiliationaddress = "Madras, India", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci. and Eng., Indian Inst. of Technol., Madras, India", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithm Design; Algorithms; Circular Arc Graphs; circular-arc graphs; computational complexity; Computer Programming; Computer Systems, Digital--Parallel Processing; end points; EREW PRAM; graph theory; Mathematical Techniques--Graph Theory; Maximum Independent Set; maximum independent set; Minimum Clique Cover; minimum clique cover; Minimum Dominating Set; minimum dominating set; optimal parallel algorithms; Parallel Algorithms; parallel algorithms; sorted array", treatment = "T Theoretical or Mathematical", } @Article{Parker:1989:CSN, author = "Bruce Parker and Ian Parberry", title = "Constructing sorting networks from $k$-sorters", journal = j-INFO-PROC-LETT, volume = "33", number = "3", pages = "157--162", day = "30", month = nov, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68P10 (68Q25)", MRnumber = "90m:68025", MRreviewer = "Ingo Wegener", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "New Jersey Inst of Technology", affiliationaddress = "Newark, NJ, USA", classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. and Inf. Sci., New Jersey Inst. of Technol., Newark, NJ, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithm Analysis; Algorithms; Computer Programming; Computer Systems Programming--Sorting; k-sorters; merging networks; parallel algorithms; parallel architectures; sorting; Sorting Networks", treatment = "T Theoretical or Mathematical", } @Article{Berghammer:1989:SQD, author = "Rudolf Berghammer and G{\"u}nther Schmidt and Hans Zierer", title = "Symmetric quotients and domain constructions", journal = j-INFO-PROC-LETT, volume = "33", number = "3", pages = "163--168", day = "30", month = nov, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q55 (06E99)", MRnumber = "90m:68085", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Univ der Bundeswehr M{\"u}nchen", affiliationaddress = "Neubiberg, West Ger", classification = "723; 921; C4210 (Formal logic)", corpsource = "Univ. der Bundeswehr Muchen, Fakultat f{\"u}r Inf., Neubiberg, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Abstract Relational Algebra; abstract relational algebra; Computer Metatheory; Domain Constructions; domain constructions; domain theory; formal logic; Function Domains; function domains; Mathematical Techniques--Algebra; monomorphic characterization; noyau; Powersets; powersets; symmetric quotient; Symmetric Quotients", treatment = "T Theoretical or Mathematical", } @Article{Hershberger:1989:FUE, author = "John Hershberger", title = "Finding the upper envelope of $n$ line segments in ${O}(n \log n)$ time", journal = j-INFO-PROC-LETT, volume = "33", number = "4", pages = "169--174", day = "21", month = dec, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68U05 (11Y16)", MRnumber = "91d:68127", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "DEC Systems Research Cent", affiliationaddress = "Palo Alto, CA, USA", classification = "723; 921; C4240 (Programming and algorithm theory)", corpsource = "DEC Syst. Res. Center, Palo Alto, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Ackermann function; Algorithms; computational complexity; Computational Geometry; computational geometry; Computer Programming; Davenport--Schinzel Sequence; Davenport--Schinzel sequence; geometry; Line Segments; line segments; Mathematical Techniques--Geometry; Upper Envelope; upper envelope; worst-case complexity", treatment = "T Theoretical or Mathematical", } @Article{Lee:1989:PBP, author = "D. T. Lee and F. P. Preparata", title = "Parallel batched planar point location on the {CCC}", journal = j-INFO-PROC-LETT, volume = "33", number = "4", pages = "175--179", day = "21", month = dec, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68U05", MRnumber = "91i:68151", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Northwestern Univ", affiliationaddress = "Evanston, IL, USA", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory); C6120 (File organisation)", corpsource = "Dept. of Electr. Eng. and Comput. Sci., Northwestern Univ., Evanston, IL, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; batched planar point location; CCC; Computational Geometry; computational geometry; Computer Programming; Computer Systems, Digital--Parallel Processing; CREW PRAM; Cube Connected Cycles; cube-connected-cycle; data structures; graph theory; Mathematical Techniques--Graph Theory; Parallel Algorithms; parallel algorithms; Planar Point Location; planar subdivision; plane graph; segment tree", treatment = "T Theoretical or Mathematical", } @Article{Hagerup:1989:OMS, author = "Torben Hagerup and Christine R{\"u}b", title = "Optimal Merging and Sorting on the {EREW PRAM}", journal = j-INFO-PROC-LETT, volume = "33", number = "4", pages = "181--185", day = "21", month = dec, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68P10", MRnumber = "91c:68012", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Univ des Saarlandes", affiliationaddress = "Saarbr{\"u}cken, West Ger", classification = "723; C4240 (Programming and algorithm theory); C6130 (Data handling techniques)", corpsource = "Fachbereich Inf., Univ. des Saarlandes, Saarbrucken, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; computational complexity; Computer Programming; Computer Systems Programming--Sorting; Computer Systems, Digital--Parallel Processing; EREW PRAM; Exclusive-Read Exclusive-Write prams; Merging; merging; optimal EREW PRAM algorithms; Parallel Algorithms; parallel algorithms; Parallel Merging; Parallel Random Access Machines; Parallel Sorting; running times; sorting", treatment = "T Theoretical or Mathematical", } @Article{Levcopoulos:1989:NAP, author = "Christos Levcopoulos and Ola Petersson", title = "A note on adaptive parallel sorting", journal = j-INFO-PROC-LETT, volume = "33", number = "4", pages = "187--191", day = "21", month = dec, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68P10", MRnumber = "91c:68015", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Lund Univ", affiliationaddress = "Lund, Swed", classification = "723; C4240 (Programming and algorithm theory); C6130 (Data handling techniques)", corpsource = "Dept. of Comput. Sci., Lund Univ., Sweden", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "adaptive parallel sorting; Algorithms; computational complexity; Computer Programming; Computer Systems Programming--Sorting; Computer Systems, Digital--Parallel Processing; cost optimal parallel algorithm; EREW PRAM model; Exclusive-Read Exclusive-Write pram; Parallel Algorithms; parallel algorithms; Parallel Random Access Machines; Parallel Sorting; presorted sequences; Rem; sorting", treatment = "T Theoretical or Mathematical", } @Article{Wanke:1989:UBP, author = "Egon Wanke and Manfred Wiegers", title = "Undecidability of the bandwidth problem on linear graph languages", journal = j-INFO-PROC-LETT, volume = "33", number = "4", pages = "193--197", day = "21", month = dec, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q45", MRnumber = "91c:68078", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Univ-Gesamthochschule-Paderborn", affiliationaddress = "Paderborn, West Ger", classification = "721; 723; 921; C1160 (Combinatorial mathematics); C4210 (Formal logic)", corpsource = "Fachbereich Math./Inf., Univ. Gesamthochschule-Paderborn, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Automata Theory; Bandwidth Problem; bandwidth problem; Computer Metatheory--Computability and Decidability; correspondence problem; decidability; fixed integer; Formal Languages; formal languages; Graph Grammars; graph grammars; graph theory; instance language; layout problems; Linear Graph Languages; linear graph languages; Mathematical Techniques--Graph Theory; monadic second order logic; undecidable", treatment = "T Theoretical or Mathematical", } @Article{Rolim:1989:PIC, author = "Jos{\'e} D. P. Rolim", title = "On the polynomial {IO-complexity}", journal = j-INFO-PROC-LETT, volume = "33", number = "4", pages = "199--204", day = "21", month = dec, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (03D15)", MRnumber = "91k:68092", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Odense Univ", affiliationaddress = "Odense, Den", classification = "723; C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Odense Univ., Denmark", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "approximation languages; Complexity Classes; Computability and Decidability; computational complexity; Computer Metatheory; density functions; io Complexity; IO-complexity; NP problems; Polynomial Complexity; polynomial IO-complexity; polynomial time; polynomials; Turing machines; uniform probability distribution; XTIME", treatment = "T Theoretical or Mathematical", } @Article{Boreddy:1989:AFP, author = "Jayaramaiah Boreddy and R. N. Mukherjee", title = "An algorithm to find polygon similarity", journal = j-INFO-PROC-LETT, volume = "33", number = "4", pages = "205--206", day = "21", month = dec, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68U05", MRnumber = "91c:68117", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, affiliation = "Banaras Hindu Univ", affiliationaddress = "Varanasi, India", classification = "723; 921; C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Banaras Hindu Univ., Varanasi, India", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "affine transformation; Affine Transformations; Algorithms; centroid; Computational Geometry; computational geometry; Computer Programming; Cyclic Permutation; cyclic permutation; matching pair; Mathematical Techniques--Geometry; normalisation; Polygon Similarity; polygon similarity; similarity measure; Triangulation; triangulation", treatment = "T Theoretical or Mathematical", } @Article{Zippel:1989:ESR, author = "Richard Zippel", title = "An explicit separation of relativised random polynomial time and relativised deterministic polynomial time", journal = j-INFO-PROC-LETT, volume = "33", number = "4", pages = "207--212", day = "21", month = dec, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "03D15 (68Q15)", MRnumber = "91a:03087", MRreviewer = "Evangelos Kranakis", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "computational complexity; explicit separation; naturally occurring problems; oracle; relativised deterministic polynomial time; relativised random polynomial time; zero testing", treatment = "T Theoretical or Mathematical", } @Article{Zerovnik:1989:RHA, author = "J. Zerovnik", title = "A randomised heuristical algorithm for estimating the chromatic number of a graph", journal = j-INFO-PROC-LETT, volume = "33", number = "4", pages = "213--219", day = "21", month = dec, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Inst. za Mathematiko, Fiziko in Mehaniko, Ljubljana, Yugoslavia", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "antivoter algorithm; chromatic number; computational complexity; convergence of numerical methods; convergence properties; graph; graph colouring; multi-particle system; physical process; positive probability; randomised heuristical algorithm; statistical mechanics; vertices", treatment = "T Theoretical or Mathematical", } @Article{Dunne:1990:CKP, author = "P. E. Dunne", title = "Comment on {Kochol}'s paper {``Efficient monotone circuits for threshold functions''} {[Inform. Process. Lett. {\bf 32}(3), 24 August 1989, pp. 121--122]}", journal = j-INFO-PROC-LETT, volume = "34", number = "5", pages = "221--222", day = "7", month = may, year = "1990", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See \cite{Kochol:1989:EMC}.", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4230 (Switching theory)", corpsource = "Dept. of Comput. Sci., Liverpool Univ., UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "Boolean functions; circuit complexity; computational complexity; monotone circuits; threshold functions; threshold logic", treatment = "T Theoretical or Mathematical", } @Article{VanGasteren:1990:CPD, author = "A. J. M. {Van Gasteren} and G. Tel", title = "Comments on {``On the proof of a distributed algorithm''}: always-true is not invariant {[Inform. Process. Lett. {\bf 25}(3), 29 May 1987, pp. 145--147]}", journal = j-INFO-PROC-LETT, volume = "35", number = "6", pages = "277--279", day = "15", month = sep, year = "1990", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See \cite{Verjus:1987:PDA,Pettersson:1991:LEC}.", acknowledgement = ack-nhfb, affiliation = "Utrecht Univ", affiliationaddress = "Utrecht, Neth", classification = "723; C4240 (Programming and algorithm theory); C6150G (Diagnostic, testing, debugging and evaluating systems)", corpsource = "Dept. of Comput. Sci., Utrecht Univ., Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; Computer Programming; Computer Systems, Digital --- Distributed; distributed algorithm; Distributed Algorithms; distributed processing; induction method; invariance proofs; Invariance Proofs; program verification", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Floren:1991:NFA, author = "Rolf Floren", title = "A note on: {``A faster approximation algorithm for the {Steiner} problem in graphs'' [Inform. Process. Lett. {\bf 27} (1988), no. 3, 125--128; MR 89d:68031] by K. Mehlhorn}", journal = j-INFO-PROC-LETT, volume = "38", number = "4", pages = "177--178", day = "31", month = may, year = "1991", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68R10 (68Q25)", MRnumber = "92g:68113", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See \cite{Mehlhorn:1988:FAA}.", acknowledgement = ack-nhfb, affiliation = "Universitat Dortmund", affiliationaddress = "Dortmund, Germany", classification = "723; 921; C1160 (Combinatorial mathematics); C4130 (Interpolation and function approximation); C4240 (Programming and algorithm theory)", corpsource = "Lehrstuhl Inf. XII, Dortmund Univ., Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; approximation algorithm; Approximation Algorithms; approximation theory; complexity; computational complexity; Computer Programming; edges; graph theory; graphs; Mathematical Techniques --- Graph Theory; Steiner Problem; Steiner tree approximation algorithm; Steiner Trees; terminals; V; vertices", treatment = "T Theoretical or Mathematical", } @Article{Pettersson:1991:LEC, author = "Jimmi S. Pettersson", title = "Letter to the Editor: Comments on {``Always-true is not invariant''}: Assertional reasoning about invariance {[Inform. Process. Lett. {\bf 35}(6), 15 September 1990, pp. 277--279]}", journal = j-INFO-PROC-LETT, volume = "40", number = "5", pages = "231--233", day = "13", month = dec, year = "1991", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See \cite{Verjus:1987:PDA,VanGasteren:1990:CPD}.", acknowledgement = ack-nhfb, affiliation = "TEL", affiliationaddress = "Horsholm, Den", classification = "723; 731; 922; C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "TFL, Horsholm, Denmark", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Always-True; always-true; Assertional Reasoning; assertional reasoning; Computer Metatheory --- Programming Theory; Computer Programming --- Program Debugging; Control Systems; formal logic; Hoare logic; Invariance; invariance; Invariant; Mathematical Models --- Theory; Program Composition; Program Correctness; program correctness; program verification; programming theory; Sanders' Theorem; UNITY reasoning", treatment = "T Theoretical or Mathematical", } @Article{Grossi:1991:FCS, author = "Roberto Grossi", title = "Further comments on the subtree isomorphism for ordered trees: {``On the subtree isomorphism problem for ordered trees'' [Inform. Process. {Lett. \bf 32} (1989), no. 5, 271--273; MR 90k:68139] by E. {M{\"a}kinen}}", journal = j-INFO-PROC-LETT, volume = "40", number = "5", pages = "255--256", day = "13", month = dec, year = "1991", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68R10 (05C05 68P05 68Q25)", MRnumber = "93c:68077", MRreviewer = "Fabrizio Luccio", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See \cite{Makinen:1989:SIP}.", acknowledgement = ack-nhfb, affiliation = "Universita di Pisa", affiliationaddress = "Pisa, Italy", classification = "723; 731; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dipartimento di Inf., Pisa Univ., Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm theory; Binary Tree Representation; Codes, Symbolic --- Coding Errors; coding; Computer Metatheory --- Binary Sequences; Computer Programming --- Algorithms; Design of Algorithms; Mathematical Techniques; Mathematical Techniques --- Linear Algebra; Ordered Trees; ordered trees; Subtree Isomorphism; subtree isomorphism; Trees; trees (mathematics); unordered rooted trees", treatment = "T Theoretical or Mathematical", } @Article{Satyanarayanan:1992:NRT, author = "R. Satyanarayanan and D. R. Muthukrishnan", title = "A note on {Raymond}'s tree based algorithm for distributed mutual exclusion", journal = j-INFO-PROC-LETT, volume = "43", number = "5", pages = "249--255", day = "5", month = oct, year = "1992", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q10", MRnumber = "93g:68041", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See \cite{Raymond:1989:DAM}.", acknowledgement = ack-nhfb, affiliation = "Indian Inst of Technology", affiliationaddress = "Madras, India", classification = "721.1; 722.3; 723.1; 723.2; 921.4; C4240P (Parallel programming and algorithm theory); C6120 (File organisation)", corpsource = "Dept. of Comput. Sci. and Eng., Indian Inst. of Technol., Madras, India", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; Computer systems programming; Concurrency; Critical section; critical section execution; Data communication systems; Data processing; distributed algorithms; Distributed computer systems; distributed mutual exclusion algorithms; Fairness; fairness criterion; fairness property; least executed criterion; lower bounds; message generation; Modification; Multiprocessing systems; Mutual exclusion; Parallel processing systems; Programming theory; Raymond algorithm; Raymond's tree based algorithm; spanning tree diameter; starvation freedom; tree based algorithm; tree data structures; Trees (mathematics); upper bounds", treatment = "T Theoretical or Mathematical", } @Article{Steiner:1993:NSU, author = "George Steiner and Scott Yeomans", title = "A note on: {``Scheduling unit-time tasks with integer release times and deadlines'' [Inform. Process. Lett. {\bf 16} (1983), no. 4, 171--173; MR 84m:68030] by G. Frederickson}", journal = j-INFO-PROC-LETT, volume = "47", number = "3", pages = "165--166", day = "14", month = sep, year = "1993", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68M20 (90B35)", MRnumber = "94g:68018", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib", note = "See \cite{Frederickson:1983:SUT}.", acknowledgement = ack-nhfb, affiliation = "McMaster Univ", affiliationaddress = "Hamilton, Ont, Can", classification = "721.1; 722.4; 723.2; 921.6; C4240P (Parallel programming and algorithm theory); C6150N (Distributed systems)", corpsource = "Fac. of Bus., McMaster Univ., Hamilton, Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithm linearity; Algorithms; Computational complexity; computational complexity; Data processing; Data structures; Deadlines; deadlines; integer release times; Multiprocessing systems; multiprocessing systems; O(n) time; Release times; release times; Scheduling; scheduling; Unit time tasks; unit-time tasks", treatment = "T Theoretical or Mathematical", }