%%% -*-BibTeX-*- %%% ==================================================================== %%% BibTeX-file{ %%% author = "Nelson H. F. Beebe", %%% version = "3.15", %%% date = "01 October 2024", %%% time = "07:05:51 MDT", %%% filename = "infoproc1970.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 = "59835 19212 78477 787003", %%% 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 COMPLETE bibliography of the journal %%% Information Processing Letters (CODEN IFPLAT, %%% ISSN 0020-0190), published by %%% Elsevier/North-Holland, covering the decade %%% 1970--1979. %%% %%% At version 1.26, the original infoproc.bib %%% file was approaching 4000 entries, so it was %%% split into decade-specific files, to avoid %%% hitting internal limits of BibTeX and TeX. %%% %%% Entries with addenda, comments, corrigenda, %%% errata, letters to the editor, and remarks on %%% earlier articles contain cross references to %%% entries for those articles, which are %%% included here for completeness, even if they %%% are duplicated in another of the %%% decade-specific bibliographies for this %%% journal. %%% %%% This journal now has a World-Wide Web site at %%% %%% http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/ %%% %%% with tables of contents from 1994 (Volume %%% 49) to date. All of the data at that site %%% for volumes 49--68 has been merged into %%% this file. %%% %%% Abstracts and full text of articles are %%% available electronically to qualified %%% subscribers, which includes members of %%% organizations with institutional %%% subscriptions; most large universities should %%% fall in this group. For details, visit %%% %%% http://www.elsevier.com:80/inca/publications/store/5/0/5/6/1/2/?menu=cont&label=table %%% %%% At version 3.15, the year coverage looked %%% like this: %%% %%% 1971 ( 19) 1979 ( 135) 1987 ( 2) %%% 1972 ( 41) 1980 ( 74) 1988 ( 0) %%% 1973 ( 39) 1981 ( 7) 1989 ( 0) %%% 1974 ( 26) 1982 ( 45) 1990 ( 0) %%% 1975 ( 58) 1983 ( 1) 1991 ( 0) %%% 1976 ( 69) 1984 ( 0) 1992 ( 1) %%% 1977 ( 58) 1985 ( 1) %%% 1978 ( 80) 1986 ( 2) %%% %%% Article: 657 %%% Book: 1 %%% %%% Total entries: 658 %%% %%% 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. %%% %%% At version 3.00, another 12 entries were %%% added by the laborious task of scanning the %%% decennial index, converting to text with %%% OCR software, and then correcting the large %%% number of errors resulting, both from %%% errors in the scanning, and in the original %%% index itself. This completes the coverage %%% of all articles for this decade. %%% %%% 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-BIT= "BIT"} @String{j-INFO-PROC-LETT= "Information Processing Letters"}

%%% ==================================================================== %%% Publishers and their addresses:

@String{pub-SUCSLI= "Stanford University Center for the Study of Language and Information"} @String{pub-SUCSLI:adr= "Stanford, CA, USA"}

%%% ==================================================================== %%% 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{Stacey:1971:RVM, author = "G. M. Stacey", title = "The role of virtual memory in the handling of application files", journal = j-INFO-PROC-LETT, volume = "1", number = "1", pages = "1--3", day = "??", month = feb, year = "1971", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation); C6130 (Data handling techniques)", corpsource = "Univ. Toronto, Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "application files; array handling; file processing; models; storage management; virtual memory", treatment = "T Theoretical or Mathematical", } @Article{Duncan:1971:PSS, author = "F. G. Duncan and D. Zissos", title = "Programmed simulation of sequential circuits", journal = j-INFO-PROC-LETT, volume = "1", number = "1", pages = "4--6", day = "??", month = feb, year = "1971", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4230D (Sequential switching theory)", corpsource = "Univ. Calgary, Alta., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "Boolean variables; programmed simulation; sequential circuits; simulation", treatment = "T Theoretical or Mathematical", } @Article{Maurer:1971:SPG, author = "H. A. Maurer", title = "The solution of a problem by {Ginsburg}", journal = j-INFO-PROC-LETT, volume = "1", number = "1", pages = "7--11 (or 7--10??)", day = "??", month = feb, year = "1971", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Univ. Calgary, Alta., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "alphabet; context free languages; context-free languages; three symbols", treatment = "T Theoretical or Mathematical", } @Article{Zissos:1971:PSR, author = "D. Zissos and F. G. Duncan", title = "Programmed simulation of race hazards in sequential circuits", journal = j-INFO-PROC-LETT, volume = "1", number = "1", pages = "11--13", day = "??", month = feb, year = "1971", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4230D (Sequential switching theory)", corpsource = "Univ. Calgary, Alta., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "hazards and race conditions; programmed simulation; race hazards; sequential circuits; simulation", treatment = "T Theoretical or Mathematical", } @Article{Henhapl:1971:RTM, author = "W. Henhapl and C. B. Jones", title = "A run-time mechanism for referencing variables", journal = j-INFO-PROC-LETT, volume = "1", number = "1", pages = "14--16", day = "??", month = feb, year = "1971", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C6130 (Data handling techniques); C6150C (Compilers, interpreters and other processors)", corpsource = "IBM Lab., Vienna, Austria", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "algorithmic languages; compilers; program compilers; recursive invocation of procedures; referencing variables; run time mechanism; storage allocation", treatment = "T Theoretical or Mathematical", } @Article{Merret:1971:GPM, author = "T. H. Merret", title = "General programs for management systems", journal = j-INFO-PROC-LETT, volume = "1", number = "1", pages = "17--20", day = "??", month = feb, year = "1971", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C6150E (General utility programs)", corpsource = "Linacre Coll., Oxford, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "general program concept; report generators; report writer; utility programs", treatment = "G General Review", } @Article{Karlgren:1971:SRS, author = "H. Karlgren", title = "Stacking without really stacking when reducing categorical expressions", journal = j-INFO-PROC-LETT, volume = "1", number = "1", pages = "21--22", day = "??", month = feb, year = "1971", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C6130 (Data handling techniques); C6150C (Compilers, interpreters and other processors)", corpsource = "Res. Group Quantitative Linguistics Fack, Stockholm, Sweden", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "data handling; program compilers; reducing categorical expressions; stacking; string; tree analysis", treatment = "T Theoretical or Mathematical", } @Article{Knuth:1971:ENA, author = "Donald E. Knuth and R. W. Floyd", title = "Erratum: {``Notes on avoiding `go to' statements''}", journal = j-INFO-PROC-LETT, volume = "1", number = "1", pages = "23--31", day = "??", month = feb, year = "1971", 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/infoproc1970.bib", note = "See \cite{Knuth:1971:NAG}", acknowledgement = ack-nhfb, fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", } @Article{Knuth:1971:NAG, author = "Donald E. Knuth and R. W. Floyd", title = "Notes on avoiding {``go to''} statements", journal = j-INFO-PROC-LETT, volume = "1", number = "1", pages = "23--31", day = "??", month = feb, year = "1971", 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/infoproc1970.bib", note = "See erratum \cite{Knuth:1971:ENA}. Reprinted in {\sl Writings of the Revolution}, E. Yourdon, ed.\ (New York: Yourdon Press, 1982), 153--162", acknowledgement = ack-nhfb, classification = "C6110 (Systems analysis and programming)", corpsource = "Stanford Univ., CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "ALGOL; backtracking; go to statements; languages; programming; symbol table searching", subject = "D.3.3 Software, PROGRAMMING LANGUAGES, Language Constructs, Control structures \\ F.3 Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs", treatment = "G General Review", } @Article{Hopcroft:1971:ADI, author = "J. Hopcroft and R. E. Tarjan", title = "A {$ V^2 $} algorithm for determining isomorphism of planar graphs", journal = j-INFO-PROC-LETT, volume = "1", number = "1", pages = "32--34", day = "??", month = feb, year = "1971", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics)", corpsource = "Stanford Univ., CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "graph theory; isomorphism; labelled edges; undirected planar graphs; vertices", treatment = "T Theoretical or Mathematical", } @Article{Salton:1971:PII, author = "G. Salton", title = "The performance of interactive information retrieval", journal = j-INFO-PROC-LETT, volume = "1", number = "2", pages = "35--41", day = "??", month = jul, year = "1971", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C7250 (Information storage and retrieval)", corpsource = "Cornell Univ., Ithaca, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "information retrieval system evaluation; interactive information retrieval; language analysis; man-machine systems; online operation; performance measurements", treatment = "G General Review", } @Article{Tsichritzis:1971:NCS, author = "D. Tsichritzis", title = "A note on comparison of subrecursive hierarchies", journal = j-INFO-PROC-LETT, volume = "1", number = "2", pages = "42--44", day = "??", month = jul, year = "1971", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4290 (Other computer theory)", corpsource = "Univ. Toronto, Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "comparison; computability and decidability; low level complexity classes; subrecursive hierarchies", treatment = "T Theoretical or Mathematical", } @Article{Caviness:1971:ELC, author = "B. F. Caviness and P. L. Pollack and C. M. Rubald", title = "An existence lemma for canonical forms in symbolic mathematics", journal = j-INFO-PROC-LETT, volume = "1", number = "2", pages = "45--46", day = "??", month = jul, year = "1971", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C1100 (Mathematical techniques)", corpsource = "Univ. Wisconsin, Madison, WI, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "canonical forms; existence lemma; mathematics; recursively enumerable set; symbolic mathematics", treatment = "T Theoretical or Mathematical", } @Article{Milgram:1971:NSC, author = "D. L. Milgram and A. Rosenfeld", title = "A note on scattered context grammars", journal = j-INFO-PROC-LETT, volume = "1", number = "2", pages = "47--50", day = "??", month = jul, year = "1971", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Univ. Maryland, College Park, MD, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "grammars; scattered context grammars", treatment = "T Theoretical or Mathematical", } @Article{Corneil:1971:ADB, author = "D. G. Corneil", title = "An $ n^2 $ algorithm for determining the bridges of a graph", journal = j-INFO-PROC-LETT, volume = "1", number = "2", pages = "51--55", day = "??", month = jul, year = "1971", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics)", corpsource = "Univ. Toronto, Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "bridges; deterministic algorithm; graph theory; undirected graph", treatment = "T Theoretical or Mathematical", } @Article{Munro:1971:EDT, author = "I. Munro", title = "Efficient determination of the transitive closure of a directed graph", journal = j-INFO-PROC-LETT, volume = "1", number = "2", pages = "56--58", day = "??", month = jul, year = "1971", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics)", corpsource = "Univ. Toronto, Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "directed graph; graph theory; matrix multiplication; transitive closure", treatment = "T Theoretical or Mathematical", } @Article{Gelenbe:1971:TTR, author = "E. Gelenbe", title = "The two-thirds rule for dynamic storage allocation under equilibrium", journal = j-INFO-PROC-LETT, volume = "1", number = "2", pages = "59--60", day = "??", month = jul, year = "1971", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation); C6130 (Data handling techniques)", corpsource = "Univ. Michigan, Ann Arbor, MI, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "dynamic storage allocation under equilibrium; storage allocation; two thirds rule", treatment = "T Theoretical or Mathematical", } @Article{Scheiding:1971:REM, author = "H. Scheiding", title = "Representation and equality of modes", journal = j-INFO-PROC-LETT, volume = "1", number = "2", pages = "61--65", day = "??", month = jul, year = "1971", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C6140D (High level languages)", corpsource = "Univ. Munchen, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "ALGOL; equality; mode representation; Munich ALGOL 68 implementation", treatment = "T Theoretical or Mathematical", } @Article{Borodin:1971:EPM, author = "A. Borodin and I. Munro", title = "Evaluating polynomials at many points", journal = j-INFO-PROC-LETT, volume = "1", number = "2", pages = "66--68", day = "??", month = jul, year = "1971", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4120 (Functional analysis)", corpsource = "Univ. Toronto, Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "basic arithmetics; fast matrix multiplication; function evaluation; numerical analysis; numerical computations; polynomial evaluation; polynomials; preconditioning", treatment = "T Theoretical or Mathematical", } @Article{Tzafestas:1972:IOM, author = "S. G. Tzafestas", title = "Input-output modeling and identification of linear automata", journal = j-INFO-PROC-LETT, volume = "1", number = "3", pages = "69--75 (or 69--70??)", day = "??", month = feb, year = "1972", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C1220 (Simulation, modelling and identification); C4220 (Automata theory); C4230D (Sequential switching theory)", corpsource = "Nuclear Res. Center `Democritus' Athens, Greece", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "finite automata; identification; input output modelling; linear automata; modelling; sequential machines", treatment = "T Theoretical or Mathematical", xxtitle = "Input-output modelling and identification of linear automata", } @Article{Ogilvie:1972:UCS, author = "J. C. Ogilvie and C. L. Olson", title = "On the use of complete subgraphs in cluster analysis", journal = j-INFO-PROC-LETT, volume = "1", number = "3", pages = "76--79", day = "??", month = feb, year = "1972", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "B6140C (Optical information, image and video signal processing); C1250 (Pattern recognition)", corpsource = "Univ. Toronto, Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "cluster analysis; complete subgraphs; graph theory; partition; pattern recognition; underlying distributions", treatment = "T Theoretical or Mathematical", } @Article{vanDam:1972:SDP, author = "A. {van Dam} and F. Wm. Tompa", title = "Software data paging and segmentation for complex systems", journal = j-INFO-PROC-LETT, volume = "1", number = "3", pages = "80--86", day = "??", month = feb, year = "1972", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation); C6140D (High level languages)", corpsource = "Brown Univ., Providence, RI, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "addressing scheme; complex systems; design trade offs; LSD; programming languages; S/360; segmentation; software data paging; storage allocation; supervisory programs; systems programming language", treatment = "A Application; P Practical", } @Article{Whale:1972:CVB, author = "J. F. Whale", title = "The critical value of the basic parameter of a nonlinear differential equation", journal = j-INFO-PROC-LETT, volume = "1", number = "3", pages = "87--90", day = "??", month = feb, year = "1972", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Tue Nov 17 17:23:36 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4170 (Differential equations)", corpsource = "Univ. Auckland, New Zealand", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "critical parameter; critical value; nonlinear differential equations; numerical mathematics", treatment = "T Theoretical or Mathematical", } @Article{Solntseff:1972:CEP, author = "N. Solntseff", title = "A classification of extensible programming languages", journal = j-INFO-PROC-LETT, volume = "1", number = "3", pages = "91--96", day = "??", month = feb, year = "1972", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C6140 (Programming languages)", corpsource = "McMaster Univ., Hamilton, Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "classification; extensible languages; formal model; macro; programming languages; programming languages classification; translation extension mechanism", treatment = "T Theoretical or Mathematical", } @Article{Solntseff:1972:EEC, author = "N. Solntseff and A. Yezerski", title = "{ECT}: an extensible-contractable translator system", journal = j-INFO-PROC-LETT, volume = "1", number = "3", pages = "97--99", day = "??", month = feb, year = "1972", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C6150C (Compilers, interpreters and other processors)", corpsource = "McMaster Univ., Hamilton, Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "contractable; ECT; extensible; program interpreters; programming languages; semantics language; syntax language; translator system", treatment = "P Practical", xxtitle = "ACT --- an extensible-contractable translator system", } @Article{Gries:1972:PI, author = "D. Gries", title = "Programming by induction", journal = j-INFO-PROC-LETT, volume = "1", number = "3", pages = "100--107", day = "??", month = feb, year = "1972", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4290 (Other computer theory); C6110 (Systems analysis and programming)", corpsource = "Cornell Univ., Ithaca, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "analysis of algorithms; education; induction; programming; programming languages; programming technique", treatment = "A Application; T Theoretical or Mathematical", } @Article{Zimmer:1972:SP, author = "R. Zimmer", title = "Soft precedence", journal = j-INFO-PROC-LETT, volume = "1", number = "3", pages = "108--110", day = "??", month = feb, year = "1972", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Siemens AG, Munich, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "context free grammar; context-free grammars; detection of handles; language processors; precedence grammars; programming languages; soft precedence; syntactic analysis", treatment = "T Theoretical or Mathematical", } @Article{Chroust:1972:EEM, author = "G. Chroust", title = "Expression evaluation with minimum average working storage", journal = j-INFO-PROC-LETT, volume = "1", number = "3", pages = "111--114", day = "??", month = feb, year = "1972", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4290 (Other computer theory)", corpsource = "IBM, Vienna, Austria", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "average demand; expression evaluation; optimisation; optimization; programming theory; registers; storage allocation; working storage", treatment = "T Theoretical or Mathematical", } @Article{Mayoh:1972:RS, author = "B. H. Mayoh", title = "Recursion and stacks", journal = j-INFO-PROC-LETT, volume = "1", number = "3", pages = "115--116", day = "??", month = feb, year = "1972", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4290 (Other computer theory)", corpsource = "Univ. Aarhus, Denmark", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "data structure; data structures; programming languages; programming theory; recursion; stacks; theory of computation", treatment = "T Theoretical or Mathematical", } @Article{Bron:1972:OMB, author = "C. Bron", title = "Outline of a machine without branch instructions", journal = j-INFO-PROC-LETT, volume = "1", number = "3", pages = "117--119", day = "??", month = feb, year = "1972", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4290 (Other computer theory)", corpsource = "Technol. Univ., Eindhoven, Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "closed subroutine; goto statements; machine coding; machine design; program control; programming theory; sequencing; without branch instructions", treatment = "T Theoretical or Mathematical", } @Article{Tarjan:1972:DWG, author = "R. E. Tarjan", title = "Determining whether a groupoid is a group", journal = j-INFO-PROC-LETT, volume = "1", number = "3", pages = "120--124", day = "??", month = feb, year = "1972", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4190 (Other numerical methods)", corpsource = "Stanford Univ., CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "Abelian; algebra; associativity; binary operation; computation time; group; groupoid; numerical analysis; solvability", treatment = "T Theoretical or Mathematical", } @Article{Tsichritzis:1972:POS, author = "D. Tsichritzis", title = "Protection in operating systems", journal = j-INFO-PROC-LETT, volume = "1", number = "4", pages = "127--131", day = "??", month = jun, year = "1972", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C6150J (Operating systems)", corpsource = "Univ. Toronto, Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "file systems; operating systems; operating systems (computers); protection; reliability; security", treatment = "G General Review", } @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 = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.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{Carroll:1972:ACA, author = "J. M. Carroll and W. Fraser and G. Gill", title = "Automatic content analysis in an on-line environment", journal = j-INFO-PROC-LETT, volume = "1", number = "4", pages = "134--140", day = "??", month = jun, year = "1972", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C7240 (Information analysis and indexing)", corpsource = "Univ. Western Ontario, London, Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "content significant strings; first four letters; free form content analysis; information science; initial letter counts; online environment; online operation; word frequency data", treatment = "P Practical", } @Article{Branquart:1972:CFS, author = "P. Branquart and J. P. Cardinael and J. P. Delescaille and J. Lewi", title = "A context-free syntax of {ALGOL 68}", journal = j-INFO-PROC-LETT, volume = "1", number = "4", pages = "141--148", day = "??", month = jun, year = "1972", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C6140D (High level languages)", corpsource = "MBLE Res. Lab., Brussels, Belgium", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "abbreviations; ALGOL; ALGOL 68; context free syntax; context-free languages; extended language; representation language; strict language", treatment = "P Practical", } @Article{Siklossy:1972:FRO, author = "L. Sikl{\'o}ssy", title = "Fast and read-only algorithms for traversing trees without an auxiliary stack", journal = j-INFO-PROC-LETT, volume = "1", number = "4", pages = "149--152", day = "??", month = jun, year = "1972", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C6110 (Systems analysis and programming)", corpsource = "Univ. Texas, Austin, TX, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "address fields; bit; COMPASS programming language; fast read only tree traversal algorithms; programming; storage cells; tag bit; trees (mathematics)", treatment = "T Theoretical or Mathematical", } @Article{Toussaint:1972:FEQ, author = "G. T. Toussaint", title = "Feature evaluation with quadratic mutual information", journal = j-INFO-PROC-LETT, volume = "1", number = "4", pages = "153--156", day = "??", month = jun, year = "1972", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "B6140C (Optical information, image and video signal processing); C1250 (Pattern recognition)", corpsource = "Univ. British Columbia, Vancouver, BC, Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "class conditional distribution; combined evaluation measures; criteria; distribution; feature evaluation; feature vector; pattern recognition; quadratic mutual information; Shannon's entropy", treatment = "T Theoretical or Mathematical", } @Article{Horowitz:1972:FMI, author = "E. Horowitz", title = "A fast method for interpolation using preconditioning", journal = j-INFO-PROC-LETT, volume = "1", number = "4", pages = "157--163", day = "??", month = jun, year = "1972", 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/infoproc1970.bib", note = "See erratum \cite{Horowitz:1972:EFM}.", acknowledgement = ack-nhfb, classification = "C4130 (Interpolation and function approximation)", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "fast method; interpolation; preconditioning; restricted interpolation problem", treatment = "T Theoretical or Mathematical", } @Article{Kral:1972:NAP, author = "J. Kr{\'a}l", title = "A new additive pseudorandom number generator for extremely short word-length", journal = j-INFO-PROC-LETT, volume = "1", number = "4", pages = "164--167", day = "??", month = jun, year = "1972", CODEN = "IFPLAT", DOI = "https://doi.org/10.1016/0020-0190(72)90051-8", 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/infoproc1970.bib", note = "See erratum \cite{Kral:1972:ENA}.", abstract = "We study the suitability of the additive lagged-Fibonacci pseudo-random number generator for parallel computation. This generator has relatively short period with respect to the size of its seed. However, the short period is more than made up for with the huge number of full-period cycles it contains. These different full period cycles are called equivalence classes. We show how to enumerate the equivalence classes and how to compute seeds to select a given equivalence class, In addition, we present some theoretical measures of quality for this generator when used in parallel. Next, we conjecture on the size of these measures of quality for this generator. Extensive empirical evidence supports this conjecture. In addition, a probabilistic interpretation of these measures leads to another conjecture similarly supported by empirical evidence. Finally we give an explicit parallelization suitable for a fully reproducible asynchronous MIMD implementation.", acknowledgement = ack-nhfb, classification = "C7890 (Other special applications of computing)", corpsource = "RWTH, Aachen, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "additive pseudorandom number generator; CDC FORTRAN subroutine; extremely short word lengths; mod 2/sup j/ arithmetics; random number generation; shuffling; subroutines", treatment = "T Theoretical or Mathematical", } @Article{Molchanov:1972:AIB, author = "I. N. Molchanov and L. D. Nikolenko", title = "On an approach to integrating boundary problems with a non-unique solution", journal = j-INFO-PROC-LETT, volume = "1", number = "4", pages = "168--172", day = "??", month = jun, year = "1972", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4170 (Differential equations)", corpsource = "Inst. Cybernetics, Acad. Sci., Kiev, Ukrainian SSR, USSR", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "boundary-value problems; derivatives; difference equations; differential equations; finite difference methods; integrating; linear boundary problem; nonunique solution", treatment = "T Theoretical or Mathematical", } @Article{Knuth:1972:EOS, author = "Donald E. Knuth and E. B. Kaehler", title = "An experiment in optimal sorting", journal = j-INFO-PROC-LETT, volume = "1", number = "4", pages = "173--176", day = "??", month = jun, year = "1972", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C6130 (Data handling techniques)", corpsource = "Stanford Univ., CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "13 elements; 14 elements; combinatorial problems; merge insertion; optimal sorting; optimisation; sorting", treatment = "T Theoretical or Mathematical; X Experimental", } @Article{Dijkstra:1972:ISS, author = "E. W. Dijkstra", title = "Information streams sharing a finite buffer", journal = j-INFO-PROC-LETT, volume = "1", number = "5", pages = "179--180", day = "??", month = oct, year = "1972", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4290 (Other computer theory)", corpsource = "Technological Univ. Eindhoven, Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "buffer sharing; computation theory; individual starvation; information streams; synchronisation", treatment = "T Theoretical or Mathematical", } @Article{Vantilborgh:1972:EDS, author = "H. Vantilborgh and A. {van Lamsweerde}", title = "On an extension of {Dijkstra}'s semaphore primitives", journal = j-INFO-PROC-LETT, volume = "1", number = "5", pages = "181--186", day = "??", month = oct, year = "1972", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "MBLE Res. Lab., Brussels, Belgium", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "mutual exclusion; parallel processing; parallel programming; programming theory; resource allocation; semaphore primitives; synchronisation", treatment = "T Theoretical or Mathematical", } @Article{Varney:1972:PPU, author = "R. C. Varney", title = "Priority processes used for scheduling within a tree structured operating system", journal = j-INFO-PROC-LETT, volume = "1", number = "5", pages = "187--190", day = "??", month = oct, year = "1972", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Pennsylvania State Univ., University Park, PA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "multiprogramming; operating systems; operating systems (computers); parallel processes; parallel processing; priority processes; process concept; programming theory; scheduling; trees; trees (mathematical)", treatment = "T Theoretical or Mathematical", } @Article{Findler:1972:SNH, author = "Nicholas V. Findler", title = "Short Note on a Heuristic Search Strategy in Long-Term Memory Networks", journal = j-INFO-PROC-LETT, volume = "1", number = "5", pages = "191--196", day = "??", month = oct, year = "1972", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "461; 723; 901; C1230 (Artificial intelligence)", corpsource = "State Univ. New York, Buffalo, Amherst, MA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "artificial intelligence; associative memory; computers; data processing; heuristic programming; heuristic search strategy; human long term memory; information retrieval systems; neural nets; parallel processing; problems of representation; semantic information processing; systems science and cybernetics", treatment = "T Theoretical or Mathematical", } @Article{Anderssen:1972:RPP, author = "R. S. Anderssen", title = "A refinement procedure for pure random search", journal = j-INFO-PROC-LETT, volume = "1", number = "5", pages = "197--200", day = "??", month = oct, year = "1972", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "B0240G (Monte Carlo methods); B0260 (Optimisation techniques)C1140G (Monte Carlo methods); C1180 (Optimisation techniques)", corpsource = "Australian Nat. Univ., Canberra, Australia", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "global optimisation; Monte Carlo inversion; Monte Carlo methods; optimisation; random search; refinement procedure; statistical estimation", treatment = "T Theoretical or Mathematical", } @Article{Rozenberg:1972:EPD, author = "G. Rozenberg", title = "The equivalence problem for deterministic {T0L}-systems is undecidable", journal = j-INFO-PROC-LETT, volume = "1", number = "5", pages = "201--204", day = "??", month = oct, year = "1972", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Tue Nov 17 18:12:30 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", note = "See erratum \cite{Rozenberg:1972:EEP}.", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "State Univ. New York, Buffalo, Amherst, MA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "computability and decidability; deterministic T0L systems; equivalence problem; linear arrays of automata; linguistical; undecidable", treatment = "T Theoretical or Mathematical", } @Article{Molchanov:1972:IMS, author = "I. N. Molchanov and N. I. Stepanets", title = "Iterative methods for solving difference equations of the theory of elasticity not depending on the spacing of the difference net", journal = j-INFO-PROC-LETT, volume = "1", number = "5", pages = "205--210", day = "??", month = oct, year = "1972", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "A0260 (Numerical approximation and analysis); A0340D (Mathematical theory of elasticity); A4630C (Elasticity); B0290P (Differential equations); C4170 (Differential equations)", corpsource = "Acad. Sci., Kiev, Ukrainian SSR, USSR", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "difference equations; elastic equilibrium; elasticity; iterative methods; spacing of the difference net; theory of elasticity; transferences", treatment = "T Theoretical or Mathematical", } @Article{Krepyshev:1972:SDO, author = "G. B. Krepyshev and Ya. A. Pollack", title = "Synthesis of a discrete-time optimal filter algorithm with reduced sensitivity to deviations of {\em a priori\/} statistics", journal = j-INFO-PROC-LETT, volume = "1", number = "5", pages = "211--215", day = "??", month = oct, year = "1972", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "B6140 (Signal processing and detection); C1260 (Information theory)", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "discrete time; filtering and prediction theory; optimal filter algorithm; reduced sensitivity to deviations of a priori statistics; synthesis", treatment = "T Theoretical or Mathematical", } @Article{Horowitz:1972:EFM, author = "E. Horowitz", title = "Erratum: {``A fast method for interpolation using preconditioning''}", journal = j-INFO-PROC-LETT, volume = "1", number = "5", pages = "216--216", day = "??", month = oct, year = "1972", 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/infoproc1970.bib", note = "See \cite{Horowitz:1972:FMI}.", acknowledgement = ack-nhfb, fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", } @Article{Kral:1972:ENA, author = "J. Kr{\'a}l", title = "Erratum: {``A new additive pseudorandom number generator for extremely short word-length''}", journal = j-INFO-PROC-LETT, volume = "1", number = "5", pages = "216--216", day = "??", month = oct, year = "1972", 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/infoproc1970.bib", note = "See \cite{Kral:1972:NAP}.", acknowledgement = ack-nhfb, fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", } @Article{Brandstetter:1972:SRS, author = "A. Brandstetter", title = "Storage Requirements in Stochastic Data Acquisition Systems", journal = j-INFO-PROC-LETT, volume = "1", number = "6", pages = "217--219", day = "??", month = dec, year = "1972", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; 901; 922; C6130 (Data handling techniques)", corpsource = "Tel Aviv Univ., Israel", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "average data inflow; buffer size; computers; data acquisition; frequency distribution; information retrieval systems; information science; numerical calculations; probability; record loss probability; recording time; register stages; stochastic data acquisition systems; stochastic systems; storage requirements", treatment = "T Theoretical or Mathematical", } @Article{Nievergelt:1972:BWP, author = "J. Nievergelt and J. Pradels and C. K. Wong and P. C. Yue", title = "Bounds on the Weighted Path Length of Binary Trees", journal = j-INFO-PROC-LETT, volume = "1", number = "6", pages = "220--225", day = "??", month = dec, year = "1972", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "901; 921; B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics)", corpsource = "Univ. Illinois, Urbana, IL, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "balance; binary trees; coding theory; combinatorics; graph theory; information science; information storage and retrieval; mathematical techniques --- Trees; searching; sorting; trees (mathematical); weighted path length", treatment = "T Theoretical or Mathematical", } @Article{Bayer:1972:OBT, author = "R. Bayer", title = "Oriented balanced trees and equivalence relations", journal = j-INFO-PROC-LETT, volume = "1", number = "6", pages = "226--228", day = "??", month = dec, year = "1972", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics); C7310 (Mathematics computing)", corpsource = "Tech. Univ., Munich, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "ALGOL 60; combinatorial mathematics; computer aided analysis; computer algorithm; data structures; equivalence classes; equivalence relations; oriented balanced trees; subroutines; tree handling; trees (mathematical)", treatment = "T Theoretical or Mathematical", } @Article{Engelfriet:1972:NIT, author = "J. Engelfriet", title = "A note on infinite trees", journal = j-INFO-PROC-LETT, volume = "1", number = "6", pages = "229--232", day = "??", month = dec, year = "1972", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Tech. Univ. Twente, Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "computability and decidability; context free grammars; context free rules; context-free grammars; data structures; decidability; decision theory and analysis; formal languages; infinite trees; sequence; trees (mathematical)", treatment = "T Theoretical or Mathematical", } @Article{Rozenberg:1972:DPU, author = "G. Rozenberg", title = "Direct proofs of the undecidability of the equivalence problem for sentential forms of linear context-free grammars and the equivalence problem for {0L} systems", journal = j-INFO-PROC-LETT, volume = "1", number = "6", pages = "233--235", day = "??", month = dec, year = "1972", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "State Univ. New York, Buffalo, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "0L systems; computability and decidability; context-free grammars; equivalence classes; equivalence problem; formal languages; linear context free grammars; sentential forms; undecidability", treatment = "T Theoretical or Mathematical", } @Article{Tzafestas:1972:DPM, author = "S. G. Tzafestas", title = "Design parameters for a multiserver computer processing buffering system with feedback", journal = j-INFO-PROC-LETT, volume = "1", number = "6", pages = "236--243", day = "??", month = dec, year = "1972", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "B0240C (Queueing theory); C1140C (Queueing theory); C4290 (Other computer theory)", corpsource = "Computer Center, N.R.C. `Democritus', Athens, Greece", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "average queue length; average word departure rate; buffer size; computation theory; delay times; delays; design parameters; feedback; limited length queuing theory; multiserver computer processing buffering system; overflow losses; probability; probability equations; queueing delay; queueing theory; servicing system", treatment = "T Theoretical or Mathematical", xxtitle = "Design parameters for a multiserver processing buffering system with freeback", } @Article{Baker:1972:UOA, author = "J. L. Baker", title = "An unintentional omission from {ALGOL 68}", journal = j-INFO-PROC-LETT, volume = "1", number = "6", pages = "244--245", day = "??", month = dec, year = "1972", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C6140D (High level languages)", corpsource = "Univ. Calgary, Alta., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "ALGOL; ALGOL 68; constructs; formal languages; list processing; problem oriented languages; programming languages; syntactic analysis", treatment = "G General Review", } @Article{Reddy:1972:XHS, author = "R. Reddy and W. Broadley and L. Erman and R. Johnsson and J. Newcomer and G. Robertson and J. Wright", title = "{Xcribl} --- a Hardcopy Scan Line Graphics System for Document Generation", journal = j-INFO-PROC-LETT, volume = "1", number = "6", pages = "246--251", day = "??", month = dec, year = "1972", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; 901; C5540 (Terminals and graphic displays)", corpsource = "Carnegie-Mellon Univ., Pittsburgh, PA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "character set design facility; computer graphics; computer interfaces; data processing; data structures; design; document generation; fonts; gray scale graphics; hard copy scan line graphics system; hardcopy computer output; information science; intelligent controller; interface; mini computer; minicomputers; printers; XCRIBL; Xerox Graphic Printer", treatment = "A Application; P Practical", } @Article{Rozenberg:1972:EEP, author = "G. Rozenberg", title = "Erratum: {``The equivalence problem for deterministic T0L-systems is undecidable''}", journal = j-INFO-PROC-LETT, volume = "1", number = "6", pages = "252--252", day = "??", month = dec, year = "1972", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Tue Nov 17 18:12:34 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", note = "See \cite{Rozenberg:1972:EPD}.", acknowledgement = ack-nhfb, classification = "723; 901; C5540 (Terminals and graphic displays)", corpsource = "Carnegie-Mellon Univ., Pittsburgh, PA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "character set design facility; computer graphics; computer interfaces; data processing; data structures; design; document generation; fonts; gray scale graphics; hard copy scan line graphics system; hardcopy computer output; information science; intelligent controller; interface; mini computer; minicomputers; printers; XCRIBL; Xerox Graphic Printer", treatment = "A Application; P Practical", } @Article{Minsky:1973:RBT, author = "Naftaly H. Minsky", title = "Representation of Binary Trees on Associative Memories", journal = j-INFO-PROC-LETT, volume = "2", number = "1", pages = "1--5", day = "??", month = mar, year = "1973", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C5320C (Storage on moving magnetic media)", corpsource = "Dept. Computer Information, Control Sci., Minneapolis, MN, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "associative memories; associative memory; associative storage; binary trees; computer metatheory; magnetic disc storage; representation; rotating memories; rotating memory; trees (mathematical)", treatment = "T Theoretical or Mathematical", } @Article{Salton:1973:EML, author = "G. Salton", title = "Experiments in Multi-Lingual Information Retrieval", journal = j-INFO-PROC-LETT, volume = "2", number = "1", pages = "6--11", day = "??", month = mar, year = "1973", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C7250 (Information storage and retrieval)", corpsource = "Cornell Univ., Ithaca, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "automatic discrimination dictionary; automatic information retrieval; automatic language processing; English; French; information retrieval system evaluation; information retrieval systems; multilingual; thesaurus; vocabulary", treatment = "X Experimental", } @Article{Robson:1973:IAT, author = "J. M. Robson", title = "An improved algorithm for traversing binary trees without auxiliary stack", journal = j-INFO-PROC-LETT, volume = "2", number = "1", pages = "12--14", day = "??", month = mar, year = "1973", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C6130 (Data handling techniques)", corpsource = "Univ. Lancaster, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "algorithms; binary trees; computer programming; data handling; tree traversal; trees (mathematical); without auxiliary stack", treatment = "T Theoretical or Mathematical", } @Article{Coffman:1973:NRP, author = "E. G. {Coffman, Jr.} and C. J. M. Turnbull", title = "A note on the relative performance of two disk scanning policies", journal = j-INFO-PROC-LETT, volume = "2", number = "1", pages = "15--17", day = "??", month = mar, year = "1973", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C6120 (File organisation)", corpsource = "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 = "auxiliary storage analysis; computer metatheory; CSCAN; disc scanning policies; disk access; disk scanning policies; FSCAN; magnetic disc storage; relative performance; SCAN; storage management", treatment = "T Theoretical or Mathematical", } @Article{Jarvis:1973:ICH, author = "R. A. Jarvis", title = "On the Identification of the Convex Hull of a Finite Set of Points in the Plane", journal = j-INFO-PROC-LETT, volume = "2", number = "1", pages = "18--21", day = "??", month = mar, year = "1973", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C6130 (Data handling techniques)", corpsource = "Australian Nat. Univ., Canberra, Australia", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "algorithm; computer programming; convex hull; data handling; finite set of points; identification", treatment = "T Theoretical or Mathematical", } @Article{Kral:1973:NNS, author = "J. Kr{\'a}l and J. Demner", title = "A note on the number of states of the {De Remer}'s recognizer", journal = j-INFO-PROC-LETT, volume = "2", number = "1", pages = "22--23", day = "??", month = mar, year = "1973", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Technical Univ., Horska, Praha, Czechoslovakia", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "context free languages; context-free languages; De Remer's recognizer; number of states", treatment = "T Theoretical or Mathematical", } @Article{Varhegyi:1973:NDE, author = "G. V{\'a}rhegyi", title = "Numerical differentiation of experimental data", journal = j-INFO-PROC-LETT, volume = "2", number = "1", pages = "24--25", day = "??", month = mar, year = "1973", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "B0290M (Numerical integration and differentiation); C4160 (Numerical integration and differentiation)", corpsource = "Hungarian Acad. Sci., Budapest, Hungary", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "differential quotient; differentiation; experimental data; methods; numerical differentiation", treatment = "T Theoretical or Mathematical", } @Article{Henhapl:1973:TMG, author = "W. Henhapl", title = "A transformation of marked graphs", journal = j-INFO-PROC-LETT, volume = "2", number = "1", pages = "26--29", day = "??", month = mar, year = "1973", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "921; B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics)", corpsource = "IBM Lab., Vienna, Austria", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "firing rules; graph theory; marked graphs; mathematical techniques; Petrie nets; transformation", treatment = "T Theoretical or Mathematical", } @Article{Cremers:1973:NLR, author = "A. B. Cremers and H. A. Maurer and O. Mayer", title = "A note on leftmost restricted random context grammars", journal = j-INFO-PROC-LETT, volume = "2", number = "2", pages = "31--33", day = "??", month = jun, year = "1973", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "721; C4210 (Formal logic)", corpsource = "Univ. Karlsruhe, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "automata theory; characterization; context sensitive; context-sensitive languages; leftmost restricted; matrix grammars; random context grammars; recursively enumerable languages; state grammars; type 0 grammars; type 1 grammars", treatment = "T Theoretical or Mathematical", } @Article{Roschke:1973:AOC, author = "S. I. Roschke and A. L. Furtado", title = "An algorithm for obtaining the chromatic number and an optimal coloring of a graph", journal = j-INFO-PROC-LETT, volume = "2", number = "2", pages = "34--38", day = "??", month = jun, year = "1973", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics)", corpsource = "Pontificia Univ. Catolica, Rio de Janeiro, Brazil", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "algorithm; chromatic number; computer programming; graph; graph theory; optimal colouring", treatment = "T Theoretical or Mathematical", } @Article{Coffy:1973:CTC, author = "Joel Coffy", title = "On Computing the Time Complexity of Transitive Closure Algorithms", journal = j-INFO-PROC-LETT, volume = "2", number = "2", pages = "39--42", day = "??", month = jun, year = "1973", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Inst. Recherche Informatique and Automatique, Rocquencourt, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "computational complexity; computer programming; graph theory; graphs; time complexity; transitive closure algorithms", treatment = "T Theoretical or Mathematical", } @Article{Rosenfeld:1973:PSA, author = "Azriel Rosenfeld and David L. Milgram", title = "Parallel\slash Sequential Array Automata", journal = j-INFO-PROC-LETT, volume = "2", number = "2", pages = "43--46", day = "??", month = jun, year = "1973", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "721; C4220 (Automata theory)", corpsource = "Univ. Maryland, College Park, MD, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "automata theory; defining; formal languages; parallel processing; parallel/sequential array automata; power", treatment = "T Theoretical or Mathematical", } @Article{Lindstrom:1973:SLS, author = "Gary Lindstrom", title = "Scanning List Structures Without Stacks or Tag Bits", journal = j-INFO-PROC-LETT, volume = "2", number = "2", pages = "47--51", day = "??", month = jun, year = "1973", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Tue Nov 17 17:25:17 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C4290 (Other computer theory); C5210B (Computer-aided logic design)", corpsource = "Univ. Pittsburgh, PA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "binary sort trees; copying trees; data processing; garbage collection; list processing; list structure marking; list structures; scanning; sorting; storage management; tree traversal; trees; trees (mathematical)", treatment = "T Theoretical or Mathematical", } @Article{Adams:1973:ARB, author = "Edward N. {Adams, III}", title = "Another Representation of Binary Tree Traversal", journal = j-INFO-PROC-LETT, volume = "2", number = "2", pages = "52--54", day = "??", month = jun, year = "1973", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C4290 (Other computer theory)", corpsource = "Univ. Illinois, Urbana, IL, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "algorithms; binary tree traversal; computer programming; inorder; postorder successor; preorder; representation; trees (mathematical)", treatment = "T Theoretical or Mathematical", } @Article{Holnapy:1973:GMF, author = "D. Holnapy and M. Sz{\"o}ts and A. Bot{\'a}r", title = "A generalization of the method of finite differences", journal = j-INFO-PROC-LETT, volume = "2", number = "2", pages = "55--59", day = "??", month = jun, year = "1973", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "921; B0290P (Differential equations); C4170 (Differential equations)", corpsource = "EVM Szamgep, Budapest, Bartok Bela, Hungary", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "difference equations; finite differences; generalization; mathematical techniques; numerical methods; partial differential equations", treatment = "T Theoretical or Mathematical", } @Article{Herman:1973:UCC, author = "Gabor T. Herman", title = "On Universal Computer-Constructors", journal = j-INFO-PROC-LETT, volume = "2", number = "3", pages = "61--64", day = "??", month = aug, year = "1973", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "721; C4220 (Automata theory)", corpsource = "State Univ. New York Buffalo, Amherst, MA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "automata theory; cellular automata; self reproduction; universal computer constructor; universal computer-constructor", treatment = "T Theoretical or Mathematical", } @Article{Tang:1973:MBB, author = "D. T. Tang and C. K. Wong", title = "A modified branch-and-bound strategy", journal = j-INFO-PROC-LETT, volume = "2", number = "3", pages = "65--69", day = "??", month = aug, year = "1973", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; B0260 (Optimisation techniques); C1180 (Optimisation 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 = "branch and bound; computation complexity; computational complexity; computer programming; memory storage requirement; modified; optimisation; price function; strategy", treatment = "T Theoretical or Mathematical", } @Article{Ehrenfeucht:1973:LTS, author = "A. Ehrenfeucht and G. Rozenberg", title = "A limit theorem for sets of subwords in deterministic {T0L} languages", journal = j-INFO-PROC-LETT, volume = "2", number = "3", pages = "70--73", day = "??", month = aug, year = "1973", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "721; C4210 (Formal logic)", corpsource = "Univ. Colorado, Boulder, CO, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "automata theory; deterministic T0L languages; developmental systems; formal languages; limit theorem; sets of subwords; T0L languages", treatment = "T Theoretical or Mathematical", } @Article{Mizumoto:1973:EFG, author = "Masaharu Mizumoto and Junichi Toyoda and Kohkichi Tanaka", title = "Examples of Formal Grammars with Weights", journal = j-INFO-PROC-LETT, volume = "2", number = "3", pages = "74--78", day = "??", month = aug, year = "1973", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "721; C4210 (Formal logic)", corpsource = "Osaka Univ., Toyonaka, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "algebra systems; automata theory; context free languages; context sensitive languages; formal grammars; fuzzy grammars; generative powers; grammars; probabilistic grammars; weighted grammars", treatment = "T Theoretical or Mathematical", } @Article{Boffey:1973:AMR, author = "T. B. Boffey", title = "Applying the Minimax Rule over Graphs Which are not Trees", journal = j-INFO-PROC-LETT, volume = "2", number = "3", pages = "79--81", day = "??", month = aug, year = "1973", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Tue Nov 17 17:27:32 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "921; B0250 (Combinatorial mathematics); B0260 (Optimisation techniques); C1160 (Combinatorial mathematics); C1180 (Optimisation techniques)", corpsource = "Univ. Liverpool, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "graph theory; graphs; mathematical techniques; minimax rule; not trees; optimisation", treatment = "T Theoretical or Mathematical", } @Article{Hoare:1973:GCL, author = "C. A. R. Hoare", title = "A general conservation law for queueing disciplines", journal = j-INFO-PROC-LETT, volume = "2", number = "3", pages = "82--85", day = "??", month = aug, year = "1973", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics)", corpsource = "Queen's Univ. Belfast, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "general conservation law; queueing disciplines; queueing theory", treatment = "T Theoretical or Mathematical", } @Article{Molchanov:1973:OCI, author = "I. N. Molchanov and M. F. Iakovlev", title = "On One Class of Iterative Methods for Obtaining the Generalized Solution of Non-Consistent Systems of Linear Algebraic Equations", journal = j-INFO-PROC-LETT, volume = "2", number = "3", pages = "86--90", day = "??", month = aug, year = "1973", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "921; B0290H (Linear algebra); C4140 (Linear algebra)", corpsource = "Inst. Cybernetics, Acad. Sci., Kiev, Ukrainian SSR, USSR", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "generalised solution; iterative methods; linear algebra; linear algebraic equations; mathematical techniques; nonconsistent systems", treatment = "T Theoretical or Mathematical", } @Article{Sethi:1973:NIP, author = "Ravi Sethi", title = "A note on implementing parallel assignment instructions", journal = j-INFO-PROC-LETT, volume = "2", number = "4", pages = "91--95", day = "??", month = oct, year = "1973", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C6110 (Systems analysis and programming)", corpsource = "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 = "ALGOL; Algol 68; compilers; computer programming; CPL; language constructs; parallel assignment instructions; polynomial complete; program optimization; programming; programming languages; register allocation", treatment = "P Practical", } @Article{Krogdahl:1973:DSA, author = "Stein Krogdahl", title = "A dynamic storage allocation problem", journal = j-INFO-PROC-LETT, volume = "2", number = "4", pages = "96--99", day = "??", month = oct, year = "1973", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C6120 (File organisation)", corpsource = "Univ. Tromso, Norway", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "blocks of cells; computer operating systems; dynamic storage allocation; requests; storage allocation; strategy", treatment = "T Theoretical or Mathematical", } @Article{Cohen:1973:SDU, author = "J. Cohen", title = "Syntax-directed unit conversion", journal = j-INFO-PROC-LETT, volume = "2", number = "4", pages = "100--102", day = "??", month = oct, year = "1973", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6110 (Systems analysis and programming); C6150C (Compilers, interpreters and other processors)", corpsource = "Brandeis Univ., Waltham, MA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "language processors; program interpreters; programming theory; syntactical analysis; syntax directed translation; unit conversions; writing programs", treatment = "A Application; T Theoretical or Mathematical", } @Article{Yuval:1973:PCT, author = "G. Yuval", title = "On a problem connected with topological sorting", journal = j-INFO-PROC-LETT, volume = "2", number = "4", pages = "103--104", day = "??", month = oct, year = "1973", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C6130 (Data handling techniques)", corpsource = "Hebrew Univ., Jerusalem, Israel", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "combinatorial problems; data structures; sorting; topological sorting; topology", treatment = "T Theoretical or Mathematical", } @Article{Devillers:1973:RPN, author = "R. Devillers and G. Louchard", title = "Realization of {Petri} Nets without Conditional Statements", journal = j-INFO-PROC-LETT, volume = "2", number = "4", pages = "105--107", day = "??", month = oct, year = "1973", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "921; C4240 (Programming and algorithm theory)", corpsource = "Univ. Libre Bruxelles, Brussels, Belgium", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "mathematical programming; parallel processes; Petri nets; programming theory; semaphores; without conditional statements", treatment = "T Theoretical or Mathematical", } @Article{Roussopoulos:1973:ADG, author = "Nicholas D. Roussopoulos", title = "A $ {\rm max}(m, n) $ algorithm for determining the graph {$H$} from its line graph {$G$}", journal = j-INFO-PROC-LETT, volume = "2", number = "4", pages = "108--112", day = "??", month = oct, year = "1973", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "921; B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics)", corpsource = "Univ. Toronto, Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "algorithm; automorphism; complete bipartite; complete graph; determining; graph; graph theory; line graph; mathematical programming; mathematical techniques; maximal subgraph", treatment = "T Theoretical or Mathematical", } @Article{Kasyanov:1973:SPF, author = "V. N. Kasyanov", title = "Some Properties of Fully Reducible Graphs", journal = j-INFO-PROC-LETT, volume = "2", number = "4", pages = "113--117", day = "??", month = oct, year = "1973", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "921; B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Computing Centre Siberian Div. Acad. Sci., Novosibirsk, USSR", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "arrangeable graph; fully reducible graphs; graph theory; mathematical programming; mathematical techniques; programming theory; properties; single entry graph; straight order; strongly connected region", treatment = "T Theoretical or Mathematical", } @Article{Molchanov:1973:CDS, author = "I. N. Molchanov and E. F. Galba", title = "On the Convergence of Difference Schemes Approximating a Plane Static Problem of the Theory of Elasticity with Mixed Boundary Conditions", journal = j-INFO-PROC-LETT, volume = "2", number = "4", pages = "118--122", day = "??", month = oct, year = "1973", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "921; 931; A0340D (Mathematical theory of elasticity); A4630C (Elasticity); B0290P (Differential equations); C4170 (Differential equations)", corpsource = "Inst. Cybernetics, Acad. Sci., Kiev, Ukrainian SSR, USSR", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "boundary-value problems; convergence; convergence of numerical methods; difference equations; difference schemes; elasticity; mathematical techniques; mixed boundary conditions; numerical mathematics; plane static problem; theory of elasticity", treatment = "T Theoretical or Mathematical", } @Article{Floyd:1973:LTT, author = "Robert W. Floyd and Alan J. Smith", title = "A linear time two tape merge", journal = j-INFO-PROC-LETT, volume = "2", number = "5", pages = "123--126 (or 123--125??)", day = "??", month = dec, year = "1973", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C6130 (Data handling techniques)", corpsource = "Stanford Univ., CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "automata theory; computational complexity; computer systems programming; Hennie/Stearns construction; linear time; merging; optimal algorithm; sorting; Turing machine tapes; two tape merge", treatment = "P Practical", } @Article{Barnett:1973:TRC, author = "J. K. R. Barnett", title = "A technique for reducing comparison times in certain applications of the merging method of sorting", journal = j-INFO-PROC-LETT, volume = "2", number = "5", pages = "127--128", day = "??", month = dec, year = "1973", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C6130 (Data handling techniques)", corpsource = "Univ. Newcastle upon Tyne, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "keys; merging; reducing comparison times; sorting", treatment = "P Practical", } @Article{Warren:1973:MCS, author = "H. S. {Warren, Jr.}", title = "Minimal comparison sorting by choosing most efficient comparisons", journal = j-INFO-PROC-LETT, volume = "2", number = "5", pages = "129--130", day = "??", month = dec, year = "1973", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C6130 (Data handling techniques)", corpsource = "IBM Corp., Yorktown Heights, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "combinatorial problems; maximum number of comparisons; merge insertion; merging; minimal comparison sorting; sorting", treatment = "P Practical", } @Article{Karhumaki:1973:EPS, author = "Juhani Karhum{\"a}ki", title = "An example of a {PD2L}-system with the growth type $ 2 1 / 2 $", journal = j-INFO-PROC-LETT, volume = "2", number = "5", pages = "131--134", day = "??", month = dec, year = "1973", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Tue Nov 17 17:29:23 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "721; C4210 (Formal logic)", corpsource = "Univ. Turku, Finland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "automata theory; biological origin; filamentous organisms; formal languages; growth functions; Lindenmayer systems; PD2L systems", treatment = "T Theoretical or Mathematical", } @Article{Boasson:1973:ISC, author = "L. Boasson", title = "The inclusion of the substitution closure of linear and one-counter languages in the largest sub-{AFL} of the family of algebraic languages is proper", journal = j-INFO-PROC-LETT, volume = "2", number = "5", pages = "135--140", day = "??", month = dec, year = "1973", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Tue Nov 17 17:30:14 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Univ. Paris, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "algebraic languages; context free languages; context-free languages; full AFL rational cones; linear and one counter languages; rational transductions; substitution closure", treatment = "T Theoretical or Mathematical", } @Article{Francez:1973:NCC, author = "Nissim Francez and Giora Slutzky", title = "On the Non-Compactness of the Class of Program Schemas", journal = j-INFO-PROC-LETT, volume = "2", number = "5", pages = "141--142", day = "??", month = dec, year = "1973", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Weizmann Inst. Sci., Rehovot, Israel", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "compactness; computer metatheory; interpretation; model theory; program schemas; programming theory; traditional Predicate Calculus", treatment = "T Theoretical or Mathematical", } @Article{Dwyer:1973:SAT, author = "Barry Dwyer", title = "Simple Algorithms for Traversing a Tree without an Auxiliary Stack", journal = j-INFO-PROC-LETT, volume = "2", number = "5", pages = "143--145", day = "??", month = dec, year = "1973", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; 921; C6120 (File organisation)", corpsource = "Inst. Technol., Adelaide, SA, Australia", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "algorithms; analysis of algorithms; auxiliary stack; binary tree; computer metatheory --- Programming Theory; data structure; data structures; mathematical programming", treatment = "T Theoretical or Mathematical", } @Article{Kung:1973:NUB, author = "H. T. Kung", title = "A new upper bound on the complexity of derivative evaluation", journal = j-INFO-PROC-LETT, volume = "2", number = "5", pages = "146--147", day = "??", month = dec, year = "1973", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Tue Nov 17 17:30:41 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "B0290D (Functional analysis); C4120 (Functional analysis); C4240 (Programming and algorithm theory)", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "complex numbers; complexity; computational complexity; derivative evaluation; function evaluation; normalized derivatives; polynomial; polynomials; upper bound", treatment = "T Theoretical or Mathematical", } @Article{Heuer:1973:NSB, author = "H. Heuer and I. N. Molchanov", title = "Numerical Solution of a Boundary Problem for Equations of Elastic Equilibrium of Bodies in Transferences", journal = j-INFO-PROC-LETT, volume = "2", number = "5", pages = "148--151", day = "??", month = dec, year = "1973", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "921; B0290P (Differential equations); C4170 (Differential equations)", corpsource = "Inst. Cybernetics, Acad. Sci., Kiev, Ukrainian SSR, USSR", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "bodies in transferences; boundary problem; boundary-value problems; elastic equilibrium; mathematical techniques; numerical analysis; partial differential equations", treatment = "T Theoretical or Mathematical", } @Article{Knuth:1974:SPG, author = "Donald E. Knuth and Jayme L. Szwarcfiter", title = "A Structured Program to Generate All Topological Sorting Arrangements", journal = j-INFO-PROC-LETT, volume = "2", number = "6", pages = "153--157", day = "??", month = apr, year = "1974", 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/infoproc1970.bib", note = "See erratum \cite{Knuth:1974:ESP}. Reprinted with revisions in \cite[pp.~91--97]{Knuth:1992:LP}.", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory); C6120 (File organisation); C6130 (Data handling techniques)", corpsource = "Stanford Univ., CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "all solutions; backtracking; changing recursion into iteration; computer metatheory; data structures; linked and sequential forms of data representation; manipulation of data structures; programming theory; recursive functions; sorting; structured program; topological sorting arrangements; well structured programs", treatment = "T Theoretical or Mathematical", } @Article{Solntseff:1974:NDD, author = "N. Solntseff", title = "On a Notational Device for the Description of Pointer-Free Operations on Structured Data", journal = j-INFO-PROC-LETT, volume = "2", number = "6", pages = "158--159", day = "??", month = apr, year = "1974", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C4210 (Formal logic); C4240 (Programming and algorithm theory); C6120 (File organisation)", corpsource = "McMaster Univ., Hamilton, Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "data processing; data structures; lists; notational device; pointer free representation; programming theory; representation of data structure construction; structured data; trees; trees (mathematics); unstructured data", treatment = "T Theoretical or Mathematical", } @Article{Tarjan:1974:NFB, author = "R. E. Tarjan", title = "A note on finding the bridges of a graph", journal = j-INFO-PROC-LETT, volume = "2", number = "6", pages = "160--161", day = "??", month = apr, year = "1974", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Univ. California, Berkeley, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "algorithms; any search method; bridges of a graph; connectivity properties; programming theory; spanning tree; trees (mathematics)", treatment = "T Theoretical or Mathematical", } @Article{Dewar:1974:SMS, author = "Robert B. K. Dewar", title = "A stable minimum storage sorting algorithm", journal = j-INFO-PROC-LETT, volume = "2", number = "6", pages = "162--164", day = "??", month = apr, year = "1974", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory); C6130 (Data handling techniques)", corpsource = "Illinois Inst. Technol., Chicago, IL, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "computer systems programming; equal keys; merge; minimum storage; programming theory; sort; sorting; stable; stable minimum storage sorting algorithm; storage allocation", treatment = "T Theoretical or Mathematical", } @Article{Hoare:1974:OSS, author = "C. A. R. Hoare", title = "Optimization of store size for garbage collection", journal = j-INFO-PROC-LETT, volume = "2", number = "6", pages = "165--166", day = "??", month = apr, year = "1974", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "B0260 (Optimisation techniques); C1180 (Optimisation techniques); C4240 (Programming and algorithm theory); C6120 (File organisation)", corpsource = "Stanford Univ., CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "dynamic storage allocation; garbage collection; garbage collection cost; LISP; minimisation; minimizing cost; optimisation; programming theory; scan mark garbage collection; storage management; store allocation strategies; store size", treatment = "T Theoretical or Mathematical", } @Article{Middleton:1974:COP, author = "A. G. Middleton", title = "Cost-Oriented Program Optimisation", journal = j-INFO-PROC-LETT, volume = "2", number = "6", pages = "167--170", day = "??", month = apr, year = "1974", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; B0260 (Optimisation techniques); C1180 (Optimisation techniques); C4240 (Programming and algorithm theory); C6110 (Systems analysis and programming); C6140D (High level languages)", corpsource = "Univ. Coll., Swansea, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "computer programming; DO loop structures; execution time; FORTRAN; FORTRAN like language; minimise overall cost; optimisation; program optimisation; programming theory; storage requirements; trade off", treatment = "E Economic; T Theoretical or Mathematical", } @Article{Hansal:1974:SDP, author = "A. Hansal", title = "{`Software} devices' for processing graphs using {PL/1} compile time facilities", journal = j-INFO-PROC-LETT, volume = "2", number = "6", pages = "171--179", day = "??", month = apr, year = "1974", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; 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 = "abstract data structures; basic access functions; computer programming; data structures; directed graphs; graph theoretical; maximum flexibility; PL/1; PL/1 compile time facilities; processing graphs; program modularity; programming methodology; programming theory; software devices; software reliability", treatment = "T Theoretical or Mathematical", } @Article{Jackson:1974:IPM, author = "L. Wayne Jackson and Subrata Dasgupta", title = "The identification of parallel micro-operations", journal = j-INFO-PROC-LETT, volume = "2", number = "6", pages = "180--184", day = "??", month = apr, year = "1974", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "722; 723; C4240 (Programming and algorithm theory); C5220 (Computer architecture); C6120 (File organisation)", corpsource = "Univ. Alberta, Edmonton, Alta., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "computer architecture; data structures; direct control; high level microprogramming languages; identification; microinstruction word organizations; microprogramming; minimally encoded control; parallel data paths; parallel processing; parallel task detection algorithms; parallelism in microprograms; programming theory", treatment = "T Theoretical or Mathematical", } @Article{Lee:1974:LSD, author = "K. P. Lee and G. Rozenberg", title = "The length sets of {D0L} languages are uniformly bounded", journal = j-INFO-PROC-LETT, volume = "2", number = "6", pages = "185--188", day = "??", month = apr, year = "1974", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "721; C4210 (Formal logic)", corpsource = "State Univ. New York, Buffalo, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "alphabet of the language; arbitrary length; automata theory; D0L languages; D0L sequences; formal languages; L systems; length sets; sequences; uniformly bounded", treatment = "T Theoretical or Mathematical", } @Article{Minker:1974:EAP, author = "Jack Minker and Gordon J. VanderBrug", title = "The {Earley} algorithm as a problem representation", journal = j-INFO-PROC-LETT, volume = "3", number = "1", pages = "1--7", day = "??", month = jul, year = "1974", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "461; 723; 912; C1230 (Artificial intelligence); C4240 (Programming and algorithm theory)", corpsource = "Univ. Maryland, College Park, MD, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "algorithm theory; artificial intelligence; automatic problem solving; computer metatheory; context free parsing algorithm; Earley algorithm; first order logic; language recognition; problem reduction representation; problem representation; resolution based theorem prover; search strategy; state space representation; state-space methods; systems science and cybernetics; theorem prover; theorem proving", treatment = "T Theoretical or Mathematical", } @Article{Noshita:1974:MSE, author = "K. Noshita", title = "Median selection of $9$ elements in $ 14$ comparisons", journal = j-INFO-PROC-LETT, volume = "3", number = "1", pages = "8--12", day = "??", month = jul, year = "1974", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6130 (Data handling techniques)", corpsource = "Univ. Electro-Communications Chofu-shi, Tokyo, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "combinatorial mathematics; median selection; minimum comparison; programming theory; searching; sorting; upper bound", treatment = "T Theoretical or Mathematical", } @Article{Tarjan:1974:NAF, author = "Robert Endre Tarjan", title = "A new algorithm for finding weak components", journal = j-INFO-PROC-LETT, volume = "3", number = "1", pages = "13--15", day = "??", month = jul, year = "1974", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; 921; B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics)", corpsource = "Univ. California, Berkeley, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "algorithm; connectivity; directed graph; graph theory; mathematical programming; mathematical techniques --- Graph Theory; strong components; subgraphs; topological sorting; weak components", treatment = "T Theoretical or Mathematical", } @Article{Cooprider:1974:ISS, author = "Lee W. Cooprider and F. Heymans and P. J. Courtois and David L. Parnas", title = "Information Streams Sharing a Finite Buffer: Other Solutions", journal = j-INFO-PROC-LETT, volume = "3", number = "1", pages = "16--21", day = "??", month = jul, year = "1974", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C4290 (Other computer theory); C6150J (Operating systems)", corpsource = "Carnegie-Mellon Univ., Schenley Park, Pittsburgh, PA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "buffer sharing; computer systems programming; finite buffer; information streams; synchronization; time-sharing programs", treatment = "T Theoretical or Mathematical", } @Article{vanLeeuwen:1974:IBD, author = "J. {van Leeuwen} and C. H. Smith", title = "An improved bound for detecting looping configurations in deterministic {DPA}'s", journal = j-INFO-PROC-LETT, volume = "3", number = "1", pages = "22--24", day = "??", month = jul, year = "1974", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory)", corpsource = "State Univ. New York, Buffalo, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "automata theory; deterministic push down automata; free representation; improved bound; looping configurations; trees (mathematics)", treatment = "T Theoretical or Mathematical", xxtitle = "An improved bound for detecting looping configurations in deterministic {DPA}'s (pda's)", } @Article{Ibarra:1974:NSS, author = "Oscar H. Ibarra", title = "A note on semilinear sets and bounded-reversal multihead pushdown automata", journal = j-INFO-PROC-LETT, volume = "3", number = "1", pages = "25--28", day = "??", month = jul, year = "1974", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "721; C4220 (Automata theory)", corpsource = "Univ. Minnesota, Minneapolis, MN, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "automata theory; bounded language; bounded reversal multihead pushdown automata; context free languages; context-free languages; one reversal one head pushdown automaton; one way multiheat pushdown automata; one way two heat finite automaton; semilinear sets; two way multiheat pushdown automata", treatment = "T Theoretical or Mathematical", } @Article{Fisher:1974:BWG, author = "David A. Fisher", title = "Bounded Workspace Garbage Collection in an Address-Order Preserving List Processing Environment", journal = j-INFO-PROC-LETT, volume = "3", number = "1", pages = "29--32", day = "??", month = jul, year = "1974", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Tue Nov 17 17:33:46 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C6130 (Data handling techniques)", corpsource = "Inst. Defense Analyses, Arlington, VA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "address order preserving list processing; address ordering; bounded workspace garbage collection; compacting; computer programming; garbage collection; linear time algorithm; list processing; marking; memory allocation; sequential allocation; storage management; trees (mathematics)", treatment = "T Theoretical or Mathematical", } @Article{Jovanovich:1974:NMF, author = "A. D. Jovanovich", title = "Note on a modification of the fundamental cycles finding algorithm", journal = j-INFO-PROC-LETT, volume = "3", number = "1", pages = "33--??", day = "??", month = jul, year = "1974", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics)", corpsource = "Univ. Belgrade, Yugoslavia", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "algorithm; fundamental cycle set; fundamental cycles finding; graph theory; graphs; store requirement; trees (mathematics)", treatment = "T Theoretical or Mathematical", } @Article{Takaoka:1974:NAC, author = "T. Takaoka", title = "A note on the ambiguity of context-free grammars", journal = j-INFO-PROC-LETT, volume = "3", number = "2", pages = "35--36", day = "??", month = nov, year = "1974", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Ibaraki Univ., Hitachi, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "ambiguity; context free grammar; context-free grammars; structure generating function", treatment = "T Theoretical or Mathematical", } @Article{Campbell:1974:OUS, author = "J. A. Campbell", title = "Optimal use of storage in a simple model of garbage collection", journal = j-INFO-PROC-LETT, volume = "3", number = "2", pages = "37--38", day = "??", month = nov, year = "1974", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation)", corpsource = "King's Coll., Cambridge, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "computing time; garbage collection; list processing; optimal use; storage management; storage size", treatment = "T Theoretical or Mathematical", } @Article{Zelkowitz:1974:SOS, author = "M. V. Zelkowitz", title = "Structured operating system organization", journal = j-INFO-PROC-LETT, volume = "3", number = "2", pages = "39--42", day = "??", month = nov, year = "1974", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C6150J (Operating systems)", corpsource = "Univ. Maryland, College Park, MD, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "operating system; operating systems (computers); program modularity; protection mechanism; software reliability; system operation", treatment = "T Theoretical or Mathematical", xxtitle = "Structured operating system organisation", } @Article{Deimel:1974:RCP, author = "L. E. {Deimel, Jr.}", title = "Remark on the computational power of a {Turing} machine variant", journal = j-INFO-PROC-LETT, volume = "3", number = "2", pages = "43--45", day = "??", month = nov, year = "1974", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory)", corpsource = "Georgia Inst. Technol., Atlanta, GA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "automata theory; computational power; theory of computation; Turing machine variant; Turing machines", treatment = "P Practical", } @Article{Arnborg:1974:ACM, author = "Stefan Arnborg", title = "Abstract Computation Model Used for a Production Compiler", journal = j-INFO-PROC-LETT, volume = "3", number = "2", pages = "46--50", day = "??", month = nov, year = "1974", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory); C6120 (File organisation); C6150C (Compilers, interpreters and other processors)", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "abstract computation model; algorithm theory; central concept system; computational complexity; computer metatheory; data structures; processing algorithms; production compiler; program compilers", treatment = "A Application; T Theoretical or Mathematical", } @Article{Tarjan:1974:GAE, author = "R. E. Tarjan", title = "A good algorithm for edge-disjoint branching", journal = j-INFO-PROC-LETT, volume = "3", number = "2", pages = "51--53", day = "??", month = nov, year = "1974", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Univ. California, Berkeley, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "algorithm; algorithm theory; directed graph; edge disjoint branching; graph theory; network flow; spanning tree", treatment = "T Theoretical or Mathematical", } @Article{Kobayashi:1974:NEE, author = "Kojiro Kobayashi", title = "A note on extending equivalence theories of algorithms", journal = j-INFO-PROC-LETT, volume = "3", number = "2", pages = "54--56", day = "??", month = nov, year = "1974", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Tokyo Inst. Technol., Oh-okayama, Meguro-ku, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "algorithm theory; computer metatheory; equivalence of algorithms; programming language; programming theory; theories of algorithms; theory of computation", treatment = "T Theoretical or Mathematical", } @Article{Sridharan:1974:CGV, author = "N. S. Sridharan", title = "Computer Generation of Vertex Graphs", journal = j-INFO-PROC-LETT, volume = "3", number = "2", pages = "57--63", day = "??", month = nov, year = "1974", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Tue Nov 17 18:15:50 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", note = "See erratum \cite{Sridharan:1975:ECG}.", acknowledgement = ack-nhfb, classification = "921; A8230Q (Isomerization and rearrangement); C1230 (Artificial intelligence); C7320 (Physics and chemistry computing)", corpsource = "Stanford Univ., CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "artificial intelligence; chemical graphs; complete structure generator; degree constrained graphs; graph generation; graphs; mathematical programming; mathematical techniques --- Graph Theory; natural sciences applications of computers; vertex graphs", treatment = "A Application; T Theoretical or Mathematical", } @Article{Knuth:1974:ESP, author = "Donald E. Knuth and Jayme L. Szwarcfiter", title = "Erratum: {``A Structured Program to Generate All Topological Sorting Arrangements''}", journal = j-INFO-PROC-LETT, volume = "3", number = "2", pages = "64--64", day = "??", month = nov, year = "1974", 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/infoproc1970.bib", note = "See \cite{Knuth:1974:SPG}.", acknowledgement = ack-nhfb, fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", } @Article{Lipton:1975:SA, author = "Richard J. Lipton and Robert W. Tuttle", title = "A synchronization anomaly", journal = j-INFO-PROC-LETT, volume = "3", number = "3", pages = "65--66", day = "??", month = jan, year = "1975", 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/infoproc1970.bib", note = "See comments \cite{Lamport:1976:CSA}.", acknowledgement = ack-nhfb, classification = "723; C6150J (Operating systems)", corpsource = "Yale Univ., New Haven, CT, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "computer metatheory --- Programming Theory; computer systems programming; concurrent processes; parallel processing; priority scheduling; response time; scheduling; synchronization", treatment = "A Application; T Theoretical or Mathematical", } @Article{Hosono:1975:CSL, author = "Chiharu Hosono", title = "On the Cardinality of Some Lattices", journal = j-INFO-PROC-LETT, volume = "3", number = "3", pages = "67--68", day = "??", month = jan, year = "1975", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "921; C4290 (Other computer theory)", corpsource = "Kyoto Univ., Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "cardinality; computation; computation theory; lattices; mathematical techniques; mathematical theory of computation", treatment = "T Theoretical or Mathematical", } @Article{vonSolms:1975:TLT, author = "S. H. {Von Solms}", title = "On {T0L} Languages over Terminals", journal = j-INFO-PROC-LETT, volume = "3", number = "3", pages = "69--70", day = "??", month = jan, year = "1975", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C4210 (Formal logic)", corpsource = "Rand Afrikaans Univ., Johannesburg, South Africa", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "alphabet; computer programming languages; developmental systems; formal languages; grammars; T0L languages; terminals", treatment = "T Theoretical or Mathematical", } @Article{Dasgupta:1975:MCM, author = "Subrata Dasgupta and John Tartar", title = "On the Minimization of Control Memories", journal = j-INFO-PROC-LETT, volume = "3", number = "3", pages = "71--74", day = "??", month = jan, year = "1975", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "722; 723; C5220 (Computer architecture)", corpsource = "Univ. Alberta, Edmonton, Alta., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "bit dimension; computer architecture; control memories; microprogramming; minimisation; optimization; parallel processing", treatment = "A Application; T Theoretical or Mathematical", } @Article{Kameda:1975:VRR, author = "T. Kameda", title = "On the Vector Representation of the Reachability in Planar Directed Graphs", journal = j-INFO-PROC-LETT, volume = "3", number = "3", pages = "75--77", day = "??", month = jan, year = "1975", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "921; B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics)", corpsource = "Univ. Waterloo, Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "depth first search; directed graphs; graph theory; labelling of vertices; mathematical techniques; partial ordering; planar; reachability; transitive closure; vector representation", treatment = "T Theoretical or Mathematical", } @Article{Crespi-Reghizzi:1975:DTC, author = "S. Crespi-Reghizzi and D. Mandrioli", title = "A decidability theorem for a class of vector-addition systems", journal = j-INFO-PROC-LETT, volume = "3", number = "3", pages = "78--80", day = "??", month = jan, year = "1975", 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/infoproc1970.bib", note = "See erratum \cite{Crespi-Reghizzi:1975:EDT}.", acknowledgement = ack-nhfb, classification = "921; C4290 (Other computer theory)", corpsource = "Politec. Milano, Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "computability and decidability; conflict free nets; decidability theorem; marked graphs; mathematical techniques; Petri nets; reachability; vector addition systems", treatment = "T Theoretical or Mathematical", } @Article{Camerini:1975:BMI, author = "P. M. Camerini and F. Maffioli", title = "Bounds for $3$-matroid intersection problems", journal = j-INFO-PROC-LETT, volume = "3", number = "3", pages = "81--83", day = "??", month = jan, year = "1975", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "921; B0250 (Combinatorial mathematics); B0260 (Optimisation techniques); C1160 (Combinatorial mathematics); C1180 (Optimisation techniques); C4240 (Programming and algorithm theory)", corpsource = "Politec. Milano, Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "bounds; combinatorial mathematics; combinatorial problems; computational complexity; heuristically guided search; mathematical techniques; matroid theory; optimisation; relaxation methods; three matroid intersection problems; travelling salesman", treatment = "T Theoretical or Mathematical", } @Article{Reiser:1975:EDF, author = "John F. Reiser and Donald E. Knuth", title = "Evading the Drift in Floating-Point Addition", journal = j-INFO-PROC-LETT, volume = "3", number = "3", pages = "84--87", day = "??", month = jan, year = "1975", CODEN = "IFPLAT", DOI = "https://doi.org/10.1016/0020-0190(75)90022-8", 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/benfords-law.bib; https://www.math.utah.edu/pub/tex/bib/fparith.bib; https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", note = "See erratum \cite{Reiser:1975:EED}.", acknowledgement = ack-nhfb, classification = "722; 723; C5230 (Digital arithmetic methods)", corpsource = "Stanford Univ., CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "addition; computer architecture; digital arithmetic; drift; evading; floating point arithmetic; microprogramming; stable rounding", remark = "From p. 87: ``Actually Tannery's and Scarborough's contradictory arguments [round-up and round-to-even] are both incorrect; for example, the logarithmic law of distribution of leading digits [3] [Benford's Law] implies that the least significant digit of a floating-point number will be odd slightly less often than it will be even, assuming that $b$ is even and $ p > 1$. The real justification for stable rounding is that it eliminates drift.''", treatment = "T Theoretical or Mathematical", } @Article{DalBono:1975:SFS, author = "Ivan {Dal Bono} and Mauro Diligenti and Concetta Mosca and Antonio Ricci and Antonio Villani", title = "A simple {FORTRAN} support for computer-assisted instruction", journal = j-INFO-PROC-LETT, volume = "3", number = "3", pages = "88--90", day = "??", month = jan, year = "1975", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "722; 723; C7810C (Computer-aided instruction)", corpsource = "CNEN, Bologna, Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "computer aided instruction; computer assisted instruction; computer programming; FORTRAN support; graphic terminal; graphics; interactive systems; teaching machines", treatment = "A Application; P Practical", } @Article{Weihrauch:1975:PSP, author = "Klaus Weihrauch", title = "Program Schemata with Polynomial Bounded Counters", journal = j-INFO-PROC-LETT, volume = "3", number = "3", pages = "91--96", day = "??", month = jan, year = "1975", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Univ. Bonn., West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "computer metatheory; polynomial bounded counters; program schemata; programming theory", treatment = "T Theoretical or Mathematical", } @Article{Galand:1975:SIS, author = "S. Galand and C. Loncour", title = "Structured Implementation of Symbolic Execution: a First Part in a Program Verifier", journal = j-INFO-PROC-LETT, volume = "3", number = "4", pages = "97--103", day = "??", month = mar, year = "1975", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory); C6110 (Systems analysis and programming)", corpsource = "Univ. Libre, Bruxelles, Belgium", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "computer programming; constructive predicate transformers; program verifier; programming; programming theory; static semantics; structured implementation; structured SIMULA programming; symbolic execution", treatment = "T Theoretical or Mathematical", } @Article{Cohen:1975:IND, author = "Jacques Cohen", title = "Interpretation of Non-Deterministic Algorithms in Higher-Level Languages", journal = j-INFO-PROC-LETT, volume = "3", number = "4", pages = "104--109", day = "??", month = mar, year = "1975", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory); C6110 (Systems analysis and programming); C6150C (Compilers, interpreters and other processors)", corpsource = "Brandeis Univ., Waltham, MA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "algorithm theory; backtracking; computer programming; higher level languages; interpretation; nondeterministic algorithms; program interpreters; programming; translation", treatment = "T Theoretical or Mathematical", } @Article{Gavril:1975:ATC, author = "Fanica Gavril", title = "An algorithm for testing chordality of graphs", journal = j-INFO-PROC-LETT, volume = "3", number = "4", pages = "110--112", day = "??", month = mar, year = "1975", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "921; B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics)", corpsource = "Syracuse Univ., NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "algorithm; chordal graph; chordality of graphs; finite graphs; graph theory; mathematical techniques; matrix multiplication; perfect elimination graph; trees (mathematics)", treatment = "T Theoretical or Mathematical", } @Article{Yuval:1975:FNN, author = "G. Yuval", title = "Finding near neighbours in {$K$}-dimensional space", journal = j-INFO-PROC-LETT, volume = "3", number = "4", pages = "113--114", day = "??", month = mar, year = "1975", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics); C6130 (Data handling techniques)", corpsource = "Hebrew Univ., Jerusalem, Israel", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "hashing; K dimensional space; near neighbours; sorting", treatment = "T Theoretical or Mathematical", xxtitle = "Finding near neighbours on {$K$}-dimensional space", } @Article{Cahit:1975:GNS, author = "I. Cahit and R. Cahit", title = "On the Graceful Numbering of Spanning Trees", journal = j-INFO-PROC-LETT, volume = "3", number = "4", pages = "115--118", day = "??", month = mar, year = "1975", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Tue Nov 17 17:34:40 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "921; B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics)", corpsource = "Eindhoven Univ. Technol., Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "algorithms; communication networks; graceful numbering; graph theory; mathematical techniques; minimize; spanning trees; trees (mathematics)", treatment = "T Theoretical or Mathematical", } @Article{Wegbreit:1975:RCT, author = "B. Wegbreit", title = "Retrieval from context trees", journal = j-INFO-PROC-LETT, volume = "3", number = "4", pages = "119--120", day = "??", month = mar, year = "1975", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C1230 (Artificial intelligence); C6120 (File organisation)", corpsource = "Harvard Univ., Cambridge, MA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "artificial intelligence; context trees; data structures; frame problem; heuristic programming; retrieval techniques; trees (mathematics); variable binding", treatment = "T Theoretical or Mathematical", } @Article{deWolf:1975:NMS, author = "S. {de Wolf} and G. {de Mey}", title = "Numerical Methods for Solving Integral Equations of Potential Problems", journal = j-INFO-PROC-LETT, volume = "3", number = "4", pages = "121--124", day = "??", month = mar, year = "1975", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Tue Nov 17 17:35:36 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "921; B0290R (Integral equations); C4180 (Integral equations)", corpsource = "Ghent State Univ., Belgium", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "boundary value problems; boundary-value problems; integral equations; mathematical techniques; numerical analysis; numerical methods; partial differential equations; potential problems", treatment = "A Application; T Theoretical or Mathematical", } @Article{Robson:1975:SSI, author = "J. M. Robson", title = "A simple solution to the interleaved memory bandwidth problem", journal = j-INFO-PROC-LETT, volume = "3", number = "4", pages = "125--126", day = "??", month = mar, year = "1975", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics); C6120 (File organisation)", corpsource = "Univ. Lancaster, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "combinatorial mathematics; combinatorial problem; file organisation; interleaved memory bandwidth problem; memory performance analysis; storage locations", treatment = "T Theoretical or Mathematical", } @Article{Lazos:1975:CSR, author = "Constantine Lazos", title = "A Comparison of Simulation Results and a Mathematical Model of a Multiprogramming System", journal = j-INFO-PROC-LETT, volume = "3", number = "5", pages = "127--134", day = "??", month = may, year = "1975", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "722; 723; 921; C1220 (Simulation, modelling and identification); C6150J (Operating systems)", corpsource = "Dept. of Math., Univ. of Southampton, Southampton, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "analytic models; computer systems, digital; COOP-3; CPU utilisation; ICL-1907 computer system; intractable; locally written operating system; Markov models; mathematical analysis; model complex configurations; modelling; multiprogramming; multiprogramming system; multiprogramming systems; simulation; simulation model", treatment = "T Theoretical or Mathematical", } @Article{Kittler:1975:DJD, author = "J. Kittler", title = "On the divergence and the {Joshi} dependence measure in feature selection", journal = j-INFO-PROC-LETT, volume = "3", number = "5", pages = "135--137", day = "??", month = may, year = "1975", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "B6140C (Optical information, image and video signal processing); C1250 (Pattern recognition)", corpsource = "Dept. of Engng., Cambridge Univ., Cambridge, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "divergence; feature selection; Joshi dependence measure; pattern recognition; separability measures", treatment = "T Theoretical or Mathematical", } @Article{VanLeeuwen:1975:MQE, author = "Jan {Van Leeuwen}", title = "The membership question for {ET0L}-languages is polynomially complete", journal = j-INFO-PROC-LETT, volume = "3", number = "5", pages = "138--143", day = "??", month = may, year = "1975", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "721; C4210 (Formal logic); C4290 (Other computer theory)", corpsource = "Math. Centrum, Amsterdam, Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "automata theory; Chomsky hierarchy; computation complexity; computational linguistics; context-free languages; ET0L languages; lambda free unconditional transfer context free programmed grammar; membership question; NP completeness", treatment = "T Theoretical or Mathematical", } @Article{Preparata:1975:TRE, author = "F. P. Preparata and D. E. Muller", title = "The time required to evaluate division-free arithmetic expressions", journal = j-INFO-PROC-LETT, volume = "3", number = "5", pages = "144--146", day = "??", month = may, year = "1975", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Coordinated Sci. Lab., Univ. of Illinois, Urbana-Champaign, IL, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "computation trees; computational complexity; division free arithmetic expressions; evaluation time; parallel computation; parallel processing", treatment = "T Theoretical or Mathematical", } @Article{Asai:1975:DQB, author = "H. Asai and S. C. Lee", title = "Design of Queueing Buffer Register Size", journal = j-INFO-PROC-LETT, volume = "3", number = "5", pages = "147--152", day = "??", month = may, year = "1975", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C6130 (Data handling techniques)", corpsource = "Dept. of Electrical Engng., Univ. of Houston, Houston, TX, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "computer metatheory; data congestion; data handling; data transfer system; modelling; processing speed buffer length relations; queueing buffer register size; queueing theory; statistical model", treatment = "T Theoretical or Mathematical", xxtitle = "Design of queuing buffer register size", } @Article{Stevens:1975:ECA, author = "A. Stevens", title = "An elementary computer algorithm for the calculation of the coefficient of inbreeding", journal = j-INFO-PROC-LETT, volume = "3", number = "5", pages = "153--163", day = "??", month = may, year = "1975", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C7330 (Biology and medical computing); C7810 (Social and behavioural sciences computing)", corpsource = "Dept. Math. Statistics, City of London Polytech., London, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "behavioural science; biology; coefficient of inbreeding; elementary computer algorithm; life sciences; medicine; natural sciences applications of computers; pedigree; social and behavioural sciences; social science", treatment = "T Theoretical or Mathematical", } @Article{Crespi-Reghizzi:1975:EDT, author = "S. Crespi-Reghizzi and D. Mandrioli", title = "Erratum: {``A decidability theorem for a class of vector-addition systems''}", journal = j-INFO-PROC-LETT, volume = "3", number = "5", pages = "164--164", day = "??", month = may, year = "1975", 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/infoproc1970.bib", note = "See \cite{Crespi-Reghizzi:1975:DTC}.", acknowledgement = ack-nhfb, fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", } @Article{Reiser:1975:EED, author = "John F. Reiser and Donald E. Knuth", title = "Erratum: {``Evading the Drift in Floating-Point Addition''}", journal = j-INFO-PROC-LETT, volume = "3", number = "5", pages = "164--164", day = "??", month = may, year = "1975", CODEN = "IFPLAT", DOI = "https://doi.org/10.1016/0020-0190(75)90031-9", 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/benfords-law.bib; https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib; https://www.math.utah.edu/pub/tex/bib/fparith.bib", note = "See \cite{Reiser:1975:EDF}.", acknowledgement = ack-nhfb, fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", } @Article{Sridharan:1975:ECG, author = "N. S. Sridharan", title = "Erratum: {``Computer Generation of Vertex Graphs''}", journal = j-INFO-PROC-LETT, volume = "3", number = "5", pages = "164--164", day = "??", month = may, year = "1975", 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/infoproc1970.bib", note = "See \cite{Sridharan:1974:CGV}.", acknowledgement = ack-nhfb, fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", } @Article{Hansen:1975:UTC, author = "Per Brinch Hansen", title = "Universal Types in {Concurrent Pascal}", journal = j-INFO-PROC-LETT, volume = "3", number = "6", pages = "165--166", day = "??", month = jul, year = "1975", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C6130 (Data handling techniques); C6140D (High level languages); C6150J (Operating systems)", corpsource = "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 = "abstract programming language; character sets; computer operating systems; computer programming languages; Concurrent Pascal; operating systems (computers); problem oriented languages; structured programming; system programming; universal types", treatment = "P Practical", } @Article{Zave:1975:FCG, author = "D. A. Zave", title = "A fast compacting garbage collector", journal = j-INFO-PROC-LETT, volume = "3", number = "6", pages = "167--169", day = "??", month = jul, year = "1975", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation)", corpsource = "Sperry UNIVAC, Roseville, MN, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "garbage collector; list processing; storage allocation; storage allocation mechanism; storage management", treatment = "P Practical", } @Article{Bentley:1975:ARS, author = "J. L. Bentley and D. F. Stanat", title = "Analysis of range searches in quad trees", journal = j-INFO-PROC-LETT, volume = "3", number = "6", pages = "170--173", day = "??", month = jul, year = "1975", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation)", 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 = "data structure; data structures; quad trees; range searches", treatment = "T Theoretical or Mathematical", } @Article{Ghezzi:1975:LGS, author = "C. Ghezzi", title = "{LL(1)} grammars supporting an efficient error handling", journal = j-INFO-PROC-LETT, volume = "3", number = "6", pages = "174--176", day = "??", month = jul, year = "1975", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "721; C4210 (Formal logic); C6150C (Compilers, interpreters and other processors)", 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 = "automata theory; compilers; context free grammar; context-free grammars; error correction; error detection; error handling; errors; LL(1) grammars; program compilers; syntax analysis", treatment = "T Theoretical or Mathematical", } @Article{deGroote:1975:CQM, author = "H. F. {de Groote}", title = "On the complexity of quaternion multiplication", journal = j-INFO-PROC-LETT, volume = "3", number = "6", pages = "177--179", day = "??", month = jul, year = "1975", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "B0290H (Linear algebra); C4140 (Linear algebra)", corpsource = "Dept. of Math., Univ. of T{\"u}bingen, T{\"u}bingen, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "algorithm; linear algebra; quaternion multiplication", treatment = "T Theoretical or Mathematical", } @Article{Pleszczynski:1975:GP, author = "Stefan Pleszczy{\'n}ski", title = "On the Generation of Permutations", journal = j-INFO-PROC-LETT, volume = "3", number = "6", pages = "180--183", day = "??", month = jul, year = "1975", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; 921; B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics)", corpsource = "Software Dev. Centre R-POLYSYSTEM, Warszawa, Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "algorithm; combinatorial mathematics; computer programming; factorial representation; mathematical programming; natural numbers; operations research; permutations", treatment = "T Theoretical or Mathematical", } @Article{Rem:1975:PES, author = "M. Rem", title = "On the programming of elastic stores", journal = j-INFO-PROC-LETT, volume = "3", number = "6", pages = "184--187", day = "??", month = jul, year = "1975", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C5300 (Computer storage equipment and techniques); C6110 (Systems analysis and programming); C6120 (File organisation)", corpsource = "Dept. of Maths., Technol. Univ., Eindhoven, Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "computing machinery; digital storage; elastic stores; file organisation; programming", treatment = "P Practical", } @Article{Keir:1975:SSR, author = "R. A. Keir", title = "Should the stable rounding rule be radix-dependent?", journal = j-INFO-PROC-LETT, volume = "3", number = "6", pages = "188--189", day = "??", month = jul, year = "1975", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C5230 (Digital arithmetic methods)", 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/", keywords = "digital arithmetic; drift; floating point addition; radices; round to even rule; round to odd rule; stable rounding rule", treatment = "T Theoretical or Mathematical", } @Article{Yao:1975:VAF, author = "Andrew C. Yao", title = "An {$ O(|E|) \log \log |V| $} algorithm for finding minimum spanning trees", journal = j-INFO-PROC-LETT, volume = "4", number = "??", pages = "21--23", day = "??", month = "??", year = "1975", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 06:33:21 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", } @Article{Germano:1975:SSR, author = "G. Germano and A. Maggiolo-Schettini", title = "Sequence-to-sequence recursiveness", journal = j-INFO-PROC-LETT, volume = "4", number = "1", pages = "1--6", day = "??", month = sep, year = "1975", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Istituto di Scienze dell'Informazione, Univ. Salerno, Salerno, Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "algorithm theory; closures of minimal sets of initial functions; computable functions; computation theory; natural number computation; number theory; parallel processing; recursive functions; recursive number theory; repetition operators; sequence to sequence recursiveness; statement of a programming language", treatment = "T Theoretical or Mathematical", } @Article{Ruohonen:1975:TRC, author = "K. Ruohonen", title = "Three results of comparison between {$L$} languages with and without interaction", journal = j-INFO-PROC-LETT, volume = "4", number = "1", pages = "7--10", day = "??", month = sep, year = "1975", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Math. Dept., Univ. of Turku, Turku, Finland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "comparison between L languages; complementation; developmental systems; finite DOL language; formal languages; generating ability; language operations; propagating OL systems; unary case", treatment = "T Theoretical or Mathematical", } @Article{Penttonen:1975:EGG, author = "Martti Penttonen", title = "{ET0L}-Grammars and {$N$}-Grammars", journal = j-INFO-PROC-LETT, volume = "4", number = "1", pages = "11--13", day = "??", month = sep, year = "1975", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "721; C4210 (Formal logic)", corpsource = "Math. Dept., Univ. of Turku, Turku, Finland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "automata theory; Chomsky type formal language theory; closure properties; context-free languages; ETOL language family; grammars; Lindenmayer type formal language theory; N grammars; N-type characterization; ordered grammars, ETOL grammars; programmed context free languages; programmed grammars", treatment = "T Theoretical or Mathematical", xxtitle = "{ETOL}-grammars and {$N$}-grammars", } @Article{Nieminen:1975:HIT, author = "J. Nieminen", title = "On homomorphic images of transition graphs", journal = j-INFO-PROC-LETT, volume = "4", number = "1", pages = "14--15", day = "??", month = sep, year = "1975", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics); C4220 (Automata theory)", corpsource = "Dept. of Tech. Sci., Finnish Acad., Helsinki, Finland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "automata theory; Boolean matrix products; graph theory; homomorphic images; sequential machine decomposition; tolerance relations; transition graphs; undirected graphs", treatment = "T Theoretical or Mathematical", } @Article{Nieminen:1975:SOD, author = "J. Nieminen", title = "Some observations on the determination of an upper bound for the clique number of a graph", journal = j-INFO-PROC-LETT, volume = "4", number = "1", pages = "16--17", day = "??", month = sep, year = "1975", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Tue Nov 17 17:36:47 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics)", corpsource = "Dept. of Tech. Sci., Finnish Acad., Helsinki, Finland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "clique number; graph theory; independence number; information sciences; operations research; subgraph; undirected graph; upper bound", treatment = "T Theoretical or Mathematical", } @Article{Kang:1975:SPC, author = "A. N. C. Kang and D. A. Ault", title = "Some properties of a centroid of a free tree", journal = j-INFO-PROC-LETT, volume = "4", number = "1", pages = "18--20", day = "??", month = sep, year = "1975", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Computer Sci. Dept., Virginia Polytech. Inst., State Univ., Blacksburg, VA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "algorithm theory; centroid; free tree; minimum height; nodes; oriented tree; trees (mathematics)", treatment = "T Theoretical or Mathematical", } @Article{Yao:1975:AFM, author = "A. C. Yao", title = "An {$ O(|E|) \log \log |V| $} algorithm for finding minimum spanning trees", journal = j-INFO-PROC-LETT, volume = "4", number = "1", pages = "21--23", day = "??", month = sep, year = "1975", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "B0250 (Combinatorial mathematics); 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 = "algorithm theory; connected undirected graph; linear median finding algorithm; minimisation; minimum spanning trees; trees (mathematics)", treatment = "T Theoretical or Mathematical", } @Article{Misra:1975:OCP, author = "J. Misra and R. E. Tarjan", title = "Optimal chain partitions of trees", journal = j-INFO-PROC-LETT, volume = "4", number = "1", pages = "24--26", day = "??", month = sep, year = "1975", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Dept. of Computer Sci., Univ. of Texas, TX, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "clustering; optimal chain partitions of trees; priority queue; programming theory; trees (mathematics)", treatment = "T Theoretical or Mathematical", } @Article{Rowicki:1975:NOS, author = "Andrzej Rowicki", title = "A note on optimal scheduling for two-processor systems", journal = j-INFO-PROC-LETT, volume = "4", number = "2", pages = "27--30", day = "??", month = nov, year = "1975", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C5400 (Analogue and digital computers and systems); C6150J (Operating systems)", 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 = "computer programming; execution time; multiprocessing systems; network; optimal scheduling; scheduling; two identical processors", treatment = "T Theoretical or Mathematical", } @Article{Jarzabek:1975:LRG, author = "Stanislaw Jarzabek and Tomasz Krawczyk", title = "{LL}-regular grammars", journal = j-INFO-PROC-LETT, volume = "4", number = "2", pages = "31--37", day = "??", month = nov, year = "1975", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "721; C4210 (Formal logic)", corpsource = "MERA-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; bottom up algorithms; content free languages; context-free grammars; LL(k) languages; LLR grammar LLS(k) grammar; LLR languages; regular grammars; regular partition; separating set; syntactic analysis; top down manner", treatment = "N New Development; T Theoretical or Mathematical", } @Article{Levy:1975:COP, author = "M. R. Levy", title = "Complete operator precedence", journal = j-INFO-PROC-LETT, volume = "4", number = "2", pages = "38--40", day = "??", month = nov, year = "1975", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Appl. Math., Univ. of the Witwatersrand, Johannesburg, South Africa", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "context free grammar; context-free grammars; derivations; formal theory; gap; operator precedence; parsing method; programming languages; shift reduce algorithm; terminators", treatment = "T Theoretical or Mathematical", } @Article{Cockayne:1975:LAD, author = "E. Cockayne and S. Goodman and S. Hedetniemi", title = "A linear algorithm for the domination number of a tree", journal = j-INFO-PROC-LETT, volume = "4", number = "2", pages = "41--44", day = "??", month = nov, year = "1975", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "921; B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics); C7310 (Mathematics computing)", corpsource = "Univ. of Victoria, Victoria, BC, Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "bound vertices; domination number of a tree; FORTRAN subroutine DOMSET; linear algorithm; mathematical programming; mathematical techniques; minimum number of vertices; set DOMSET; subroutines; trees (mathematics)", treatment = "A Application; T Theoretical or Mathematical", } @Article{Hyafil:1975:ACS, author = "L. Hyafil and J. P. {Van de Wiele}", title = "On the additive complexity of specific polynomials", journal = j-INFO-PROC-LETT, volume = "4", number = "2", pages = "45--47", day = "??", month = nov, year = "1975", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "IRIA-Laboria, Rocquencourt, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "additive complexity; algebraic complexity; Borodin's conjecture; bounded subset; computational complexity; polynomials; real line; sequence of functions; specific polynomials; unbounded function", treatment = "T Theoretical or Mathematical", } @Article{Anderssen:1975:RND, author = "R. S. Anderssen and A. J. Guttmann", title = "A rationale for the numerical differentiation of experimental data", journal = j-INFO-PROC-LETT, volume = "4", number = "2", pages = "48--50", day = "??", month = nov, year = "1975", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "B0290M (Numerical integration and differentiation); C4160 (Numerical integration and differentiation)", corpsource = "Computer Centre, Australian Nat. Univ., Canberra, ACT, Australia", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "data handling; differentiation; experimental data; filtering; numerical differentiation; numerical methods; regularisation procedure; spline modelling; two stage procedure", treatment = "T Theoretical or Mathematical", } @Article{Sekey:1975:GFE, author = "A. A. Sekey", title = "A generating function for entropy", journal = j-INFO-PROC-LETT, volume = "4", number = "2", pages = "51--??", day = "??", month = nov, year = "1975", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "B0240 (Probability and statistics); C1140 (Probability and statistics)", corpsource = "Everyman's Univ., Ramat-Aviv, Israel", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "calculation of moments; entropy; generating function; information theory; probability; probability distribution; Shannon's expression", treatment = "T Theoretical or Mathematical", } @Article{Johnson:1975:PQU, author = "Donald B. Johnson", title = "Priority Queues with Update and Finding Minimum Spanning Trees", journal = j-INFO-PROC-LETT, volume = "4", number = "3", pages = "53--57", day = "??", month = dec, year = "1975", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; B0240C (Queueing theory); C1140C (Queueing theory); C4240 (Programming and algorithm theory)", corpsource = "Computer Sci. Dept., 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 = "algorithm theory; computer programming; dense graphs; minimum spanning trees; priority queue; queueing theory; trees (mathematics); update", treatment = "T Theoretical or Mathematical", } @Article{Rotem:1975:CBB, author = "D. Rotem", title = "On a correspondence between binary trees and a certain type of permutation", journal = j-INFO-PROC-LETT, volume = "4", number = "3", pages = "58--61", day = "??", month = dec, year = "1975", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Appl. Math., Univ. of Witwatersrand, Johannesburg, South Africa", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "binary trees; Catalan numbers; combinatorial mathematics; permutation; programming theory; trees (mathematics)", treatment = "T Theoretical or Mathematical", } @Article{Clark:1975:FAC, author = "D. W. Clark", title = "A fast algorithm for copying binary trees", journal = j-INFO-PROC-LETT, volume = "4", number = "3", pages = "62--63", day = "??", month = dec, year = "1975", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6120 (File organisation)", 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 = "algorithm; binary trees copying; constant workspace; data structures; programming theory; stack free copying; trees (mathematics)", treatment = "T Theoretical or Mathematical", } @Article{Banerjee:1975:DLD, author = "J. Banerjee and V. Rajaraman", title = "A dual link data structure for random file organization", journal = j-INFO-PROC-LETT, volume = "4", number = "3", pages = "64--69", day = "??", month = dec, year = "1975", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Tue Nov 17 17:37:30 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C6120 (File organisation)", corpsource = "Computer Centre, Indian Inst. of Technol., Kanpur, India", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "data processing; data structures; dual link data structure; file organisation; hashing; random access store; random file organisation; random-access storage", treatment = "T Theoretical or Mathematical", } @Article{Duncan:1975:LUP, author = "A. G. Duncan and L. Yelowitz", title = "Loop unravelling: a practical tool in proving program correctness", journal = j-INFO-PROC-LETT, volume = "4", number = "3", pages = "70--72", day = "??", month = dec, year = "1975", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Information and Computer Sci. Dept., Univ. of California, Irvine, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "fault tolerant computing; loop unravelling; program correctness proof; programming theory", treatment = "T Theoretical or Mathematical", } @Article{Christensen:1975:CME, author = "R. Christensen", title = "Crossvalidation: {Minimizing} the entropy of the future", journal = j-INFO-PROC-LETT, volume = "4", number = "3", pages = "73--76", day = "??", month = dec, year = "1975", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "B6140C (Optical information, image and video signal processing); C1250 (Pattern recognition); C7330 (Biology and medical computing)", corpsource = "Biotechnol. Program, Carnegie-Mellon Univ., Pittsburgh, PA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "biomedical applications of computers; classification purity; cross validation; entropy minimisation; pattern discovery technique; pattern recognition; predictive uncertainty; statistical confidence", treatment = "T Theoretical or Mathematical", } @Article{Pearl:1975:CIC, author = "Judea Pearl", title = "On the Complexity of Inexact Computations", journal = j-INFO-PROC-LETT, volume = "4", number = "3", pages = "77--81", day = "??", month = dec, year = "1975", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory)", corpsource = "School of Engng. and Appl. Sci., Univ. of California, Los Angeles, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "computational complexity; computer programming; inexact computations; information/theoretic considerations", treatment = "T Theoretical or Mathematical", } @Article{Barrow:1976:SIM, author = "H. G. Barrow and R. M. Burstall", title = "Subgraph isomorphism, matching relational structures and maximal cliques", journal = j-INFO-PROC-LETT, volume = "4", number = "4", pages = "83--84", day = "??", month = jan, year = "1976", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Tue Nov 17 17:38:02 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics)", corpsource = "Dept. of Artificial Intelligence, Univ. of Edinburgh, Edinburgh, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "graph theory; isomorphism; matching relational structures; maximal cliques; subgraph", treatment = "T Theoretical or Mathematical", } @Article{Galil:1976:TFS, author = "Zvi Galil", title = "Two Fast Simulations Which Imply Some Fast String Matching and Palindrome-Recognition Algorithms", journal = j-INFO-PROC-LETT, volume = "4", number = "4", pages = "85--87", day = "??", month = jan, year = "1976", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "721; C4220 (Automata theory)", corpsource = "Dept. of Computer Sci., IBM T.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 = "automata theory; deterministic multitape Turing machine; fast string matching; palindrome recognition; random access machine; simulations; Turing machines", treatment = "T Theoretical or Mathematical", } @Article{Lamport:1976:CSA, author = "L. Lamport", title = "Comments on {``A synchronization anomaly''}", journal = j-INFO-PROC-LETT, volume = "4", number = "4", pages = "88--89", day = "??", month = jan, year = "1976", 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/infoproc1970.bib", note = "See \cite{Lipton:1975:SA}.", acknowledgement = ack-nhfb, classification = "C4290 (Other computer theory); C6150J (Operating systems)", corpsource = "Massachusetts Computer Associates Inc., Wakefield, MA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "concurrent processes; multiprocessing programs; supervisory and executive programs; synchronisation", treatment = "T Theoretical or Mathematical", } @Article{Wessner:1976:OAS, author = "Russell L. Wessner", title = "Optimal Alphabetic Search Trees with Restricted Maximal Height", journal = j-INFO-PROC-LETT, volume = "4", number = "4", pages = "90--94", day = "??", month = jan, year = "1976", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory)", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "algorithm theory; alphabetic; binary; computer programming; file organisation; optimal; restricted maximal height; search tree", treatment = "T Theoretical or Mathematical", } @Article{Lang:1976:SUL, author = "Tomas Lang and Eduardo B. Fernandez", title = "Scheduling of Unit-Length Independent Tasks with Execution Constraints", journal = j-INFO-PROC-LETT, volume = "4", number = "4", pages = "95--98", day = "??", month = jan, year = "1976", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C1290F (Systems theory applications in industry); C4290 (Other computer theory); C5400 (Analogue and digital computers and systems); C6150J (Operating systems)", corpsource = "Computer Sci. Dept., Univ. of California, Los Angeles, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "computer systems programming; execution constraints; identical processors; independent tasks; individual execution intervals; multiprocessing programs; scheduled; scheduling", treatment = "T Theoretical or Mathematical", } @Article{Krishnamurthy:1976:NPF, author = "M. S. Krishnamurthy and H. R. {Ramesha Chandra}", title = "A note on precedence functions", journal = j-INFO-PROC-LETT, volume = "4", number = "4", pages = "99--100", day = "??", month = jan, year = "1976", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Computer Centre, Indian Inst. of Technol., Kanpur, India", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "grammars; no precedence functions exist; precedence grammar; three symbols", treatment = "T Theoretical or Mathematical", } @Article{Ehrich:1976:SSR, author = "H. D. Ehrich and W. {Lipski, Jr.}", title = "On the Storage Space Requirement of Consecutive Retrieval with Redundancy", journal = j-INFO-PROC-LETT, volume = "4", number = "4", pages = "101--104", day = "??", month = jan, year = "1976", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; 901; C6120 (File organisation)", corpsource = "Abteilung Informatik, Univ. of Dortmund, Dortmund, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "consecutive retrieval with redundancy; file organisation; information retrieval; information retrieval systems; storage space requirement; suboptimal solutions", treatment = "T Theoretical or Mathematical", } @Article{Feyock:1976:NTE, author = "Stefan Feyock", title = "Noiselike Transforms of $ \omega $-Events", journal = j-INFO-PROC-LETT, volume = "4", number = "4", pages = "105--108", day = "??", month = jan, year = "1976", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Tue Nov 17 17:38:37 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "921; C4220 (Automata theory)", corpsource = "Dept. of Information and Computing Sci., Univ. of Oklahoma, Norman, OK, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "automata theory; deletion; effects; errors; finite automata; infinite tapes; interference; message distortions; noiselike transformations; omega events; reception; regular sets; regularity; static; transmission", treatment = "T Theoretical or Mathematical", } @Article{Hanson:1976:SVB, author = "D. R. Hanson", title = "A simple variant of the boundary-tag algorithm for the allocation of coroutine environments", journal = j-INFO-PROC-LETT, volume = "4", number = "4", pages = "109--112 (or 109--111??)", day = "??", month = jan, year = "1976", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "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/", keywords = "boundary tag algorithm; coroutine environments; dynamic allocation of storage; program interpreters; Sil/2 programming language; storage allocation; transportable interpreters", treatment = "T Theoretical or Mathematical", } @Article{Chrobot:1976:LLC, author = "Stanislaw Chrobot", title = "Layer --- a Language Construction for Concurrent Structural Program Design", journal = j-INFO-PROC-LETT, volume = "4", number = "5", pages = "113--117", day = "??", month = feb, year = "1976", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C4290 (Other computer theory); C6140D (High level languages)", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "computer programming languages; CONCURRENT PASCAL; data structure; global variables; language construction; layer; operating systems; problem oriented languages; program components; programming languages; scope rules; type entries", treatment = "P Practical", } @Article{Cunningham:1976:NSD, author = "R. J. Cunningham and M. E. J. Gilford", title = "A note on the semantic definition of side effects", journal = j-INFO-PROC-LETT, volume = "4", number = "5", pages = "118--120", day = "??", month = feb, year = "1976", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6140 (Programming languages)", corpsource = "Dept. of Computing and Control, Imperial Coll. of Sci. and Technol., London, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "axiomatic definition; CORAL 66; PASCAL; programming languages; programming theory; semantic assertions; semantic definition; side effects", treatment = "T Theoretical or Mathematical", } @Article{Coy:1976:LMP, author = "Wolfgang Coy", title = "The logical meaning of programs of a subrecursive language", journal = j-INFO-PROC-LETT, volume = "4", number = "5", pages = "121--126", day = "??", month = feb, year = "1976", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Fachbereich Informatik, Tech. Hochschule Darmstadt, Darmstadt, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "assignments; computer metatheory; computer programming languages; conditionals; data structures; fixpoint semantics; FLOYD assertions; formal logical statement; function procedures; inductive assertions; loops; programming languages; programming theory; subrecursive language", treatment = "T Theoretical or Mathematical", } @Article{Rozenberg:1976:SIG, author = "G. Rozenberg", title = "On slicing of {$K$}-iteration grammars", journal = j-INFO-PROC-LETT, volume = "4", number = "5", pages = "127--131", day = "??", month = feb, year = "1976", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Math., Univ. of Utrecht, Utrecht, Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "formal languages; grammars; K iteration grammars; L systems; periodic properties; slicing", treatment = "T Theoretical or Mathematical", } @Article{Bentley:1976:HPM, author = "Jon Louis Bentley and Walter A. Burkhard", title = "Heuristics for Partial-Match Retrieval Data Base Design", journal = j-INFO-PROC-LETT, volume = "4", number = "5", pages = "132--135", day = "??", month = feb, year = "1976", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; 901; C6120 (File organisation); C7250 (Information storage and retrieval)", corpsource = "Stanford Linear Accelerator Center, Stanford Univ., Stanford, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "binary search tries; data base design; database management systems; heuristic algorithms; information retrieval; information science; partial match retrieval; secondary keys", treatment = "P Practical", } @Article{deWolf:1976:NSI, author = "S. {de Wolf} and G. {de Mey}", title = "Numerical Solution of Integral Equations for Potential Problems by a Variational Principle", journal = j-INFO-PROC-LETT, volume = "4", number = "5", pages = "136--139", day = "??", month = feb, year = "1976", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Tue Nov 17 17:39:07 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "921; B0290R (Integral equations); C4180 (Integral equations)", corpsource = "Lab. of Electronics, Ghent State Univ., Ghent, Belgium", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "integral equations; Laplace equations; mathematical techniques; numerical analysis; potential problems; variational principle", treatment = "T Theoretical or Mathematical", } @Article{Pritchard:1976:PRM, author = "P. A. Pritchard", title = "A proof rule for multiple coroutine systems", journal = j-INFO-PROC-LETT, volume = "4", number = "6", pages = "141--143", day = "??", month = mar, year = "1976", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Dept. of Information Sci., Univ. of Melbourne, Parkville, Vic., Australia", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "axiomatic semantics; multiple coroutine systems; program proving; programming theory; proof rule", treatment = "T Theoretical or Mathematical", } @Article{Reusch:1976:GLA, author = "Peter J. A. Reusch", title = "Generalized Lattices Applicable in Retrieval Models", journal = j-INFO-PROC-LETT, volume = "4", number = "6", pages = "144--148", day = "??", month = mar, year = "1976", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; 901; C7250 (Information storage and retrieval)", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "advanced retrieval systems; discrete mathematics; information retrieval; information retrieval systems; structure theory", treatment = "T Theoretical or Mathematical", } @Article{Dobkin:1976:CV, author = "D. Dobkin and J. {Van Leeuwen}", title = "The complexity of vector-products", journal = j-INFO-PROC-LETT, volume = "4", number = "6", pages = "149--154", day = "??", month = mar, year = "1976", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", 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 = "bilinear forms; complexity; computational complexity; vector products", treatment = "T Theoretical or Mathematical", } @Article{Yuval:1976:AFA, author = "G. Yuval", title = "An algorithm for finding all shortest paths using {$ N^{2.81} $} infinite-precision multiplications", journal = j-INFO-PROC-LETT, volume = "4", number = "6", pages = "155--156", day = "??", month = mar, year = "1976", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Hebrew Univ., Jerusalem, Israel", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "algorithm; all shortest paths; complexity; graph theory; infinite precession multiplications", treatment = "T Theoretical or Mathematical", } @Article{Engelfriet:1976:CT, author = "J. Engelfriet and S. Skyum", title = "Copying theorems", journal = j-INFO-PROC-LETT, volume = "4", number = "6", pages = "157--161", day = "??", month = mar, year = "1976", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Appl. Math., Tech. Univ. Twente, Enschede, Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "copying theorems; formal languages", treatment = "T Theoretical or Mathematical", } @Article{Rozenberg:1976:NIG, author = "G. Rozenberg and D. Wood", title = "A note on {$K$}-iteration grammars", journal = j-INFO-PROC-LETT, volume = "4", number = "6", pages = "162--164", day = "??", month = mar, year = "1976", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Math., Univ. of Antwerp, Antwerp, Belgium", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "grammars; K-iteration grammars; sequential machines", treatment = "T Theoretical or Mathematical", } @Article{Krzemien:1976:AGL, author = "Roman Krzemie{\'n} and Andrezej {\L}ukasiewicz", title = "Automatic Generation of Lexical Analyzers in a Compiler-Compiler", journal = j-INFO-PROC-LETT, volume = "4", number = "6", pages = "165--168", day = "??", month = mar, year = "1976", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C4210 (Formal logic); C6150C (Compilers, interpreters and other processors)", corpsource = "Inst. of Math. Machines `MERA', Warsaw, Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "automatic generation; compiler compiler; computer operating systems; context-free grammars; lexical analysers; program compilers", treatment = "T Theoretical or Mathematical", } @Article{Gairola:1976:DIS, author = "B. K. Gairola and V. Rajaraman", title = "A distributed index sequential access method", journal = j-INFO-PROC-LETT, volume = "5", number = "1", pages = "1--5", day = "??", month = may, year = "1976", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; 901; C6120 (File organisation)", corpsource = "Computer Center, Indian Inst. of Technol., Kanpur, India", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "data processing; direct access storage devices; direct retrieval; file organisation; index sequential access method; information retrieval systems; latency; sequential retrieval", treatment = "P Practical", } @Article{Manacher:1976:APM, author = "G. K. Manacher", title = "An application of pattern matching to a problem in geometrical complexity", journal = j-INFO-PROC-LETT, volume = "5", number = "1", pages = "6--7", day = "??", month = may, year = "1976", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "B6140C (Optical information, image and video signal processing); C1250 (Pattern recognition); C5530 (Pattern recognition and computer vision equipment)", corpsource = "Dept. of Information Engng., Univ. of Illinois, Chicago, IL, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "combinatorial problems; geometrical complexity; pattern matching; pattern recognition; polygons", treatment = "P Practical", } @Article{Arjomandi:1976:FAU, author = "E. Arjomandi", title = "On finding all unilaterally connected components of a digraph", journal = j-INFO-PROC-LETT, volume = "5", number = "1", pages = "8--10", day = "??", month = may, year = "1976", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "B0250 (Combinatorial mathematics); 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 = "digraph; graph theory; k decomposable digraph; polynomial algorithm; transitive closure; unilaterally connected components", treatment = "A Application; T Theoretical or Mathematical", } @Article{Maurer:1976:IDU, author = "H. A. Maurer and Th. Ottmann and H.-W. W. Six", title = "Implementing Dictionaries Using Binary Trees of Very Small Height", journal = j-INFO-PROC-LETT, volume = "5", number = "1", pages = "11--14", day = "??", month = may, year = "1976", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C4210 (Formal logic); C6120 (File organisation); 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/", journalabr = "Inf Process Lett", keywords = "balanced tree; binary trees; computer metatheory; data structures; dictionaries; searching; trees (mathematics); updating", treatment = "T Theoretical or Mathematical", } @Article{Hyafil:1976:COB, author = "L. Hyafil and R. L. Rivest", title = "Constructing optimal binary decision trees is {NP}-complete", journal = j-INFO-PROC-LETT, volume = "5", number = "1", pages = "15--17", day = "??", month = may, year = "1976", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "IRIA-Lab., Rocquencourt, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "binary decision trees; computational complexity; NP complete; trees (mathematics)", treatment = "T Theoretical or Mathematical", } @Article{Barak:1976:PED, author = "A. B. Barak", title = "On the parallel evaluation of division-free arithmetic expressions with fan-in of three", journal = j-INFO-PROC-LETT, volume = "5", number = "1", pages = "18--19", day = "??", month = may, year = "1976", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Dept. of Computer Sci., Hebrew Univ., Jerusalem, Israel", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "arithmetic expressions; computational complexity; digital arithmetic; division free; fan in of three; parallel computation", treatment = "T Theoretical or Mathematical", } @Article{Valiant:1976:RCC, author = "L. G. Valiant", title = "Relative complexity of checking and evaluating", journal = j-INFO-PROC-LETT, volume = "5", number = "1", pages = "20--23", day = "??", month = may, year = "1976", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "Centre for Computer Studies, Univ. of Leeds, Leeds, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "computational complexity; nondeterminism; polynomial completeness; polynomial time computation; relative complexity; Turing machines", treatment = "T Theoretical or Mathematical", } @Article{Wang:1976:RMA, author = "Patrick Shen-Pei Wang", title = "Recursiveness of Monotonic Array Grammars and a Hierarchy of Array Languages", journal = j-INFO-PROC-LETT, volume = "5", number = "1", pages = "24--26", day = "??", month = may, year = "1976", 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/infoproc1970.bib", note = "See erratum \cite{Wang:1976:ERM}.", acknowledgement = ack-nhfb, classification = "721; C4210 (Formal logic); C4220 (Automata theory)", 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/", journalabr = "Inf Process Lett", keywords = "array grammars; array languages; automata theory; formal languages; grammars; hierarchy; recursive array languages; recursive functions; Turing Church's thesis", treatment = "T Theoretical or Mathematical", } @Article{Marsaglia:1976:IFM, author = "G. Marsaglia and K. Ananthanarayanan and N. J. Paul", title = "Improvements on Fast Methods for Generating Normal Random Variables", journal = j-INFO-PROC-LETT, volume = "5", number = "2", pages = "27--30", day = "??", month = jun, year = "1976", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "922; B0240G (Monte Carlo methods); C1140G (Monte Carlo methods); C7890 (Other special applications of computing)", 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 = "mathematical programming; mathematical statistics; Monte Carlo; Monte Carlo methods; normal random variables; random number generation; random numbers; rectangle tooth tail method; simulation", treatment = "A Application; T Theoretical or Mathematical", } @Article{Sassa:1976:HMF, author = "M. Sassa and E. Goto", title = "A Hashing Method for Fast Set Operations", journal = j-INFO-PROC-LETT, volume = "5", number = "2", pages = "31--34", day = "??", month = jun, year = "1976", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Dept. of Information Sci., Tokyo Inst. of Technol., Oh-okayama, Meguro, Tokyo, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "computational complexity; fast set operations; hashing; set; time complexity", treatment = "A Application; T Theoretical or Mathematical", } @Article{Lucena:1976:TSE, author = "C. J. Lucena and D. D. Cowan", title = "Toward a system's environment for computer assisted programming", journal = j-INFO-PROC-LETT, volume = "5", number = "2", pages = "35--40", day = "??", month = jun, year = "1976", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C6110 (Systems analysis and programming); C6140 (Programming languages); C7430 (Computer engineering)", corpsource = "Informatics Dept., Pontifical Catholic Univ., Rio de Janeiro, Brazil", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "computer assisted programming; data structures; modularity; programming; programming languages; programming systems", treatment = "A Application; P Practical", } @Article{Madsen:1976:MMD, author = "Niel K. Madsen and Garry H. Rodrigue and Jack I. Karush", title = "Matrix Multiplication by Diagonals on a Vector\slash Parallel Processor", journal = j-INFO-PROC-LETT, volume = "5", number = "2", pages = "41--45", day = "??", month = jun, year = "1976", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory); C5230 (Digital arithmetic methods)", corpsource = "Lawrence Livermore Lab., Univ. of California, Livermore, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "algorithm theory; analysis of algorithms; CDC STAR-100; computer programming; matrix algebra; matrix multiplication; numerical mathematics; parallel processing; vector processor; vector/parallel processor", treatment = "A Application; T Theoretical or Mathematical", } @Article{Probert:1976:CNC, author = "R. L. Probert", title = "Commutativity, non-commutativity, and bilinearity", journal = j-INFO-PROC-LETT, volume = "5", number = "2", pages = "46--49", day = "??", month = jun, year = "1976", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Dept. of Computational Sci., Univ. of Saskatchewan, Saskatoon, Sask., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "algorithm analysis; algorithm theory; bilinear chains; bilinear forms; commutativity; computational complexity; computing power; matrix multiplication; noncommutative rings; polynomial algorithms", treatment = "A Application; T Theoretical or Mathematical", } @Article{Hansen:1976:CAL, author = "P. Hansen", title = "A cascade algorithm for the logical closure of a set of binary relations", journal = j-INFO-PROC-LETT, volume = "5", number = "2", pages = "50--54", day = "??", month = jun, year = "1976", 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/infoproc1970.bib", note = "See erratum \cite{Hansen:1976:ECA}.", acknowledgement = ack-nhfb, classification = "B0260 (Optimisation techniques); C1180 (Optimisation techniques); C4240 (Programming and algorithm theory)", corpsource = "Inst. d'Economie Sci. et de Gestion, Lille, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "algorithm theory; binary relations; Boolean variables; cascade algorithm; integer programming; logical closure", treatment = "A Application; T Theoretical or Mathematical", } @Article{Kundu:1976:LAH, author = "S. Kundu", title = "A linear algorithm for the {Hamiltonian} completion number of a tree", journal = j-INFO-PROC-LETT, volume = "5", number = "2", pages = "55--57", day = "??", month = jun, year = "1976", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics); C4210 (Formal logic)", corpsource = "Logicon Inc., San Pedro, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "degree; graph; Hamiltonian completion number; hamiltonian cycle; information retrieval; linear algorithm; subtree; tree; trees (mathematics)", treatment = "A Application; T Theoretical or Mathematical", } @Article{Mandrioli:1976:RCF, author = "D. Mandrioli", title = "$n$-Reconstructability of context-free grammars", journal = j-INFO-PROC-LETT, volume = "5", number = "2", pages = "58--62", day = "??", month = jun, year = "1976", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Tue Nov 17 17:39:32 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "721; C4210 (Formal logic)", 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 = "automata theory; context free grammar; context free grammars; context-free grammars; nonterminal bounded grammars; phrase marker; reconstructability; stencil paths; stencil tree", treatment = "T Theoretical or Mathematical", } @Article{Yuval:1976:FNN, author = "G. Yuval", title = "Finding nearest neighbours", journal = j-INFO-PROC-LETT, volume = "5", number = "3", pages = "63--65", day = "??", month = aug, year = "1976", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C6130 (Data handling techniques)", corpsource = "Computer Sci. Dept., Carnegie-Mellon Univ., Pittsburgh, PA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "closest pair; nearest neighbours; sorting", treatment = "T Theoretical or Mathematical", } @Article{Lawler:1976:NCC, author = "E. L. Lawler", title = "A note on the complexity of the chromatic number problem", journal = j-INFO-PROC-LETT, volume = "5", number = "3", pages = "66--67", day = "??", month = aug, year = "1976", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics)", corpsource = "IRIA, Rocquencourt, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "algorithm; chromatic number problem; complexity; graph theory; running time", treatment = "T Theoretical or Mathematical", } @Article{Luccio:1976:SCR, author = "F. Luccio and F. P. Preparata", title = "Storage for Consecutive Retrieval", journal = j-INFO-PROC-LETT, volume = "5", number = "3", pages = "68--71", day = "??", month = aug, year = "1976", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C6120 (File organisation)", corpsource = "Univ. of Illinois, Urbana-Champaign, Urbana, IL, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "algorithm; binary vectors; consecutive retrieval; data processing; file organisation; storage", treatment = "T Theoretical or Mathematical", } @Article{Santoro:1976:FTS, author = "Nicola Santoro", title = "Full Table Search by Polynomial Functions", journal = j-INFO-PROC-LETT, volume = "5", number = "3", pages = "72--74", day = "??", month = aug, year = "1976", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C6130 (Data handling techniques)", 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 = "computer systems programming; full table search; hash coding; open addressing; polynomial functions; table lookup", treatment = "T Theoretical or Mathematical", } @Article{Zave:1976:SEI, author = "D. A. Zave", title = "A series expansion involving the harmonic numbers", journal = j-INFO-PROC-LETT, volume = "5", number = "3", pages = "75--77", day = "??", month = aug, year = "1976", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "B0210 (Algebra); C1110 (Algebra)", corpsource = "Computer Sci. Dept., Stanford Univ., Stanford, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "generating functions; harmonic numbers; series (mathematics); series expansion", treatment = "T Theoretical or Mathematical", } @Article{Lozinskii:1976:PSO, author = "E. L. Lozinskii", title = "On a problem in storage optimization", journal = j-INFO-PROC-LETT, volume = "5", number = "3", pages = "78--80", day = "??", month = aug, year = "1976", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation)", corpsource = "Dept. of Computer Sci., Hebrew Univ., Jerusalem, Israel", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "access probability; access times; distribution; file organisation; optimisation; storage; total storage cost", treatment = "T Theoretical or Mathematical", } @Article{Shyamasundar:1976:NLP, author = "R. K. Shyamasundar", title = "A note on linear precedence functions", journal = j-INFO-PROC-LETT, volume = "5", number = "3", pages = "81--??", day = "??", month = aug, year = "1976", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Tata Inst. of Fundamental Res., Colaba, Bombay, India", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "context free grammar; context-free grammars; linear precedence functions", treatment = "T Theoretical or Mathematical", } @Article{Bentley:1976:AOA, author = "J. L. Bentley and A. Chi-Chih Yao", title = "An almost optimal algorithm for unbounded searching", journal = j-INFO-PROC-LETT, volume = "5", number = "3", pages = "82--87", day = "??", month = aug, year = "1976", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C6130 (Data handling techniques)", 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 = "algorithm; almost optimal; comparison searching; table; table lookup; unbounded searching", treatment = "T Theoretical or Mathematical", } @Article{Trivedi:1976:SA, author = "K. S. Trivedi", title = "On a semaphore anomaly", journal = j-INFO-PROC-LETT, volume = "5", number = "3", pages = "88--89", day = "??", month = aug, year = "1976", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6150J (Operating systems)", corpsource = "Dept. of Computer Sci., Duke Univ., Durham, NC, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "anomaly; operating systems (computers); programming theory; semaphore; unary", treatment = "T Theoretical or Mathematical", } @Article{Wang:1976:ERM, author = "Patrick Shen-Pei Wang", title = "Erratum: {``Recursiveness of Monotonic Array Grammars and a Hierarchy of Array Languages''}", journal = j-INFO-PROC-LETT, volume = "5", number = "3", pages = "90--90", day = "??", month = aug, year = "1976", 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/infoproc1970.bib", note = "See \cite{Wang:1976:RMA}.", acknowledgement = ack-nhfb, fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", } @Article{Innes:1976:IAP, author = "Donald R. Innes and Shalom Tsur", title = "Interval Analysis, Pagination and Program Locality", journal = j-INFO-PROC-LETT, volume = "5", number = "4", pages = "91--96", day = "??", month = oct, year = "1976", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C6120 (File organisation); C6150J (Operating systems)", corpsource = "Computer Lab., Univ. of Liverpool, Liverpool, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "computer programming; interval analysis; interval partitioning; pagination; paging; program locality; virtual memory; virtual storage", treatment = "P Practical; T Theoretical or Mathematical", xxauthor = "D. R. Innes and S. Tsur", xxauthor = "Donald R. Innis and Shalom Tsur", } @Article{Meertens:1976:SST, author = "L. Meertens", title = "A space-saving technique for assigning {ALGOL 68} multiple values", journal = j-INFO-PROC-LETT, volume = "5", number = "4", pages = "97--99", day = "??", month = oct, year = "1976", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6140D (High level languages)", corpsource = "Math. Centrum, Amsterdam, Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "ALGOL; ALGOL 68; multiple values; optimisation; space saving technique", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Yu:1976:CFS, author = "C. T. Yu and D. T. Johnson", title = "On the complexity of finding the set of candidate keys for a given set of functional dependencies", journal = j-INFO-PROC-LETT, volume = "5", number = "4", pages = "100--101", day = "??", month = oct, year = "1976", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6120 (File organisation)", 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 = "candidate keys; complexity; computational complexity; data base; database management systems; functional dependencies", treatment = "T Theoretical or Mathematical", } @Article{Rozenberg:1976:MES, author = "G. Rozenberg", title = "More on {ET0L} systems versus random context grammars", journal = j-INFO-PROC-LETT, volume = "5", number = "4", pages = "102--106", day = "??", month = oct, year = "1976", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Math., Univ. of Antwerp, Wilrijk, Belgium", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "context-free grammars; ET0L systems; formal languages; L systems; random context grammars", treatment = "T Theoretical or Mathematical", } @Article{Samadi:1976:TSM, author = "Behrokh Samadi", title = "{$B$}-Trees in a System with Multiple Users", journal = j-INFO-PROC-LETT, volume = "5", number = "4", pages = "107--112", day = "??", month = oct, year = "1976", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C6120 (File organisation); C6150J (Operating systems)", corpsource = "Computer Sci. Dept., Stanford Univ., Stanford, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "B trees; cooperating sequential processes; data bases; data processing; deadlock; file organisation; trees (mathematics)", treatment = "T Theoretical or Mathematical", } @Article{Gabow:1976:SIB, author = "H. N. Gabow", title = "Some improved bounds on the number of $1$-factors of $n$-connected graphs", journal = j-INFO-PROC-LETT, volume = "5", number = "4", pages = "113--115", day = "??", month = oct, year = "1976", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics)", 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 = "1 factor; connectivity; graph; graph theory; matching", treatment = "T Theoretical or Mathematical", } @Article{Bochmann:1976:CMD, author = "G. V. Bochmann", title = "Comments on monitor definition and implementation", journal = j-INFO-PROC-LETT, volume = "5", number = "4", pages = "116--117", day = "??", month = oct, year = "1976", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4290 (Other computer theory); C6150J (Operating systems)", corpsource = "Dept. d'Informatique, Univ. de Montreal, Montreal, Que., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "monitor definition; monitor implementation; monitors; mutual exclusion; operating systems (computers); scheduling; synchronisation", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Boari:1976:SPD, author = "M. Boari and A. Natali", title = "Some properties of deadlock detection and recovery in readers' and writers' problems", journal = j-INFO-PROC-LETT, volume = "5", number = "4", pages = "118--123 (or 118--122??)", day = "??", month = oct, year = "1976", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory); C6150G (Diagnostic, testing, debugging and evaluating systems); C6150J (Operating systems)", corpsource = "Istituto di Automatica, Facolta di Ingegneria, Univ. di Bologna, Bologna, Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "computer operating systems; computer programming --- Subroutines; deadlock; deadlock conditions; deadlock detection and recovery; minimum cost recovery; operating systems (computers); readers' and writers' processes; state graph; system recovery", treatment = "A Application; T Theoretical or Mathematical", } @Article{Hansen:1976:ECA, author = "P. Hansen", title = "Erratum: {``A cascade algorithm for the logical closure of a set of binary relations''}", journal = j-INFO-PROC-LETT, volume = "5", number = "4", pages = "124--124", day = "??", month = oct, year = "1976", 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/infoproc1970.bib", note = "See \cite{Hansen:1976:CAL}.", acknowledgement = ack-nhfb, fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", } @Article{Delcour:1976:EAC, author = "K. Delcour and A. J. W. Duijvestein", title = "Enclosures: an access control mechanism with applications in parallel programming and other areas of system programming", journal = j-INFO-PROC-LETT, volume = "5", number = "5", pages = "125--135", day = "??", month = nov, year = "1976", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C6110 (Systems analysis and programming); C6140D (High level languages); C6150 (Systems software)", corpsource = "Philips-Electrologica BV, Apeldoorn, Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "access control mechanism; enclosures; hierarchical authorisation; monitor; parallel processing; parallel programming; problem oriented languages; programming; resource allocation; software production management; SPL; stepwise refinement; system programming; system programming languages", treatment = "P Practical", } @Article{Hennell:1976:PA, author = "M. A. Hennell and M. R. Woodward and D. Hedley", title = "On Program Analysis", journal = j-INFO-PROC-LETT, volume = "5", number = "5", pages = "136--140", day = "??", month = nov, year = "1976", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C6110 (Systems analysis and programming); C6150G (Diagnostic, testing, debugging and evaluating systems)", corpsource = "Computational Science Dept., Univ. of Liverpool, Liverpool, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "computer programming; Linear Code Sequence and Jump; program analysis; program testing", treatment = "P Practical", } @Article{Guida:1976:SPR, author = "Giovanni Guida and Marco Somalvico", title = "Semantics in Problem Representation and Search", journal = j-INFO-PROC-LETT, volume = "5", number = "5", pages = "141--145", day = "??", month = nov, year = "1976", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "921; C1160 (Combinatorial mathematics); C1230 (Artificial intelligence)", corpsource = "Istituto di Elettrotecnica ed Elettronica, Politecnico di Milano, Milan, Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "AND/OR graphs; artificial intelligence; directed graphs; heuristic programming; heuristic search; learning; mathematical techniques; problem representation; problem solving; semantics; syntax", treatment = "T Theoretical or Mathematical", } @Article{Doyle:1976:LET, author = "Jon Doyle and Ronald L. Rivest", title = "Linear Expected Time of a Simple Union-Find Algorithm", journal = j-INFO-PROC-LETT, volume = "5", number = "5", pages = "146--148", day = "??", month = nov, year = "1976", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Artificial Intelligence Lab., MIT, Cambridge, MA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "algorithm theory; analysis of algorithms; computer programming; data structures; equivalence classes; linear expected time; set merging algorithms; union find algorithms", treatment = "T Theoretical or Mathematical", } @Article{Linna:1976:DNC, author = "M. Linna", title = "The {D0L}-ness for context-free languages is decidable", journal = j-INFO-PROC-LETT, volume = "5", number = "5", pages = "149--151", day = "??", month = nov, year = "1976", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Tue Nov 17 17:40:35 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Math., Univ. of Turku, Turku, Finland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "Chomsky families; computability and decidability; context free language; context-free languages; D0L language; decidability; equivalence problem; Lindenmayer families; regular languages", treatment = "T Theoretical or Mathematical", } @Article{Duske:1976:PRI, author = "J. Duske and R. Parchmann and H. Schumacher", title = "A pattern representation of indexed languages", journal = j-INFO-PROC-LETT, volume = "5", number = "5", pages = "152--154", day = "??", month = nov, year = "1976", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C6120 (File organisation)", corpsource = "Inst. f{\"u}r Informatik, Tech. Univ. Hannover, Hannover, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "context sensitive language; context-sensitive languages; data structures; formal language; indexed languages; pattern representation", treatment = "T Theoretical or Mathematical", } @Article{Friedman:1976:ODI, author = "Daniel P. Friedman and David S. Wise", title = "Output Driven Interpretation of Recursive Programs, or Writing Creates and Destroys Data Structures", journal = j-INFO-PROC-LETT, volume = "5", number = "6", pages = "155--160", day = "??", month = dec, year = "1976", 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/infoproc1970.bib", note = "See erratum \cite{Friedman:1979:EOD}.", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory); C6150C (Compilers, interpreters and other processors)", corpsource = "Dept. of Computer Sci., Indiana Univ., Bloomington, IN, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "computer programming; data structures; interpretation; iterative code; program interpreters; programming theory; recursive programs", treatment = "T Theoretical or Mathematical", } @Article{Friedman:1976:GCH, author = "Daniel P. Friedman and David S. Wise", title = "Garbage Collecting a Heap Which Includes a Scatter Table", journal = j-INFO-PROC-LETT, volume = "5", number = "6", pages = "161--164", day = "??", month = dec, year = "1976", 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/infoproc1970.bib", note = "See erratum \cite{Friedman:1977:EGC}.", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory); C6120 (File organisation)", corpsource = "Dept. of Computer Sci., Indiana Univ., Bloomington, IN, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "computer programming; garbage collection; hash table; heap; scatter table; storage management", treatment = "T Theoretical or Mathematical", } @Article{Gabow:1976:NDC, author = "H. N. Gabow", title = "A note on degree-constrained star subgraphs of bipartite graphs", journal = j-INFO-PROC-LETT, volume = "5", number = "6", pages = "165--167", day = "??", month = dec, year = "1976", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics); 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 = "bipartite graphs; degree constrained; formal languages; graph theory; star subgraphs", treatment = "T Theoretical or Mathematical", } @Article{Mehlhorn:1976:BLR, author = "K. Mehlhorn", title = "Bracket-languages are recognizable in logarithmic space", journal = j-INFO-PROC-LETT, volume = "5", number = "6", pages = "168--170", day = "??", month = dec, year = "1976", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", 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 = "bracket language; context free languages; context-free languages; logarithmic space; recognizable", treatment = "T Theoretical or Mathematical", } @Article{Kaye:1976:GCS, author = "R. Kaye", title = "A {Gray Code} for set partitions", journal = j-INFO-PROC-LETT, volume = "5", number = "6", pages = "171--173", day = "??", month = dec, year = "1976", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Wharton School, Univ. of Pennsylvania, Pittsburgh, PA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "algorithm theory; computational complexity; Gray Code; set partitions", treatment = "T Theoretical or Mathematical", } @Article{Partsch:1976:FRR, author = "H. Partsch and P. Pepper", title = "A family of rules for recursion removal", journal = j-INFO-PROC-LETT, volume = "5", number = "6", pages = "174--177", day = "??", month = dec, year = "1976", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "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/", keywords = "family of rules; iterative solutions; program; programming theory; recursion removal; stepwise transformations; Towers of Hanoi", treatment = "T Theoretical or Mathematical", } @Article{Knuth:1977:GDA, author = "Donald E. Knuth", title = "A generalization of {Dijkstra}'s algorithm", journal = j-INFO-PROC-LETT, volume = "6", number = "1", pages = "1--5", day = "??", month = feb, 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics)", 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; generalizes; graph; graph theory; shortest paths", treatment = "T Theoretical or Mathematical", } @Article{Yuval:1977:TE, author = "G. Yuval", title = "{Theil}'s estimator", journal = j-INFO-PROC-LETT, volume = "6", number = "1", pages = "6--7", day = "??", month = feb, 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C1140 (Probability and statistics)", corpsource = "Dept. of Computer Sci., Hebrew Univ., Jerusalem, Israel", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "estimation theory; linear regression; statistics; Theil's estimator", treatment = "T Theoretical or Mathematical", } @Article{Goto:1977:PHA, author = "E. Goto and T. Ida and T. Gunji", key = "Goto \& Ida", title = "Parallel Hashing Algorithms", journal = j-INFO-PROC-LETT, volume = "6", number = "1", pages = "8--13", day = "??", month = feb, 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6120 (File organisation)", corpsource = "Inst. for Phys. and Chem. Res., Wako-shi, Saitama, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "fast pattern matching; memory accesses; parallel hashing algorithms; retrieve; software systems; storage management", treatment = "T Theoretical or Mathematical", } @Article{Deo:1977:GLG, author = "Narsingh Deo and M. S. Krishnamoorthy and Ajit B. Pai", title = "Generalizations of line graphs and applications", journal = j-INFO-PROC-LETT, volume = "6", number = "1", pages = "14--17", day = "??", month = feb, 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics)", corpsource = "Computer Centre, Indian Inst. of Technol., Kanpur, India", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "adjacency matrix; applications; general problem; graph theory; irreducible tree; line graphs; rank", treatment = "T Theoretical or Mathematical", } @Article{Chin:1977:FEE, author = "F. Chin and K. Steiglitz", title = "A fast error evaluation algorithm for polynomial approximation", journal = j-INFO-PROC-LETT, volume = "6", number = "1", pages = "18--21", day = "??", month = feb, 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "B0290B (Error analysis in numerical methods); B0290F (Interpolation and function approximation); C4110 (Error analysis in numerical methods); C4130 (Interpolation and function approximation)", 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; approximation theory; computational complexity; error analysis; error evaluation; fast; polynomial approximation; polynomials", treatment = "T Theoretical or Mathematical", } @Article{Reddi:1977:ASC, author = "S. S. Reddi", title = "Alternate solutions to the cigarette smokers' problem without conditionals", journal = j-INFO-PROC-LETT, volume = "6", number = "1", pages = "22--24", day = "??", month = feb, 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Rice Univ., Houston, TX, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "arithmetic operations; cigarette smokers' problem; Petri net; programming theory; semaphore arrays; without conditionals", treatment = "T Theoretical or Mathematical", } @Article{Rowicki:1977:NOP, author = "A. Rowicki", title = "A note on optimal preemptive scheduling for two-processor systems", journal = j-INFO-PROC-LETT, volume = "6", number = "1", pages = "25--28", day = "??", month = feb, 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory); C6150J (Operating systems)", corpsource = "Inst. of Math. Machines, Krzywickiego, Warszawa, Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "algorithm; arbitrary execution time; multiprocessing programs; optimal preemptive scheduling; scheduling; two identical processors", treatment = "T Theoretical or Mathematical", } @Article{Merret:1977:RPL, author = "T. H. Merret", title = "Relations as programming language elements", journal = j-INFO-PROC-LETT, volume = "6", number = "1", pages = "29--33", day = "??", month = feb, 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C6120 (File organisation); C6140 (Programming languages)", corpsource = "School of Computer Sci., McGill Univ., Montreal, Que., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "applications programmers; data structures; database management systems; information systems environments; primitive data structures; programming language elements; programming languages; relations", treatment = "A Application; T Theoretical or Mathematical", } @Article{Schnorr:1977:UHS, author = "C. P. Schnorr and H. Klupp", title = "A universally hard set of formulae with respect to non-deterministic {Turing} acceptors", journal = j-INFO-PROC-LETT, volume = "6", number = "2", pages = "35--37", day = "??", month = apr, 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory)", corpsource = "Fachbereich Math., Univ. Frankfurt, Frankfurt, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "addition; formulae; nondeterministic Turing acceptors; number theory; real numbers; Turing machines; universally hard set", treatment = "T Theoretical or Mathematical", } @Article{Ershov:1977:PCP, author = "A. P. Ershov", title = "On the partial computation principle", journal = j-INFO-PROC-LETT, volume = "6", number = "2", pages = "38--41", day = "??", month = apr, 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Computing Lab., Siberian Div. of the Acad. of Sci., Novosibirsk, USSR", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "mixed computation; partial computation principle; program; programming theory", treatment = "T Theoretical or Mathematical", } @Article{Zuczek:1977:USP, author = "R. Zuczek", title = "The universal space for parallel computation", journal = j-INFO-PROC-LETT, volume = "6", number = "2", pages = "42--45", day = "??", month = apr, 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "parallel computation; parallel processing; programming; programming theory; universal space", treatment = "T Theoretical or Mathematical", } @Article{Endres:1977:FOP, author = "A. Endres and H.-G. Stork", title = "{FIFO}-optimal placement on pages of independently referenced sectors", journal = j-INFO-PROC-LETT, volume = "6", number = "2", pages = "46--49", day = "??", month = apr, 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/infoproc1970.bib", 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/", keywords = "FIFO optimal placement; independently referenced sectors; pages; relocatable sectors; storage allocation", treatment = "T Theoretical or Mathematical", } @Article{Sassa:1977:VTV, author = "Masataka Sassa and Eiichi Goto", title = "``{V}-Tape'', a Virtual Memory Oriented Data Type, and its Resource Requirements", journal = j-INFO-PROC-LETT, volume = "6", number = "2", pages = "50--55", day = "??", month = apr, 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 = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory); C6120 (File organisation)", corpsource = "Dept. of Information Sci., Tokyo Inst. of Technol., Tokyo, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "automata hierarchy; automata theory; computer programming; data type; resource requirements; V-tape; virtual memory; virtual storage", treatment = "T Theoretical or Mathematical", } @Article{Banatre:1977:POC, author = "J. P. Banatre", title = "Producing optimised code for coercions", journal = j-INFO-PROC-LETT, volume = "6", number = "2", pages = "56--59", day = "??", month = apr, 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6140D (High level languages)", corpsource = "IRISA, Univ. de Rennes, Rennes, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "ALGOL; ALGOL 68; coercions; optimised code; programming theory", treatment = "T Theoretical or Mathematical", } @Article{Williams:1977:COP, author = "M. H. Williams", title = "Complete operator precedence conditions", journal = j-INFO-PROC-LETT, volume = "6", number = "2", pages = "60--62", day = "??", month = apr, 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Computer Sci., Rhodes Univ., Grahamstown, South Africa", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "complete; conditions; grammar; grammars; operator precedence; parsing", treatment = "T Theoretical or Mathematical", } @Article{Rajaraman:1977:FFB, author = "V. Rajaraman and Om Vikas", title = "A first-in-first-out buffered cyclic memory", journal = j-INFO-PROC-LETT, volume = "6", number = "2", pages = "63--68", day = "??", month = apr, 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 = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C6120 (File organisation)", corpsource = "Computer Centre, Indian Inst. of Technol., Kanpur, India", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "access discipline; buffered cyclic memory; computer operating systems; FIFO; file organisation", treatment = "P Practical", } @Article{Hikita:1977:AFP, author = "T. Hikita and E. Goto", title = "An {$ O(N) $} Algorithm for Finding Periodicity of a Sequence Using Hash Coding", journal = j-INFO-PROC-LETT, volume = "6", number = "2", pages = "69--71", day = "??", month = apr, 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Dept. of Information Sci., Univ. of Tokyo, Tokyo, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "algorithm theory; computational complexity; hash coding; O(N) algorithm; periodicity; sequence; time complexity", treatment = "T Theoretical or Mathematical", } @Article{Friedman:1977:EGC, author = "Daniel P. Friedman and David S. Wise", title = "Erratum: {``Garbage Collecting a Heap Which Includes a Scatter Table''}", journal = j-INFO-PROC-LETT, volume = "6", number = "2", pages = "72--72", day = "??", month = apr, 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/infoproc1970.bib", note = "See \cite{Friedman:1976:GCH}.", acknowledgement = ack-nhfb, fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", } @Article{Dinic:1977:NTS, author = "E. A. Dinic and A. K. Kelmans and M. A. Zaitsev", title = "Nonisomorphic trees with the same {$T$}-polynomial", journal = j-INFO-PROC-LETT, volume = "6", number = "3", pages = "73--76", day = "??", month = apr, 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics)", corpsource = "Inst. of Control Sci., Moscow, USSR", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "nonisomorphic trees; same T-polynomial; trees (mathematics)", treatment = "T Theoretical or Mathematical", } @Article{Kittler:1977:MDC, author = "J. Kittler", title = "A method for determining class subspaces", journal = j-INFO-PROC-LETT, volume = "6", number = "3", pages = "77--79", day = "??", month = apr, 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "B6140C (Optical information, image and video signal processing); C1250 (Pattern recognition)", corpsource = "Dept. of Electronics, Univ. of Southampton, Southampton, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "class subspaces; determining; pattern recognition", treatment = "T Theoretical or Mathematical", } @Article{vanEmdeBoas:1977:POF, author = "P. {van Emde Boas}", title = "Preserving order in a forest in less than logarithmic time and linear space", journal = j-INFO-PROC-LETT, volume = "6", number = "3", pages = "80--82", day = "??", month = apr, 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory); C6120 (File organisation); C6130 (Data handling techniques)", corpsource = "Univ. of Amsterdam, Amsterdam, Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "algorithm theory; data structures; forest; linear space; logarithmic time; order; set manipulation; set theory; symbol manipulation; trees (mathematics)", treatment = "T Theoretical or Mathematical", } @Article{Javor:1977:ATA, author = "A. Javor", title = "An adaptive time advancement algorithm for discrete simulation", journal = j-INFO-PROC-LETT, volume = "6", number = "3", pages = "83--86", day = "??", month = apr, 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Central Res. Inst. Phys., Hungarian Acad. of Sci., Budapest, Hungary", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "adaptive time advancement algorithm; algorithm theory; digital simulation; discrete simulation; dynamic operation; executive", treatment = "T Theoretical or Mathematical", } @Article{Wurgens:1977:CER, author = "H. W{\"u}rgens", title = "Comments on {``Error resynchronisation in producer consumer systems''}", journal = j-INFO-PROC-LETT, volume = "6", number = "3", pages = "87--90", day = "??", month = apr, 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Tech. Hochschule Darmstadt, Darmstadt, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "error resynchronisation; producer consumer systems; programming theory", treatment = "T Theoretical or Mathematical", } @Article{Lipski:1977:OMP, author = "W. {Lipski, Jr.}", title = "One more polynomial complete consecutive retrieval problem", journal = j-INFO-PROC-LETT, volume = "6", number = "3", pages = "91--93", day = "??", month = apr, 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6120 (File organisation)", corpsource = "Inst. of Computer Sci., Polish Acad. of Sci., Warsaw, Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "consecutive retrieval problem; file organisation; file organization; minimal search time; no redundant storage; polynomial complete; programming theory", treatment = "T Theoretical or Mathematical", } @Article{Kundu:1977:STN, author = "S. Kundu", title = "Sorting tree, nestling tree and inverse permutation", journal = j-INFO-PROC-LETT, volume = "6", number = "3", pages = "94--96", day = "??", month = apr, 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Logicon, San Pedro, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "binary tree; inverse permutation; nestling tree; search; sorting; sorting tree; trees (mathematics)", treatment = "T Theoretical or Mathematical", } @Article{Raiha:1977:OAS, author = "K.-J. R{\"a}ih{\"a} and M. Saarinen", title = "An optimization of the alternating semantic evaluator", journal = j-INFO-PROC-LETT, volume = "6", number = "3", pages = "97--100", day = "??", month = apr, 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C6150C (Compilers, interpreters and other processors)", corpsource = "Dept. of Computer Sci., Univ. of Helsinki, Helsinki, Finland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "alternating semantic evaluator; attribute grammars; compiler compiler; grammars; optimization; program compilers", treatment = "T Theoretical or Mathematical", } @Article{Cohen:1977:ASC, author = "J. Cohen and J. Katcoff", title = "Automatic solution of a certain class of combinatorial problems", journal = j-INFO-PROC-LETT, volume = "6", number = "4", pages = "101--104", day = "??", month = aug, 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Phys., Brandeis Univ., Waltham, MA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "automatic procedure; combinatorial problems; finite state grammar; grammars; number of strings", treatment = "T Theoretical or Mathematical", } @Article{Winkowski:1977:ACB, author = "Jozef Winkowski", title = "An algebraic characterization of the behaviour of non-sequential systems", journal = j-INFO-PROC-LETT, volume = "6", number = "4", pages = "105--109", day = "??", month = aug, year = "1977", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Tue Nov 17 17:22:44 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", note = "See also errata \cite{Winkowski:1978:EAC}.", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Inst. Podstaw Informatyki PAN, Warszawa, Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "algebraic characterization; behaviour; formal logic; nonsequential systems; Petri nets", treatment = "T Theoretical or Mathematical", } @Article{Jones:1977:NLT, author = "N. D. Jones", title = "A note on linear time simulation of deterministic two-way pushdown automata", journal = j-INFO-PROC-LETT, volume = "6", number = "4", pages = "110--112", day = "??", month = aug, 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory)", corpsource = "Dept. of Computer Sci., Univ. of Aarhus, Aarhus, Denmark", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "deterministic; deterministic automata; linear time simulation; pushdown automata; two way", treatment = "T Theoretical or Mathematical", } @Article{Turner:1977:EDR, author = "D. A. Turner", title = "Error diagnosis and recovery in one pass compilers", journal = j-INFO-PROC-LETT, volume = "6", number = "4", pages = "113--115", day = "??", month = aug, 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6150C (Compilers, interpreters and other processors); C6150G (Diagnostic, testing, debugging and evaluating systems)", corpsource = "Computer Lab., Univ. of Kent, Canterbury, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "one pass compilers; program compilers; program diagnostics; programming theory; recovery; syntax error diagnostics", treatment = "T Theoretical or Mathematical", } @Article{Talbert:1977:FSS, author = "S. H. Talbert", title = "On the formal specification of the semantics of processed information", journal = j-INFO-PROC-LETT, volume = "6", number = "4", pages = "116--119", day = "??", month = aug, 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4290 (Other computer theory)", corpsource = "Data Processing and Analysis Directorate, Urban Affairs, Min. of State, Ottawa, Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "computation theory; formal specification; processed information; semantics", treatment = "T Theoretical or Mathematical", } @Article{Kobuchi:1977:TCT, author = "Y. Kobuchi", title = "Two characterization theorems of locally catenative developmental systems", journal = j-INFO-PROC-LETT, volume = "6", number = "4", pages = "120--124", day = "??", month = aug, 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/infoproc1970.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 = "characterization theorems; developmental systems; formal logic; locally catenative; recurrence systems", treatment = "T Theoretical or Mathematical", } @Article{Brandwajn:1977:SPD, author = "A. Brandwajn and B. Mouneix", title = "A study of a page-on-demand system", journal = j-INFO-PROC-LETT, volume = "6", number = "4", pages = "125--132", day = "??", month = aug, 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation)", corpsource = "Ecole nationale Sup{\'e}rieure des Telecommunications, Paris, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "memory space; multiprogramming; page on demand; virtual storage", treatment = "T Theoretical or Mathematical", } @Article{Raghavan:1977:NMS, author = "V. V. Raghavan and C. T. Yu", title = "A note on a multidimensional searching problem", journal = j-INFO-PROC-LETT, volume = "6", number = "4", pages = "133--135", day = "??", month = aug, 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6120 (File organisation)", 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 = "multidimensional searching problem; programming theory; upper bound", treatment = "T Theoretical or Mathematical", } @Article{Gonnet:1977:ISS, author = "G. H. Gonnet and L. D. Rogers", title = "The interpolation-sequential search algorithm", journal = j-INFO-PROC-LETT, volume = "6", number = "4", pages = "136--139", day = "??", month = aug, 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6120 (File organisation)", 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/", keywords = "interpolation sequential search algorithm; key value; ordered tables; programming theory", treatment = "T Theoretical or Mathematical", } @Article{Shaw:1977:SGA, author = "M. Shaw and J. F. Traub", title = "Selection of good algorithms from a family of algorithms for polynomial derivative evaluation", journal = j-INFO-PROC-LETT, volume = "6", number = "5", pages = "141--145", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4140 (Linear algebra); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Computer Sci., Carnegie-Mellon Univ., PA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "algorithm theory; digital arithmetic; divisions; family of algorithms; good algorithms; multiplications; polynomial derivative evaluation; polynomials", treatment = "T Theoretical or Mathematical", } @Article{Lukaszewicz:1977:FG, author = "L. {\L}ukaszewicz", title = "Functional grammars", journal = j-INFO-PROC-LETT, volume = "6", number = "5", pages = "146--150", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Inst. of Computer Sci., Polish Acad. of Sci., Warszawa, Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "context free grammars; context-free grammars; functional grammars; programming language definitions", treatment = "T Theoretical or Mathematical", } @Article{Collins:1977:APS, author = "George E. Collins and David R. Musser", title = "Analysis of the {Pope--Stein} Division Algorithm", journal = j-INFO-PROC-LETT, volume = "6", number = "5", pages = "151--155", day = "??", month = oct, year = "1977", CODEN = "IFPLAT", DOI = "https://doi.org/10.1016/0020-0190(77)90012-6", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip; https://www.math.utah.edu/pub/tex/bib/fparith.bib; https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nj # " and " # ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Computer Sci. Dept., Univ. of Wisconsin, Madison, WI, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "algorithm; algorithm theory; digital arithmetic; integer division; multiple precision integer division; trial quotient digits", treatment = "T Theoretical or Mathematical", } @Article{Grant:1977:NVR, author = "J. Grant", key = "Grant", title = "Null Values in a Relational Data Base", journal = j-INFO-PROC-LETT, volume = "6", number = "5", pages = "156--157", 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/infoproc1970.bib", abstract = "none", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6120 (File organisation)", corpsource = "Computer and Information Sci., Univ. of Florida, Gainesville, FL, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "file organisation; Information systems, relational data base; null values; relational data base; retrieval; sublanguage; update", owner = "curtis", 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/infoproc1970.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{Blazewicz:1977:SAM, author = "J. B{\l}azewicz", title = "Simple algorithms for multiprocessor scheduling to meet deadlines", journal = j-INFO-PROC-LETT, volume = "6", number = "5", pages = "162--164", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Inst. of Control Engng., Tech. Univ. of Poznan, Poznan, Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "algorithms; deadlines; dependent preemptable tasks; independent unit length tasks; multiprocessing systems; multiprocessor scheduling; polynomial time; scheduling", treatment = "T Theoretical or Mathematical", } @Article{Matwin:1977:CST, author = "S. Matwin", title = "On the completeness of a set of transformations optimizing linear programs", journal = j-INFO-PROC-LETT, volume = "6", number = "5", pages = "165--167", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "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 = "completeness; language; linear programs; optimizing; programming theory; transformations", treatment = "T Theoretical or Mathematical", } @Article{Bird:1977:TDP, author = "R. S. Bird", title = "Two dimensional pattern matching", journal = j-INFO-PROC-LETT, volume = "6", number = "5", pages = "168--170", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6130 (Data handling techniques)", corpsource = "Dept. of Computer Sci., Univ. of Reading, Reading, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "pattern matching; pattern recognition; string matching; text editing; two dimensional", treatment = "T Theoretical or Mathematical", } @Article{Cahit:1977:RGP, author = "I. Cahit", title = "Realization of graceful permutation by a shuffle-exchange network", journal = j-INFO-PROC-LETT, volume = "6", number = "5", pages = "171--173", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Turkish Telecommunications, Nicosia, Cyprus", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "algorithm theory; array computer; graceful permutation; number theory; shuffle exchange network", treatment = "T Theoretical or Mathematical", } @Article{Grant:1977:REL, author = "P. W. Grant", title = "Recognition of {E0L} languages in less than quatric time", journal = j-INFO-PROC-LETT, volume = "6", number = "5", pages = "174--176 (or 174--175??)", 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/infoproc1970.bib", note = "See addendum \cite{Grant:1977:ARE}.", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Computer Sci., Univ. Coll. of Swansea, Swansea, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "computational complexity; context free language; context-free languages; EOL languages; parallel; quartic time", treatment = "T Theoretical or Mathematical", } @Article{Matwin:1977:EIG, author = "S. Matwin", title = "An experimental investigation of {Geschke}'s method of global program optimization", journal = j-INFO-PROC-LETT, volume = "6", number = "6", pages = "177--179", day = "??", month = dec, 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "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 = "experimental investigation; Geschke's method; global program optimization; programming theory; storage economy", treatment = "T Theoretical or Mathematical", } @Article{Steckelberg:1977:RBA, author = "J. M. Steckelberg and S. C. Seth", title = "On a relation between algebraic programs and {Turing} machines", journal = j-INFO-PROC-LETT, volume = "6", number = "6", pages = "180--183", day = "??", month = dec, 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "Oxford Univ., Oxford, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "algebraic programs; equivalent; formalization; programming theory; relation; Turing machines", treatment = "T Theoretical or Mathematical", } @Article{Selkow:1977:TTE, author = "S. M. Selkow", title = "The tree-to-tree editing problem", journal = j-INFO-PROC-LETT, volume = "6", number = "6", pages = "184--186", day = "??", month = dec, 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics)", corpsource = "Dept. of Computer Sci., Univ. of Tennessee, Knoxville, TN, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "labelled ordered tree; minimum sequence; tree to tree editing; trees (mathematics)", treatment = "T Theoretical or Mathematical", } @Article{Madsen:1977:EFD, author = "J. Madsen", title = "An experiment in formal definition of operating system facilities", journal = j-INFO-PROC-LETT, volume = "6", number = "6", pages = "187--189", day = "??", month = dec, 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6150J (Operating systems)", corpsource = "Dept. of Computer Sci., Tech. Univ. of Denmark, Lyngby, Denmark", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "catalogue management; operating systems (computers)", treatment = "T Theoretical or Mathematical", } @Article{Albert:1977:CCF, author = "J. Albert and H. A. Maurer", title = "The class of context-free languages is not an {E0L} family", journal = j-INFO-PROC-LETT, volume = "6", number = "6", pages = "190--195", day = "??", month = dec, 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "nst. 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 = "context free languages; context-free languages; EOL family", treatment = "T Theoretical or Mathematical", } @Article{Francez:1977:CFP, author = "N. Francez", title = "A case for a forward predicate transformer", journal = j-INFO-PROC-LETT, volume = "6", number = "6", pages = "196--198", day = "??", month = dec, 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Computer Sci., Queen's Univ. of Belfast, Belfast, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "formal languages; forward predicate transformer; program specification", treatment = "T Theoretical or Mathematical", } @Article{Gavril:1977:TEB, author = "Fanica Gavril", title = "Testing for equality between maximum matching and minimum node covering", journal = j-INFO-PROC-LETT, volume = "6", number = "6", pages = "199--202", day = "??", month = dec, 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics)", corpsource = "Computer Sci. Dept., Tel-Aviv Univ., Tel-Aviv, Israel", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "equality; finite undirected graphs; graph theory; maximum matching; minimum node covering", treatment = "T Theoretical or Mathematical", } @Article{Herschberg:1977:CFA, author = "I. S. Herschberg and J. C. A. Boekhorst", title = "Concurrent file access under unpredictability", journal = j-INFO-PROC-LETT, volume = "6", number = "6", pages = "203--208", day = "??", month = dec, 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6120 (File organisation)", corpsource = "Organisation Div., Unilever NV, Rotterdam, Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "consistency; correctness proof; file access; multiprocessing; parallel processing; storage allocation; transaction processing; unpredictability", treatment = "T Theoretical or Mathematical", } @Article{Bentley:1977:CFF, author = "Jon L. Bentley and Donald F. Stanat and E. Hollins {Williams, Jr.}", title = "The complexity of finding fixed-radius near neighbors", journal = j-INFO-PROC-LETT, volume = "6", number = "6", pages = "209--212", day = "??", month = dec, 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", 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 = "complexity; computational complexity; fixed radius near neighbours problem", treatment = "T Theoretical or Mathematical", } @Article{Sudborough:1977:NWO, author = "I. H. Sudborough", title = "A note on weak operator precedence grammars", journal = j-INFO-PROC-LETT, volume = "6", number = "6", pages = "213--218", day = "??", month = dec, 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Computer Sci., Technol. Inst., Northwestern Univ., Evanston, IL, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "grammars; parsing; programming languages; weak operator precedence grammars", treatment = "T Theoretical or Mathematical", } @Article{Perl:1977:UCI, author = "Yehoshua Perl and Edward M. Reingold", title = "Understanding the complexity of interpolation search", journal = j-INFO-PROC-LETT, volume = "6", number = "6", pages = "219--222", day = "??", month = dec, 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6120 (File organisation)", corpsource = "Dept. of Math. and Computer Sci., Bar-Ilan Univ., Ramat Gan, Israel", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "binary search; complexity; computational complexity; file organisation; interpolation search; quadratic", treatment = "T Theoretical or Mathematical", } @Article{Ramshaw:1977:BCN, author = "Lyle Ramshaw", title = "Binomial coefficients with non-integral lower index", journal = j-INFO-PROC-LETT, volume = "6", number = "6", pages = "223--226", day = "??", month = dec, year = "1977", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Tue Nov 17 17:19:41 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics)", corpsource = "Computer Sci. Dept., Stanford Univ., Stanford, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "binomial coefficients; combinatorial mathematics; generalization; nonintegral lower index", treatment = "T Theoretical or Mathematical", } @Article{Grant:1977:ARE, author = "P. W. Grant", title = "Addendum: {``Recognition of E0L languages in less than quatric time''}", journal = j-INFO-PROC-LETT, volume = "6", number = "6", pages = "228--228", day = "??", month = dec, year = "1977", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Tue Nov 17 17:19:41 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", note = "See \cite{Grant:1977:REL}.", acknowledgement = ack-nhfb, fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", } @Article{Dobosiewicz:1978:SDP, author = "W{\l}odzimierz Dobosiewicz", title = "Sorting by Distributive Partitioning", journal = j-INFO-PROC-LETT, volume = "7", number = "1", pages = "1--6", day = "12", month = jan, year = "1978", CODEN = "IFPLAT", DOI = "https://doi.org/10.1016/0020-0190(78)90028-5", 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/infoproc1970.bib", note = "See debate \cite{Burton:1978:CSD,Huits:1979:PSD,Dobosiewicz:1979:PSD,Jackowski:1979:CSD,Noga:1987:SPD}.", URL = "https://www.sciencedirect.com/science/article/abs/pii/0020019078900285", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory); 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 = "computational complexity; computer systems programming; distributive partitioning; programming theory; sorting; time complexity", treatment = "T Theoretical or Mathematical", } @Article{Dolev:1978:CRS, author = "Danny Dolev and Eliahu Shamir", title = "Commutation Relations of Slices Characterize Some Synchronization Primitives", journal = j-INFO-PROC-LETT, volume = "7", number = "1", pages = "7--9", day = "12", month = jan, year = "1978", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68B20", MRnumber = "80k:68013", bibdate = "Tue Nov 17 17:41:29 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory)", corpsource = "Dept. of Math., Weizmann Inst. of Sci., Rehovot, Israel", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "commutation relations; generating sets; parallel processing; PV-multiple; slices; synchronization primitives; VAS; VRS", treatment = "T Theoretical or Mathematical", } @Article{Camerini:1978:MMS, author = "P. M. Camerini", title = "The Min-Max Spanning Tree Problem and Some Extensions", journal = j-INFO-PROC-LETT, volume = "7", number = "1", pages = "10--14", day = "12", month = jan, year = "1978", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics)", 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 = "complexity; computational complexity; min max spanning tree; trees (mathematics); undirected edge weighted graph", treatment = "T Theoretical or Mathematical", } @Article{Karayiannis:1978:CDC, author = "Andreas Karayiannis and Georghios Loizou", title = "Cycle Detection in Critical Path Networks", journal = j-INFO-PROC-LETT, volume = "7", number = "1", pages = "15--19", day = "12", month = jan, year = "1978", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C1160 (Combinatorial mathematics); C1290F (Systems theory applications in industry)", corpsource = "Dept. of Computer Sci., Univ. of London, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "algorithm; computer programming --- Subroutines; critical path analysis; critical path networks; data processing; detecting; elementary cycles; iterative", treatment = "T Theoretical or Mathematical", } @Article{Tsur:1978:AQN, author = "Shalom Tsur", title = "Analysis of Queuing Networks in Which Processes Exhibit Locality-Transition Behaviour", journal = j-INFO-PROC-LETT, volume = "7", number = "1", pages = "20--23", day = "12", month = jan, year = "1978", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C1140C (Queueing theory); C4240 (Programming and algorithm theory)", corpsource = "Computer Lab., Univ. of Newcastle upon Tyne, Newcastle upon Tyne, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "locality transition behaviour; model; multiprogramming; paging; queueing networks; queueing theory", treatment = "T Theoretical or Mathematical", } @Article{Crespi-Reghizzi:1978:CGG, author = "Stefano Crespi-Reghizzi and Dino Mandrioli", title = "A Class of Grammar Generating Non-Counting Languages", journal = j-INFO-PROC-LETT, volume = "7", number = "1", pages = "24--26", day = "12", month = jan, year = "1978", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Istituto Scienze Informazione, Univ. di Pisa, Pisa, Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "context-free languages; free grammars; generating; grammar; noncounting languages; regular languages", treatment = "T Theoretical or Mathematical", } @Article{Terashima:1978:GOC, author = "Motoaki Terashima and Eiichi Goto", title = "Genetic order and compactifying garbage collectors", journal = j-INFO-PROC-LETT, volume = "7", number = "1", pages = "27--32", day = "12", month = jan, year = "1978", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Tue Nov 17 17:41:55 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6120 (File organisation); C6130 (Data handling techniques)", corpsource = "Dept. of Information Sci., Univ. of Tokyo, Tokyo, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "compactifying garbage collectors; data structures; genetic order; list processing; list structures; storage management", treatment = "T Theoretical or Mathematical", } @Article{Culik:1978:DLC, author = "Karel {Culik, II}", title = "The Decidability of $ \nu $-Local Catenativity and of Other Properties of {D0L} systems", journal = j-INFO-PROC-LETT, volume = "7", number = "1", pages = "33--35", day = "12", month = jan, year = "1978", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", 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 = "computability and decidability; D0L systems; decidability; formal languages; nu-local catenativity", treatment = "T Theoretical or Mathematical", xxtitle = "The Decidability of $\nu$-Local Catenativity and of Other Properties of {DOL} systems", } @Article{Howden:1978:LGS, author = "W. E. Howden", title = "{Lindenmayer} Grammars and Symbolic Testing", journal = j-INFO-PROC-LETT, volume = "7", number = "1", pages = "36--39", day = "12", month = jan, year = "1978", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Math., Univ. of Victoria, Victoria, BC, Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "formal grammars; formal languages; Lindenmayer grammars; program testing; programs; string generation mechanism; symbolic testing", treatment = "T Theoretical or Mathematical", } @Article{Hirschberg:1978:ITL, author = "D. S. Hirschberg", title = "An Information-Theoretic Lower Bound for the Longest Common Subsequence Problem", journal = j-INFO-PROC-LETT, volume = "7", number = "1", pages = "40--41", day = "12", month = jan, year = "1978", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Rice Univ., Houston, TX, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "algorithm theory; complexity; computational complexity; longest common subsequence problem; lower bound", treatment = "T Theoretical or Mathematical", } @Article{Bergstra:1978:WAD, author = "Jan Bergstra", title = "What is an abstract data type?", journal = j-INFO-PROC-LETT, volume = "7", number = "1", pages = "42--43", day = "12", month = jan, year = "1978", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", 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 = "abstract datatype; implementability; operational; programming theory", treatment = "T Theoretical or Mathematical", } @Article{Rohlf:1978:PMS, author = "F. James Rohlf", title = "A Probabilistic Minimum Spanning Tree Algorithm", journal = j-INFO-PROC-LETT, volume = "7", number = "1", pages = "44--48", day = "12", month = jan, year = "1978", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics)", corpsource = "IBM Watson Res. Center, Yorktown Heights, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "algorithm; minimum spanning tree; probabilistic; trees (mathematics)", treatment = "T Theoretical or Mathematical", } @Article{Inoue:1978:NTF, author = "Katsushi Inoue and Itsuo Takanami and Akira Nakamura", title = "A Note on Two-Dimensional Finite Automata", journal = j-INFO-PROC-LETT, volume = "7", number = "1", pages = "49--52", day = "12", month = jan, year = "1978", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory)", corpsource = "Dept. of Electronic Engng., Yamaguchi Univ., Ube, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "computability and decidability; deterministic; finite automata; nondeterministic; two dimensional; undecidable", treatment = "T Theoretical or Mathematical", } @Article{Anderson:1978:REA, author = "Kenneth R. Anderson", title = "A Reevaluation of an Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set", journal = j-INFO-PROC-LETT, volume = "7", number = "1", pages = "53--55", day = "12", month = jan, year = "1978", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C05", MRnumber = "81e:68030", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. Earth and Planetary Sci., MIT, Cambridge, MA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "algorithm; algorithm theory; convex hull; evaluation; finite planar set; set theory", treatment = "T Theoretical or Mathematical", } @Article{Koplowitz:1978:MEC, author = "J. Koplowitz and D. Jouppi", title = "A More Efficient Convex Hull Algorithm", journal = j-INFO-PROC-LETT, volume = "7", number = "1", pages = "56--57", day = "12", month = jan, year = "1978", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C05", MRnumber = "81e:68031", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Clarkson Coll. of Technol., Potsdam, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "algorithm; algorithm theory; convex hull; efficient; finite planar set; iterations; set theory", treatment = "T Theoretical or Mathematical", } @Article{deChampeaux:1978:SFS, author = "Dennis {de Champeaux}", title = "{SUBSTAD}: For Fast Substitution in {LISP}, With an Application on Unification", journal = j-INFO-PROC-LETT, volume = "7", number = "1", pages = "58--62", day = "12", month = jan, year = "1978", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory); C6140D (High level languages)", corpsource = "Bedrijfsinformatica, Univ. of Amsterdam, Amsterdam, Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "algorithm theory; computer programming; fast substitution; LISP; SUBSTAD; unification algorithm", treatment = "T Theoretical or Mathematical", } @Article{Winkowski:1978:EAC, author = "J. Winkowski", title = "Erratum: {``An algebraic characterization of the behaviour of non-sequential systems''}", journal = j-INFO-PROC-LETT, volume = "7", number = "1", pages = "63--63", day = "12", month = jan, year = "1978", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Tue Jan 09 17:59:43 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", note = "See \cite{Winkowski:1977:ACB}.", acknowledgement = ack-nhfb, fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", } @Article{Anonymous:1978:TR, author = "Anonymous", title = "A tribute to referees", journal = j-INFO-PROC-LETT, volume = "7", number = "1", pages = "64--64", day = "12", month = jan, year = "1978", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 11:49:17 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", } @Article{McColl:1978:MDM, author = "W. F. McColl", title = "The maximum depth of monotone formulae", journal = j-INFO-PROC-LETT, volume = "7", number = "2", pages = "65--??", day = "28", month = feb, year = "1978", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Computer Sci. Dept., Strathclyde Univ., Glasgow, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "Boolean function; Boolean functions; maximum depth; monotone circuits; monotone formulae", treatment = "T Theoretical or Mathematical", } @Article{Kambayashi:1978:LSS, author = "Yahiko Kambayashi and Takaki Hayashi and Yoshikazu Tanaka and Shuzo Yajima", title = "A linear storage space algorithm for a reference structure index", journal = j-INFO-PROC-LETT, volume = "7", number = "2", pages = "66--71", day = "28", month = feb, year = "1978", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; 901; C7240 (Information analysis and indexing)", corpsource = "Dept. of Information Sci., Faculty of Engng., Kyoto Univ., Sakyo, Kyoto, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "indexing; information analysis; information science; linear storage space algorithm; reference citation structures; reference structure index; RS index", treatment = "G General Review; T Theoretical or Mathematical", } @Article{Sethi:1978:ECC, author = "A. S. Sethi and V. Rajaraman and P. S. Kenjale", title = "An error-correcting coding scheme for alphanumeric data", journal = j-INFO-PROC-LETT, volume = "7", number = "2", pages = "72--77", day = "28", month = feb, year = "1978", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C6130 (Data handling techniques)", corpsource = "Computer Centre, Indian Inst. of Technol., Kanpur, India", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "alphanumeric codes; alphanumeric data; check digits; codes, symbolic; coding scheme; data acquisition; data preparation; error correcting coding scheme; error correction codes; error detection; transcription errors; transposition errors; weighted scheme", treatment = "T Theoretical or Mathematical", } @Article{Brandwajn:1978:ASR, author = "A. Brandwajn and Ph. Kruchten and J. A. Hernandez", title = "{ARCADE}: a system for research and education in computer architecture", journal = j-INFO-PROC-LETT, volume = "7", number = "2", pages = "78--85", day = "28", month = feb, year = "1978", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C5220 (Computer architecture); C6150J (Operating systems)", corpsource = "Ecole Nat. Sup{\'e}rieure des Telecommunications, Paris, France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "ARCADE; computer architecture; operating system design; operating systems (computers); performance evaluation", } @Article{Akl:1978:CGM, author = "S. G. Akl", title = "Comments on: {G. Manacher}, {``An application of pattern matching to a problem in geometrical complexity''}", journal = j-INFO-PROC-LETT, volume = "7", number = "2", pages = "86--??", day = "28", month = feb, year = "1978", 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/infoproc1970.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 = "computational complexity; geometrical complexity; pattern matching; polygon comparison", treatment = "T Theoretical or Mathematical", } @Article{Bentley:1978:DCL, author = "J. L. Bentley and M. I. Shamos", title = "Divide and conquer for linear expected time", journal = j-INFO-PROC-LETT, volume = "7", number = "2", pages = "87--91", day = "28", month = feb, year = "1978", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Computer Sci. and Math., Carnegie-Mellon Univ., Pittsburgh, PA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "algorithm theory; average time analysis; case time; computational complexity; convex hull algorithm; divide and conquer technique; fast algorithms; geometry; linear expected time; topology", treatment = "T Theoretical or Mathematical", } @Article{Peltola:1978:IMS, author = "Eero Peltola and Hannu Erki{\"o}", title = "Insertion Merge Sorting", journal = j-INFO-PROC-LETT, volume = "7", number = "2", pages = "92--99", day = "28", month = feb, year = "1978", 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/infoproc1970.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 = "algorithm theory; computer systems programming; insertion; insertion merge sort algorithms; internal sorting algorithms; merging; sorting; working space", treatment = "T Theoretical or Mathematical", } @Article{Paun:1978:GCS, author = "G. P{\u{a}}un", title = "On the generative capacity of simple matrix grammars of finite index", journal = j-INFO-PROC-LETT, volume = "7", number = "2", pages = "100--102", day = "28", month = feb, year = "1978", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Univ. of Bucharest, Div. of Systems Studies, Bucuresti, Romania", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "finite index; formal languages; generative capacity; grammars; matrix grammars", treatment = "T Theoretical or Mathematical", } @Article{Samet:1978:CFA, author = "H. Samet", title = "A canonical form algorithm for proving equivalence of conditional forms", journal = j-INFO-PROC-LETT, volume = "7", number = "2", pages = "103--106", day = "28", month = feb, year = "1978", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "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/", keywords = "algorithm theory; canonical form; conditional forms; equivalence; generalised Boolean form; propositional form", treatment = "T Theoretical or Mathematical", } @Article{Paredaens:1978:EPR, author = "J. Paredaens", title = "On the expressive power of the relational algebra", journal = j-INFO-PROC-LETT, volume = "7", number = "2", pages = "107--111", day = "28", month = feb, year = "1978", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C1110 (Algebra); C4210 (Formal logic); C6120 (File organisation)", corpsource = "MBLE Res. Lab., Brussels, Belgium", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "algebra; database management systems; expressibility; expressive power; formal languages; query languages; relational algebra; relational data base; relations", treatment = "T Theoretical or Mathematical", } @Article{Boari:1978:MAT, author = "M. Boari and A. Natali", title = "Multiple access to a tree in the context of readers and writers problem", journal = j-INFO-PROC-LETT, volume = "7", number = "2", pages = "112--121", day = "28", month = feb, year = "1978", 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/infoproc1970.bib", note = "See erratum \cite{Boari:1978:EMA}.", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory); C6120 (File organisation)", corpsource = "Istituto di Automatica, Facolta di Ingegneria, Univ. di Bologna, Bologna, Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "database integrity; database management systems; deadlock; hierarchically organized; readers and writers problem; scheduling; shared database; tree structured resources; trees (mathematics)", treatment = "T Theoretical or Mathematical", } @Article{Caviness:1978:NCA, author = "B. F. Caviness and H. I. Epstein", title = "A note on the complexity of algebraic differentiation", journal = j-INFO-PROC-LETT, volume = "7", number = "2", pages = "122--124", day = "28", month = feb, year = "1978", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "12-04 (68C25)", MRnumber = "81e:12001", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4160 (Numerical integration and differentiation); C4240 (Programming and algorithm theory)", corpsource = "Math. Sci. Dept., Rennsselaer Polytech. Inst., Troy, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "algebraic differentiation; complexity; computational complexity; differential equations; differentiation; Wronskians", treatment = "T Theoretical or Mathematical", } @Article{Cheston:1978:CUC, author = "G. A. Cheston", title = "A correction to a unilaterally connected components algorithm", journal = j-INFO-PROC-LETT, volume = "7", number = "2", pages = "125--??", day = "28", month = feb, year = "1978", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Computational Sci., Univ. of Saskatchewan, Saskatoon, Sask., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "acyclic graph; computational complexity; digraph; directed graphs; directed paths; transitive reduction; unilaterally connected components algorithm", treatment = "T Theoretical or Mathematical", } @Article{Akl:1978:IAC, author = "S. G. Akl and G. T. Toussaint", title = "An improved algorithm to check for polygon similarity", journal = j-INFO-PROC-LETT, volume = "7", number = "3", pages = "127--128", day = "28", month = apr, year = "1978", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Tue Nov 17 18:44:16 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", note = "See addendum \cite{Akl:1979:AIA}.", acknowledgement = ack-nhfb, classification = "B6140C (Optical information, image and video signal processing); C1250 (Pattern recognition)", corpsource = "School of Computer Sci., McGill Univ., Montreal, Que., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "affine transformations; check; dilatation; geometrical complexity; improved algorithm; pattern recognition; polygon similarity; rotation; time; translation", treatment = "T Theoretical or Mathematical", } @Article{Istrail:1978:TSG, author = "S. Istrail", title = "Tag systems generating {Thue} irreducible sequences", journal = j-INFO-PROC-LETT, volume = "7", number = "3", pages = "129--131", day = "28", month = apr, year = "1978", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic)", corpsource = "Univ. Al.I. Cuza Computer Center, Iasi, Romania", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "finite alphabet; finite sequence; formal languages; Tag systems; Thue irreducible sequences", treatment = "T Theoretical or Mathematical", } @Article{Arora:1978:ODP, author = "Radha Krishan Arora and R. K. Subramanian", title = "An optimal demand prepaging algorithm", journal = j-INFO-PROC-LETT, volume = "7", number = "3", pages = "132--136", day = "28", month = apr, year = "1978", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory); C6120 (File organisation)", 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; memory capacity; ODPP; optimal demand prepaging algorithm; page faults; page pulls; page trace; virtual storage", treatment = "T Theoretical or Mathematical", } @Article{Hansen:1978:PAO, author = "W. J. Hansen", title = "A predecessor algorithm for ordered lists", journal = j-INFO-PROC-LETT, volume = "7", number = "3", pages = "137--138", day = "28", month = apr, year = "1978", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation); C6130 (Data handling techniques)", 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 = "data structures; list processing; ordered lists; predecessor algorithm", treatment = "T Theoretical or Mathematical", } @Article{Allison:1978:PSN, author = "L. Allison", title = "Phrase structures, non-determinism and backtracking", journal = j-INFO-PROC-LETT, volume = "7", number = "3", pages = "139--143", day = "28", month = apr, year = "1978", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", 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 = "backtracking; nondeterministic programming; phrase structures; programming theory", treatment = "T Theoretical or Mathematical", } @Article{Huet:1978:AGB, author = "G. Huet", title = "An algorithm to generate the basis of solutions to homogeneous linear {Diophantine} equations", journal = j-INFO-PROC-LETT, volume = "7", number = "3", pages = "144--147 (or 144--146??)", day = "28", month = apr, year = "1978", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C1110 (Algebra); C1160 (Combinatorial mathematics)", corpsource = "IRIA-Laboria, Delft, Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "algorithm; group theory; homogeneous linear Diophantine equations; symbol manipulation; symbolic computation; theorem proving; unification algorithms", treatment = "T Theoretical or Mathematical", } @Article{Preparata:1978:IPP, author = "F. P. Preparata and D. V. Sarwate", title = "An Improved Parallel Processor Bound in Fast Matrix Inversion", journal = j-INFO-PROC-LETT, volume = "7", number = "3", pages = "148--150", day = "28", month = apr, year = "1978", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4140 (Linear algebra)", corpsource = "Coordinated Sci. Lab., Univ. of Illinois, Urbana, IL, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "fast matrix inversion; matrix algebra; parallel processing; parallel processor bound", treatment = "T Theoretical or Mathematical", } @Article{Sokolowski:1978:MPP, author = "S. Sokolowski", title = "A method for proving programming languages non context-free", journal = j-INFO-PROC-LETT, volume = "7", number = "3", pages = "151--153", day = "28", month = apr, year = "1978", 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/infoproc1970.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 = "context independence; criterion; formal languages; programming languages; proving", treatment = "T Theoretical or Mathematical", } @Article{Illies:1978:CGA, author = "N. Illies", title = "A counterexample to the generalized {Aanderaa-Rosenberg} conjecture", journal = j-INFO-PROC-LETT, volume = "7", number = "3", pages = "154--155", day = "28", month = apr, year = "1978", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics)", corpsource = "Fakult{\"a}t f{\"u}r Math., Univ. of Bielefeld, Bielefeld, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "decision tree; generalised Aanderaa Rosenberg conjecture; trees (mathematics)", treatment = "T Theoretical or Mathematical", } @Article{Devillers:1978:GMA, author = "R. E. Devillers and P. E. Lauer", title = "A general mechanism for avoiding starvation with distributed control", journal = j-INFO-PROC-LETT, volume = "7", number = "3", pages = "156--158", day = "28", month = apr, year = "1978", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Lab. d'Informatique Theorique, Univ. Libre de Bruxelles, Brussels, Belgium", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "allowance counter; avoiding starvation; distributed control; general mechanism; neighbouring relationship; parallel processing; parallel programs", treatment = "T Theoretical or Mathematical", } @Article{Reiser:1978:LSA, author = "A. Reiser", title = "A linear selection algorithm for sets of elements with weights", journal = j-INFO-PROC-LETT, volume = "7", number = "3", pages = "159--162", day = "28", month = apr, year = "1978", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics)", 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 = "linear selection algorithm; set theory; sets of elements with weights", treatment = "T Theoretical or Mathematical", } @Article{Gonnet:1978:NDA, author = "G. H. Gonnet", title = "Notes on the derivation of asymptotic expressions from summations", journal = j-INFO-PROC-LETT, volume = "7", number = "4", pages = "165--169", day = "??", month = jun, year = "1978", 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/infoproc1970.bib", note = "See erratum \cite{Gonnet:1979:END}.", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "PUC, Rio de Janeiro, Brazil", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "algorithm theory; asymptotic behaviour; asymptotic expressions; derivation; functional equations; summations", treatment = "T Theoretical or Mathematical", } @Article{Engelfriet:1978:TTP, author = "Joost Engelfriet", title = "On tree transducers for partial functions", journal = j-INFO-PROC-LETT, volume = "7", number = "4", pages = "170--172", day = "??", month = jun, year = "1978", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68F10 (68D35)", MRnumber = "81f:68091", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory)", corpsource = "Dept. of Appl. Math., Twente Univ. of Technol., Enschede, Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "deterministic; deterministic automata; generalised bimachine; partial functions; regular look ahead; top down; tree transducers", treatment = "T Theoretical or Mathematical", } @Article{Selkow:1978:NBC, author = "S. M. Selkow", title = "New bounds for the clique number of a graph", journal = j-INFO-PROC-LETT, volume = "7", number = "4", pages = "173--174", day = "??", month = jun, year = "1978", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics)", corpsource = "Computer Sci. Dept., Univ. of Tennessee, Knoxville, TN, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "clique number; graph; graph theory; NP-complete problems; upper bound", treatment = "T Theoretical or Mathematical", } @Article{Garey:1978:TSP, author = "M. R. Garey and D. S. Johnson and F. P. Preparata and R. E. Tarjan", title = "Triangulating a Simple Polygon", journal = j-INFO-PROC-LETT, volume = "7", number = "4", pages = "175--179", day = "??", month = jun, year = "1978", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4130 (Interpolation and function approximation); C4290 (Other computer theory)", corpsource = "Bell Labs., Murray Hill, NJ, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "closest point problems; geometry; interpolation; simple polygon; triangulating", treatment = "T Theoretical or Mathematical", } @Article{Schachtel:1978:NAM, author = "G. Schachtel", title = "A noncommutative algorithm for multiplying $ 5 \times 5 $ matrices using $ 103 $ multiplications", journal = j-INFO-PROC-LETT, volume = "7", number = "4", pages = "180--182", day = "??", month = jun, year = "1978", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4140 (Linear algebra)", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "103 multiplications; 5 x 5 matrices; matrix algebra; multiplying; noncommutative algorithm", treatment = "T Theoretical or Mathematical", } @Article{Bongiovanni:1978:CRG, author = "G. Bongiovanni and F. Luccio", title = "On {Cahit}'s result on graceful permutations", journal = j-INFO-PROC-LETT, volume = "7", number = "4", pages = "183--184", day = "??", month = jun, year = "1978", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation)", corpsource = "Univ. of Pisa, Pisa, Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "algorithm; cellular arrays; graceful permutations; integers; shuffle exchange network; storage allocation", treatment = "T Theoretical or Mathematical", xxtitle = "On {Cahit}'s result of graceful permutations", } @Article{Lipton:1978:BMC, author = "Richard J. Lipton and Raymond E. Miller", title = "A batching method for coloring planar graphs", journal = j-INFO-PROC-LETT, volume = "7", number = "4", pages = "185--188", day = "??", month = jun, year = "1978", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C05 (05C15 68E10)", MRnumber = "80d:68041", MRreviewer = "D. Ya. Kesel{\cprime}man", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics)", 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 = "5 colouring; algorithm; batching method; graph colouring; planar graphs", treatment = "T Theoretical or Mathematical", } @Article{Lee:1978:ANN, author = "D. T. Lee and F. P. Preparata", title = "The all nearest-neighbor problem for convex polygons", journal = j-INFO-PROC-LETT, volume = "7", number = "4", pages = "189--192", day = "??", month = jun, year = "1978", 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/infoproc1970.bib", note = "See \cite{Yang:1979:NAN,Fournier:1979:CAN}.", acknowledgement = ack-nhfb, classification = "C4290 (Other computer 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 = "all nearest neighbour problem; computational complexity; convex polygons; Euclidean plane; geometry; linear time algorithm; multiplicative constant", treatment = "T Theoretical or Mathematical", xxtitle = "The all nearest-neighbour problem for convex polygons", } @Article{DeMillo:1978:PRA, author = "R. A. DeMillo and R. J. Lipton", title = "A probabilistic remark on algebraic program testing", journal = j-INFO-PROC-LETT, volume = "7", number = "4", pages = "193--195", day = "??", month = jun, year = "1978", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", 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 = "algebraic program testing; probabilistic; program testing", treatment = "T Theoretical or Mathematical", } @Article{Jaffe:1978:CPC, author = "J. Jaffe", title = "Counting productions in context-free derivations", journal = j-INFO-PROC-LETT, volume = "7", number = "4", pages = "196--200", day = "??", month = jun, year = "1978", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Lab. for Computer Sci., Cambridge, MA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "context free languages; context-free languages; derivation trees; letter counts; words", treatment = "T Theoretical or Mathematical", } @Article{Hughes:1978:EVA, author = "Charles E. Hughes", title = "The equivalence of vector addition systems to a subclass of {Post} canonical systems", journal = j-INFO-PROC-LETT, volume = "7", number = "4", pages = "201--204", day = "??", month = jun, year = "1978", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C30 (03Bxx)", MRnumber = "80i:68038", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Dept. of Computer Sci., Univ. of Tennessee, Knoxville, TN, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "algebraic groups; computability and decidability; computational complexity; decidability; equivalence; formal languages; parallel program schemata; Petri nets; Post canonical systems; reachability problem; time complexity; uniform recurrence equations; vector addition systems", treatment = "T Theoretical or Mathematical", } @Article{Burton:1978:CSD, author = "W. Burton", title = "Comments on: {Sorting} by distributive partitioning", journal = j-INFO-PROC-LETT, volume = "7", number = "4", pages = "205--206", day = "??", month = jun, year = "1978", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Sun May 02 08:23:57 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", note = "See \cite{Dobosiewicz:1978:SDP,Dobosiewicz:1978:ARW,Huits:1979:PSD}.", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6130 (Data handling techniques)", corpsource = "Dept. of Math. and Computer Sci., Michigan Tech. Univ., Houghton, MI, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "distributive partitioning sort; large sorting problems; sorting; sorting algorithm; time complexity", treatment = "T Theoretical or Mathematical", } @Article{Dobosiewicz:1978:ARW, author = "W. Dobosiewicz", title = "Author's reply to {Warren Burton}'s comments on distributive partitioning sorting", journal = j-INFO-PROC-LETT, volume = "7", number = "4", pages = "206--206", day = "??", month = jun, year = "1978", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Sun May 02 08:24:19 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", note = "See \cite{Burton:1978:CSD,Huits:1979:PSD}", acknowledgement = ack-nhfb, fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", } @Article{Boari:1978:EMA, author = "M. Boari and A. Natali", title = "Erratum: {``Multiple access to a tree in the context of readers and writers problem''}", journal = j-INFO-PROC-LETT, volume = "7", number = "4", pages = "207--207", day = "??", month = jun, year = "1978", 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/infoproc1970.bib", note = "See \cite{Boari:1978:MAT}", acknowledgement = ack-nhfb, fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", } @Article{Ruohonen:1978:NLE, author = "K. Ruohonen", title = "A note on language equations involving morphisms", journal = j-INFO-PROC-LETT, volume = "7", number = "5", pages = "209--212", day = "??", month = aug, year = "1978", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Math. Dept., Univ. of Turku, Turku, Finland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "ETOL languages; formal languages; language equations; morphisms", treatment = "T Theoretical or Mathematical", } @Article{Sudborough:1978:NWO, author = "I. H. Sudborough", title = "A note on weak operator precedence grammars", journal = j-INFO-PROC-LETT, volume = "7", number = "5", pages = "213--218", day = "??", month = aug, year = "1978", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Computer Sci., Technol. Inst. Northwestern Univ., Evanston, IL, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "generalisation; grammars; operator precedence grammar; operator precedence relations; weak operator precedence grammars", treatment = "T Theoretical or Mathematical", } @Article{Akl:1978:FCH, author = "Selim G. Akl and Godfried T. Toussaint", title = "A fast convex hull algorithm", journal = j-INFO-PROC-LETT, volume = "7", number = "5", pages = "219--222", day = "??", month = aug, year = "1978", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C1160 (Combinatorial mathematics); 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/", journalabr = "Inf Process Lett", keywords = "algorithm theory; computer programming; convex hull algorithm; fast; set of points in the plane; set theory; simplicity", treatment = "T Theoretical or Mathematical", } @Article{Bratko:1978:PCS, author = "I. Bratko", title = "Proving correctness of strategies in the {AL1} assertional language", journal = j-INFO-PROC-LETT, volume = "7", number = "5", pages = "223--230", day = "??", month = aug, year = "1978", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C7830D (Computer games)", corpsource = "J. Stefan Inst., Faculty of Electrical Engng., Univ. of Ljubljana, Ljubljana, Yugoslavia", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "Advice Language 1; AL1; artificial intelligence; assertional language; chess endgame; correctness; games of skill; programming theory; strategies", treatment = "A Application; T Theoretical or Mathematical", } @Article{Brown:1978:SSH, author = "M. R. Brown", title = "A storage scheme for height-balanced trees", journal = j-INFO-PROC-LETT, volume = "7", number = "5", pages = "231--232", day = "??", month = aug, year = "1978", 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/infoproc1970.bib", note = "See addendum \cite{Brown:1979:ASS}.", acknowledgement = ack-nhfb, classification = "C6120 (File organisation)", 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 = "bit balance field; data structures; height balanced trees; storage scheme; trees (mathematics)", treatment = "T Theoretical or Mathematical", } @Article{Arora:1978:EOP, author = "Radha Krishan Arora and R. K. Subramanian", title = "Exploiting the Optimal Paging Algorithms", journal = j-INFO-PROC-LETT, volume = "7", number = "5", pages = "233--236", day = "??", month = aug, year = "1978", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory); C6120 (File organisation)", 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; cost; DPMIN; main memory; memory states; optimal paging algorithms; page fault count; reference string; virtual storage; VMIN", treatment = "T Theoretical or Mathematical", } @Article{Noshita:1978:EBD, author = "Kohei Noshita and Etsuo Masuda and Hajime Machida", title = "On the expected behaviors of the {Dijkstra}'s shortest path algorithm for complete graphs", journal = j-INFO-PROC-LETT, volume = "7", number = "5", pages = "237--243", day = "??", month = aug, year = "1978", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C05 (68-04 68E10)", MRnumber = "80c:68022", bibdate = "Tue Nov 17 17:43:26 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Computer Sci., Univ. of Electro-Communications, Chofu, Tokyo, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "algorithm theory; complete graphs; computational complexity; Dijkstra's shortest path algorithm; expected behaviour; graph theory; nonnegatively weighted edges; shortest path algorithm", treatment = "T Theoretical or Mathematical", } @Article{Czaja:1978:IAP, author = "L. Czaja", title = "Implementation approach to parallel systems", journal = j-INFO-PROC-LETT, volume = "7", number = "5", pages = "244--249", day = "??", month = aug, year = "1978", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Inst. Informatyki, Uniwersytetu Warszawskiego, Warszawa, Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "implementation; parallel problem description; parallel processing; programming theory; synchronisation activities; synchronised actions", treatment = "T Theoretical or Mathematical", } @Article{Merret:1978:QLS, author = "T. H. Merret", title = "{QT} logic: simpler and more expressive than predicate calculus", journal = j-INFO-PROC-LETT, volume = "7", number = "6", pages = "251--255", day = "??", month = oct, year = "1978", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68H05 (68B15)", MRnumber = "80f:68111", MRreviewer = "W. W. Armstrong", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C4210 (Formal logic); C6120 (File organisation)", 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 = "arbitrary queries; computer programming languages; data base languages; data base systems; database management systems; database query languages; formal logic; QT logic; relational database", treatment = "T Theoretical or Mathematical", } @Article{Glushkov:1978:CPT, author = "V. M. Glushkov and G. E. Tseytlin and E. L. Yushchenko", title = "Certain problems of the theory of structured programs schemes", journal = j-INFO-PROC-LETT, volume = "7", number = "6", pages = "256--260", day = "??", month = oct, year = "1978", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68B05", MRnumber = "80d:68013", MRreviewer = "Steven S. Muchnick", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm 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 = "algorithmic algebras; programming theory; structured programming; theory of structured programs schemes", treatment = "T Theoretical or Mathematical", } @Article{Natarajan:1978:ODW, author = "K. S. Natarajan and Lee J. White", title = "Optimum Domination in Weighted Trees", journal = j-INFO-PROC-LETT, volume = "7", number = "6", pages = "261--265", day = "??", month = oct, year = "1978", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E10 (68C05 94C15)", MRnumber = "80a:68072", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "402; 912; 921; B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics)", 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/", journalabr = "Inf Process Lett", keywords = "arbitrary graph; domination number; industrial plants --- Location; mathematical techniques; operations research; optimal domination network; trees (mathematics); weighted trees", treatment = "T Theoretical or Mathematical", } @Article{Demetrovics:1978:NCK, author = "J{\'a}nos Demetrovics", title = "On the Number of Candidate Keys", journal = j-INFO-PROC-LETT, volume = "7", number = "6", pages = "266--269", day = "??", month = oct, year = "1978", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68B15", MRnumber = "80f:68023", MRreviewer = "W. W. Armstrong", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C6120 (File organisation)", corpsource = "Computer and Automation Inst., Hungarian Acad. of Sci., Budapest, Hungary", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "candidate keys; data base systems; data processing --- Data Structures; data structures; functional dependencies; relational model; upper bound", treatment = "T Theoretical or Mathematical", } @Article{Ajtai:1978:TNF, author = "Mikl{\'o}s Ajtai and J{\'a}nos Koml{\'o}s and Endre Szemer{\'e}di", title = "There is No Fast Single Hashing Algorithm", journal = j-INFO-PROC-LETT, volume = "7", number = "6", pages = "270--273", day = "??", month = oct, year = "1978", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68H05 (68C25)", MRnumber = "80a:68112", MRreviewer = "Eberhard L{\"u}dde", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6130 (Data handling techniques)", corpsource = "Math. Inst., Hungarian Acad. of Sci., Budapest, Hungary", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "algorithm theory; data handling; single hashing algorithm; speed", treatment = "T Theoretical or Mathematical", } @Article{Garey:1978:LTA, author = "Michael R. Garey and Robert E. Tarjan", title = "A linear-time algorithm for finding all feedback vertices", journal = j-INFO-PROC-LETT, volume = "7", number = "6", pages = "274--276", day = "??", month = oct, year = "1978", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C05 (68C25 68E10)", MRnumber = "80a:68030", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics)", 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 = "arbitrary strongly connected graph; computer programming; directed graphs; feedback vertices; linear time algorithm", treatment = "T Theoretical or Mathematical", } @Article{Malhotra:1978:AFM, author = "V. M. Malhotra and M. Pramodh Kumar and S. N. Maheshwari", title = "An {$ O(V^3) $} algorithm for finding maximum flows in networks", journal = j-INFO-PROC-LETT, volume = "7", number = "6", pages = "277--278", day = "??", month = oct, year = "1978", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "90B10", MRnumber = "80b:90058", MRreviewer = "Gerald Hammer", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics)", corpsource = "Computer Sci. Program, Indian Inst. of Technol., Kanpur, India", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "directed graphs; maximum flows; networks; per stage flow problem", treatment = "T Theoretical or Mathematical", } @Article{Giegerich:1978:COP, author = "Robert Giegerich and Reinhard Wilhelm", title = "Counter-One-Pass Features in One-Pass Compilation: a Formalization Using Attribute Grammars", journal = j-INFO-PROC-LETT, volume = "7", number = "6", pages = "279--284", day = "??", month = oct, year = "1978", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68B05", MRnumber = "80a:68010", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "721; 723; C4210 (Formal logic); C6150C (Compilers, interpreters and other processors)", 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 = "attribute grammars; automata theory; computer metatheory; counter one pass features; grammars; one pass compilation; program compilers", treatment = "T Theoretical or Mathematical", } @Article{Yuval:1978:SPS, author = "G. Yuval", title = "A simple proof of {Strassen}'s result", journal = j-INFO-PROC-LETT, volume = "7", number = "6", pages = "285--286", day = "??", month = oct, year = "1978", 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/infoproc1970.bib", note = "See also corrigendum \cite{Yuval:1979:CSP}.", acknowledgement = ack-nhfb, classification = "C4140 (Linear algebra)", corpsource = "Dept. of Computer Sci., Hebrew Univ., Jerusalem, Israel", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "analysis of algorithms; matrix algebra; scalar multiplication steps", treatment = "T Theoretical or Mathematical", } @Article{Friedman:1978:ESC, author = "E. P. Friedman and S. A. Greibach", title = "On Equivalence and Subclass Containment Problems for Deterministic Context-Free Languages", journal = j-INFO-PROC-LETT, volume = "7", number = "6", pages = "287--290", day = "??", month = oct, year = "1978", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68F10 (68F05)", MRnumber = "80a:68097", MRreviewer = "Matti Linna", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "721; C4210 (Formal logic)", corpsource = "Computer Sci. Dept., Univ. of California, Los Angelse, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "automata theory; computability and decidability; context free languages; context-free languages; decidable; deterministic pushdown store automata; equivalence; subclass containment", treatment = "T Theoretical or Mathematical", } @Article{Czaja:1978:PIP, author = "Ludwik Czaja", title = "Parallel Implementation of Path Expressions", journal = j-INFO-PROC-LETT, volume = "7", number = "6", pages = "291--295", day = "??", month = oct, year = "1978", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Inst. Informatyki Univ. Warszawskiego, Warsaw, Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "computer programming; concurrency table; parallel processing; parallel system; path expressions", 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/infoproc1970.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{Shortt:1978:IPC, author = "Joseph Shortt", title = "An iterative program to calculate {Fibonacci} numbers in {$ O(\log n) $} arithmetic operations", journal = j-INFO-PROC-LETT, volume = "7", number = "6", pages = "299--303", day = "??", month = oct, year = "1978", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "10-04 (68C05)", MRnumber = "80b:10003", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C5230 (Digital arithmetic methods)", corpsource = "Dept. of Computing and Information Sci., Univ. of Guelph, Guelph, Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "calculate Fibonacci numbers; interactive program; iterative; number theory; O(log n) arithmetic operations; storage", treatment = "T Theoretical or Mathematical", xxtitle = "An interactive program to calculate {Fibonacci} numbers in {$O(\log n)$} arithmetic operations", } @Article{Jakobsson:1978:HCB, author = "M. Jakobsson", title = "{Huffman} coding in bit-vector compression", journal = j-INFO-PROC-LETT, volume = "7", number = "6", pages = "304--307", day = "??", month = oct, year = "1978", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "94B25", MRnumber = "80f:94026", MRreviewer = "Ram Autar", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C6130 (Data handling techniques)", corpsource = "Dept. of Computer Sci., Univ. of Turku, Turku, Finland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "bit vector compression; codes, symbolic; compression gain; data compression; encoding; Huffman coding; information theory --- Data Compression", treatment = "T Theoretical or Mathematical", } @Article{Teuhola:1978:CMC, author = "Jukka Teuhola", title = "A compression method for clustered bit-vectors", journal = j-INFO-PROC-LETT, volume = "7", number = "6", pages = "308--311", day = "??", month = oct, year = "1978", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C6130 (Data handling techniques)", corpsource = "Dept. of Computer Sci., Univ. of Turku, Turku, Finland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "clustered bit vectors; codes, symbolic; compression method; data compression; encoding; fixed to variable encoding; information theory --- Data Compression; variable to fixed encoding; variable to variable encoding", treatment = "T Theoretical or Mathematical", } @Article{Clark:1978:NSL, author = "D. W. Clark and C. C. Green", title = "A note on shared list structure in {LISP}", journal = j-INFO-PROC-LETT, volume = "7", number = "6", pages = "312--314", day = "??", month = oct, year = "1978", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation); C6130 (Data handling techniques); C6140D (High level languages)", corpsource = "Xerox Palo Alto Res. Center, Palo Alto, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "encodings of list structure; LISP; reference counting garbage collectors; shared list structure; storage management", treatment = "T Theoretical or Mathematical", } @Article{Papadimitriou:1979:ESR, author = "Christos H. Papadimitriou", title = "Efficient search for rationals", journal = j-INFO-PROC-LETT, volume = "8", number = "1", pages = "1--4", day = "2", month = jan, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25 (90C99)", MRnumber = "80e:68119", MRreviewer = "A. Massarotti", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C1180 (Optimisation techniques); C5230 (Digital arithmetic methods)", corpsource = "Aiken Computation Lab., Harvard Univ., Cambridge, MA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "binary search; denominator; digital arithmetic; enumerator; Farey series; linear programming; positive rational fraction; queries", treatment = "T Theoretical or Mathematical", } @Article{Culik:1979:SDR, author = "K. {Culik, II}", title = "Some decidability results about regular and pushdown translations", journal = j-INFO-PROC-LETT, volume = "8", number = "1", pages = "5--8", day = "2", month = jan, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68F10 (68C30)", MRnumber = "80d:68102", MRreviewer = "A. Salomaa", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4220 (Automata 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 = "automata theory; context free languages; context-free languages; decidability results; finite transducers; homomorphism equivalence; homomorphisms; parsing; pushdown transducers; regular and pushdown translations", treatment = "T Theoretical or Mathematical", } @Article{Fraenkel:1979:PSL, author = "Aviezri S. Fraenkel", title = "Paired Sequential Lists in a Memory Interval", journal = j-INFO-PROC-LETT, volume = "8", number = "1", pages = "9--10", day = "2", month = jan, 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 = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory); C6120 (File organisation); 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 = "computer operating systems --- Storage Allocation; computer programming; dynamic memory allocation; file organisation; list processing; local overflow; memory interval; sequential lists", treatment = "T Theoretical or Mathematical", } @Article{Osborn:1979:TEC, author = "Sylvia L. Osborn", title = "Testing for Existence of a Covering {Boyce-Codd} Normal Form", journal = j-INFO-PROC-LETT, volume = "8", number = "1", pages = "11--14", day = "2", month = jan, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68B15 (68C05)", MRnumber = "80g:68026", MRreviewer = "V. V. Byts", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory); C6160D (Relational databases)", corpsource = "Computer Sci. Dept., 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; Boyce Codd normal form; computer programming --- Subroutines; data base relation; data base systems; database management systems; DBMS; functional dependencies", treatment = "T Theoretical or Mathematical", } @Article{Inoue:1979:NCC, author = "Katsushi Inoue and Itsuo Takanami", title = "A note on cyclic closure operations", journal = j-INFO-PROC-LETT, volume = "8", number = "1", pages = "15--16", day = "2", month = jan, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68F10", MRnumber = "80j:68067", MRreviewer = "Kenneth B. Salomon", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4220 (Automata theory)", corpsource = "Dept. of Electronics, Faculty of Engng., Yamaguchi Univ., Ube, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "automata theory; cyclic closure operations; formal languages", treatment = "T Theoretical or Mathematical", } @Article{Angluin:1979:NCM, author = "Dana Angluin", title = "A note on a construction of {Margulis}", journal = j-INFO-PROC-LETT, volume = "8", number = "1", pages = "17--19", day = "2", month = jan, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "05C40 (68E10 94C10)", MRnumber = "80j:05082", MRreviewer = "Narsingh Deo", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Math. Dept., Univ. of California, Santa Barbara, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "computational complexity; concentrator; connectivity; graph theory; Margulis; nodes; switching networks", treatment = "T Theoretical or Mathematical", } @Article{Fortune:1979:NRN, author = "Steve Fortune and John Hopcroft", title = "A note on {Rabin}'s nearest-neighbor algorithm", journal = j-INFO-PROC-LETT, volume = "8", number = "1", pages = "20--23", day = "2", month = jan, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25 (68G10)", MRnumber = "81i:68060", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C1140Z (Other topics in statistics); 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/", journalabr = "Inf Process Lett", keywords = "algorithm; algorithm theory; computer; hashing; nearest neighbour algorithm; probabilistic nature; Rabin's algorithm; statistical analysis", treatment = "T Theoretical or Mathematical", } @Article{Shiloach:1979:EDB, author = "Yossi Shiloach", title = "Edge-disjoint branching in directed multigraphs", journal = j-INFO-PROC-LETT, volume = "8", number = "1", pages = "24--27", day = "2", month = jan, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "05C40 (05C20 68E10)", MRnumber = "81f:05112", MRreviewer = "L{\'a}szl{\'o} Lov{\'a}sz", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics)", corpsource = "Computer Sci. Dept., Stanford Univ., Stanford, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "algorithm; directed multigraphs; edge connectivity; edge disjoint branching; graph theory", treatment = "T Theoretical or Mathematical", } @Article{Shamir:1979:FNA, author = "Adi Shamir", title = "Factoring numbers in {$ O(\log n) $} arithmetic steps", journal = j-INFO-PROC-LETT, volume = "8", number = "1", pages = "28--31", day = "2", month = jan, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25 (03D15 10A25)", MRnumber = "81i:68066", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "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/", keywords = "addition; algorithm; arithmetic steps; computational complexity; factoring problem; integer division; multiplication; optimal; prime numbers; subtraction", treatment = "T Theoretical or Mathematical", } @Article{Jantzen:1979:NVG, author = "M. Jantzen", title = "A note on vector grammars", journal = j-INFO-PROC-LETT, volume = "8", number = "1", pages = "32--33", day = "2", month = jan, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68F05", MRnumber = "80c:68054", MRreviewer = "Curtis R. Cook", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Fachbereich Informatik, Univ. Hamburg, Hamburg, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "context free grammars; context-free grammars; control sets; formal languages; mapping; vector grammars", treatment = "T Theoretical or Mathematical", } @Article{Inoue:1979:NBP, author = "Katsushi Inoue and Itsuo Takanami", title = "A note on bottom-up pyramid acceptors", journal = j-INFO-PROC-LETT, volume = "8", number = "1", pages = "34--37", day = "2", month = jan, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68D20 (68F10)", MRnumber = "80c:68042", MRreviewer = "Sorin Istrail", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory)", corpsource = "Dept. of Electronics, Faculty of Engng., Yamaguchi Univ., Ube, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "automata theory; bottom up pyramid acceptor; cellular automata; deterministic BPA; pattern recognition; two dimensional finite automata", treatment = "T Theoretical or Mathematical", } @Article{Buda:1979:GSM, author = "A. Buda", title = "Generalized ${}^{1, 5}$ Sequential Machine Maps", journal = j-INFO-PROC-LETT, volume = "8", number = "1", pages = "38--40", day = "2", month = jan, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68F10 (68B10)", MRnumber = "80f:68092", MRreviewer = "Max Dauchet", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "721; C4210 (Formal logic); C4220 (Automata theory); C4230D (Sequential switching theory)", corpsource = "Inst. of Math., Computing Centre, Bulgarian Acad. of Sci., Sofia, Bulgaria", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "automata theory; equivalence problem; formal languages; program schema; sequential machine maps; sequential machines; sp machine languages; tree transducer", treatment = "T Theoretical or Mathematical", } @Article{Friedman:1979:RCC, author = "Daniel P. Friedman and David S. Wise", title = "Reference Counting Can Manage the Circular Environments of Mutual Recursion", journal = j-INFO-PROC-LETT, volume = "8", number = "1", pages = "41--45", day = "2", month = jan, 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 = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory); C6120 (File organisation)", 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 = "circular environments; computer programming; ISWIM; labels construct; letrec; lexical scoping; LISP; mutual recursion; recursive languages; reference counting; SCHEME; storage management; storage management technique; threads; Y-combinator", treatment = "G General Review; T Theoretical or Mathematical", } @Article{Makarov:1979:UDC, author = "O. M. Makarov", title = "Using duality to compute the pair of matrix products {$ Q Y $} and {$ Y^T Q $} over a commutative ring", journal = j-INFO-PROC-LETT, volume = "8", number = "1", pages = "46--49", day = "2", month = jan, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C05 (65F99)", MRnumber = "80j:68025", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C1110 (Algebra); C1180 (Optimisation techniques)", 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 = "commutative ring; duality; duality (mathematics); matrix algebra; matrix multiplication problems; matrix products; noncommutative bilinear algorithm; optimisation", treatment = "T Theoretical or Mathematical", } @Article{Bertoni:1979:TEA, author = "Alberto Bertoni and Giancarlo Mauri and Mauro Torelli", title = "Three efficient algorithms for counting problems", journal = j-INFO-PROC-LETT, volume = "8", number = "1", pages = "50--53", day = "2", month = jan, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25 (68E10 68F05)", MRnumber = "80g:68055", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Istituto di Cibernetica, Univ. di Milano, Milan, Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "algorithm theory; algorithms; automata theory; combinatorial mathematics; computational complexity; counting problems; counting strings; counting trees; efficient algorithms; random access machine", } @Article{Gonnet:1979:END, author = "G. H. Gonnet", title = "Erratum to {``Notes on the derivation of asymptotic expressions from summations''} {[Inform. Process. Lett. {\bf 7}(4), June 1978, pp. 165--169]}", journal = j-INFO-PROC-LETT, volume = "8", number = "1", pages = "54--54", day = "2", month = jan, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "65B15 (Euler--Maclaurin formula), 65B10 (Summation of series)", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", note = "See \cite{Gonnet:1978:NDA}.", acknowledgement = ack-nhfb, fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", } @Article{Lyon:1979:BSS, author = "Gordon Lyon", title = "Batch Scheduling from Short Lists", journal = j-INFO-PROC-LETT, volume = "8", number = "2", pages = "57--59", day = "15", month = feb, 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 = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C1290 (Applications of systems theory); C6120 (File organisation)", corpsource = "Inst. for Computer Sci. and Technol., Nat. Bur. of Stand., Washington, DC, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "assignments; computer systems programming; hashing; scheduling; short lists; storage allocation", treatment = "T Theoretical or Mathematical", } @Article{Blazewicz:1979:DST, author = "Jacek B{\l}a{\.z}ewicz", title = "Deadline scheduling of tasks with ready times and resource constraints", journal = j-INFO-PROC-LETT, volume = "8", number = "2", pages = "60--63", day = "15", month = feb, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C15 (68C25)", MRnumber = "80h:68034", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C1290 (Applications of systems theory); C4290 (Other computer theory)", corpsource = "Inst. of Control Engng., Tech. Univ. of Poznan, Poznan, Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "deadlines; multiprocessing systems; multiprocessor; ready times; resource constraints; scheduling", treatment = "T Theoretical or Mathematical", } @Article{Simovici:1979:EIF, author = "Dan A. Simovici and Gh. Grigora{\cedla{s}}", title = "Even initial feedback vertex set problem is {NP}-complete", journal = j-INFO-PROC-LETT, volume = "8", number = "2", pages = "64--66", day = "15", month = feb, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25 (68E10)", MRnumber = "80b:68059", MRreviewer = "David A. Plaisted", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4220 (Automata theory)", corpsource = "Dept. of Math., Univ. of Iasi, Iasi, Romania", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "feedback vertex set; finite automata; NP-complete; set theory; vertex cover", treatment = "T Theoretical or Mathematical", } @Article{Kessels:1979:TIC, author = "J. L. W. Kessels and A. J. Martin", title = "Two implementations of the conditional critical region using a split binary semaphore", journal = j-INFO-PROC-LETT, volume = "8", number = "2", pages = "67--71", day = "15", month = feb, 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Philips Res. Labs., Eindhoven, Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "conditional critical region; consistency; fairness; parallel processing; programming theory; progress; split binary semaphore", treatment = "T Theoretical or Mathematical", } @Article{vanderNat:1979:BMP, author = "M. {Van Der Nat}", title = "Binary Merging by Partitioning", journal = j-INFO-PROC-LETT, volume = "8", number = "2", pages = "72--75", day = "15", month = feb, 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 = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory); 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/", journalabr = "Inf Process Lett", keywords = "binary merging; computer systems programming; merging; partitioning", treatment = "T Theoretical or Mathematical", } @Article{Morris:1979:SFS, 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 = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.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{Misra:1979:STT, author = "Jayadev Misra", title = "Space-time trade off in implementing certain set operations", journal = j-INFO-PROC-LETT, volume = "8", number = "2", pages = "81--85", day = "15", month = feb, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25 (68B15 68E05)", MRnumber = "80g:68060", MRreviewer = "Giorgio Ausiello", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm 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/", keywords = "algorithm theory; algorithms; computational complexity; set operations; space; time; trade off", treatment = "T Theoretical or Mathematical", } @Article{Lenstra:1979:MPT, author = "H. W. {Lenstra, Jr.}", title = "{Miller}'s primality test", journal = j-INFO-PROC-LETT, volume = "8", number = "2", pages = "86--88", day = "15", month = feb, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "10A25", MRnumber = "80c:10008", MRreviewer = "D. H. Lehmer", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C5230 (Digital arithmetic methods)", corpsource = "Math. Inst., Amsterdam, Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "generalized Riemann hypothesis; integer; number theory; primality test; prime", treatment = "T Theoretical or Mathematical", } @Article{Reiss:1979:RS, author = "Steven P. Reiss", title = "Rational search", journal = j-INFO-PROC-LETT, volume = "8", number = "2", pages = "89--90", day = "15", month = feb, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25 (90C05)", MRnumber = "80g:68062", MRreviewer = "Eitan Zemel", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C1180 (Optimisation techniques)", corpsource = "Computer Sci., Brown Univ., Providence, RI, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "linear programming; rational number; search", treatment = "T Theoretical or Mathematical", } @Article{Kruijer:1979:SSS, author = "H. S. M. Kruijer", title = "Self-stabilization (in spite of distributed control) in tree-structured systems", journal = j-INFO-PROC-LETT, volume = "8", number = "2", pages = "91--95", day = "15", month = feb, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68B20", MRnumber = "80d:68030", MRreviewer = "Armin Cremers", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Dept. of Math. and Sci. Engng., Koninklijke/Shell-Lab., Amsterdam, Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "multiprocessing; multiprocessing programs; operating systems (computers); programming theory; self stabilising systems; structure of a tree; trees (mathematics)", treatment = "T Theoretical or Mathematical", } @Article{Dobkin:1979:LPL, author = "David Dobkin and Richard J. Lipton and Steven P. Reiss", title = "Linear programming is log-space hard for {$P$}", journal = j-INFO-PROC-LETT, volume = "8", number = "2", pages = "96--97", day = "15", month = feb, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25 (90C05)", MRnumber = "80h:68039", MRreviewer = "Steven S. Muchnick", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C1180 (Optimisation techniques); C4210 (Formal logic)", 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 = "computational complexity; deterministic polynomial time; formal languages; languages; linear programming; multitape Turing machine; space complexity", treatment = "T Theoretical or Mathematical", } @Article{Pequeno:1979:ADT, author = "T. H. Pequeno and C. J. Lucena", title = "An approach for data type specification and its use in program verification", journal = j-INFO-PROC-LETT, volume = "8", number = "2", pages = "98--103", day = "15", month = feb, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68B10", MRnumber = "80d:68023", MRreviewer = "Giorgio Levi", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory); C6120 (File organisation)", corpsource = "Dept. de Informatica, Pontificia Univ. Catolica, Rio de Janeiro, Brazil", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "abstract data types; computer programming; correctness; data structures; data type specification; program verification; programming theory", treatment = "T Theoretical or Mathematical", } @Article{Paun:1979:SLA, author = "Gheorghe P{\u{a}}un", title = "On {Szilard}'s languages associated to a matrix grammar", journal = j-INFO-PROC-LETT, volume = "8", number = "2", pages = "104--105", day = "15", month = feb, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68F05", MRnumber = "80b:68095", MRreviewer = "Etsuro Moriya", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Inst. of Math., Bucharest, Romania", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "context free; context-free grammars; context-free languages; matrix grammars; Szilard languages", } @Article{Cherniavsky:1979:FTD, author = "J. C. Cherniavsky", title = "On finding test data sets for loop free programs", journal = j-INFO-PROC-LETT, volume = "8", number = "2", pages = "106--107", day = "15", month = feb, 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6110 (Systems analysis and programming); C6150G (Diagnostic, testing, debugging and evaluating systems)", 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 = "loop free programs; program testing; software engineering; test data; testing of software; validate", treatment = "T Theoretical or Mathematical", } @Article{Akl:1979:TRC, author = "S. G. Akl", title = "Two remarks on a convex hull algorithm", journal = j-INFO-PROC-LETT, volume = "8", number = "2", pages = "108--109", day = "15", month = feb, 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics)", corpsource = "School of Computer Sci., McGill Univ., Montreal, Que., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "combinatorial mathematics; convex hull algorithm; set of points in the plane", treatment = "T Theoretical or Mathematical", } @Article{Stoyan:1979:MMS, author = "Yu. G. Stoyan and V. Z. Socolovsky", title = "The minimization method for some permutation functionals", journal = j-INFO-PROC-LETT, volume = "8", number = "2", pages = "110--111", day = "15", month = feb, 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C1180 (Optimisation techniques)", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "alphabetical; chain metrics; combinatorial mathematics; inversional; lexicographical; metric structure; minimisation; minimization; permutation functionals; transpositional", treatment = "T Theoretical or Mathematical", } @Article{Rick:1979:IBA, author = "C. C. Rick and D. J. Evans", title = "An Improved Bisection Algorithm", journal = j-INFO-PROC-LETT, volume = "8", number = "2", pages = "112--113", day = "15", month = feb, 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "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 algorithm; eigenvalue, Sturm sequence; eigenvalues; eigenvalues and eigenfunctions; matrix algebra; real symmetric matrix", treatment = "T Theoretical or Mathematical", } @Article{Cellary:1979:NST, author = "Wojciech Cellary", title = "A new safety test for deadlock avoidance", journal = j-INFO-PROC-LETT, volume = "8", number = "3", pages = "115--120", day = "15", month = mar, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C15 (68A05 90B25)", MRnumber = "80g:68046", MRreviewer = "James W. Snively, Jr.", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C6150J (Operating systems)", corpsource = "Dept. of 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 = "computer systems programming; deadlock avoidance; nonpreemptible resources; resource allocation; resource utilization; safety test; system recovery; systems", treatment = "N New Development; 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/infoproc1970.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{Vikas:1979:API, author = "Om Vikas", title = "Analysis of a Periodically Inspected Buffer", journal = j-INFO-PROC-LETT, volume = "8", number = "3", pages = "124--130", day = "15", month = mar, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C15 (68A05)", MRnumber = "80f:68037", MRreviewer = "Frits C. Schoute", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "722; 723; C1140C (Queueing theory); C5120 (Logic and switching circuits)", corpsource = "Nat. Informatics Centre, Electronics Commission, Safdarjung Dev. Area, New Delhi, India", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "computer systems, digital; finite length buffers; queueing theory; serial shift register memory; shift registers", } @Article{Mathon:1979:NGI, author = "Rudolf Mathon", title = "A note on the graph isomorphism counting problem", journal = j-INFO-PROC-LETT, volume = "8", number = "3", pages = "131--132", day = "15", month = mar, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25", MRnumber = "80b:68056", MRreviewer = "Toshimasa Watanabe", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "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 = "graph isomorphism counting problem; graph theory; polynomial time equivalent", treatment = "T Theoretical or Mathematical", } @Article{Bentley:1979:NEN, author = "Jon Louis Bentley and Hermann A. Maurer", title = "A note on {Euclidean} near neighbor searching in the plane", journal = j-INFO-PROC-LETT, volume = "8", number = "3", pages = "133--136", day = "15", month = mar, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E05", MRnumber = "81g:68085", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics)", corpsource = "Dept. of Computer Sci. and Math., Carnegie-Mellon Univ., Pittsburgh, PA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "associative searching; combinatorial mathematics; computational geometry; Euclidean near neighbour searching; fixed radius; multidimensional searching; queries", treatment = "T Theoretical or Mathematical", } @Article{SangAjang:1979:EAD, author = "Gerard J. M. {Sang Ajang} and Frank Teer", title = "An efficient algorithm for detection of combined occurrences", journal = j-INFO-PROC-LETT, volume = "8", number = "3", pages = "137--140", day = "15", month = mar, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68H05 (68B15 68C05)", MRnumber = "80e:68241", MRreviewer = "A. Aiello", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; B6140C (Optical information, image and video signal processing); C1250 (Pattern recognition)", corpsource = "Vakgroep Informatica, Free Univ., Amsterdam, Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "algorithm; artificial intelligence; combined occurrences; computer programming; detection; pattern recognition; retrieval", treatment = "T Theoretical or Mathematical", } @Article{Kundu:1979:IVT, author = "Sukhamay Kundu", title = "An intermediate-value theorem for optimum tree valuation", journal = j-INFO-PROC-LETT, volume = "8", number = "3", pages = "141--145", day = "15", month = mar, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E10 (68H05)", MRnumber = "80h:68055", MRreviewer = "Eberhard L{\"u}dde", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C1160 (Combinatorial mathematics); C4210 (Formal logic)", corpsource = "Logicon Inc., Lexington, MA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "computer metatheory; optimisation; optimum tree valuation; tree labelling; trees (mathematics)", treatment = "T Theoretical or Mathematical", } @Article{Shiloach:1979:SLO, author = "Yossi Shiloach", title = "Strong linear orderings of a directed network", journal = j-INFO-PROC-LETT, volume = "8", number = "3", pages = "146--148", day = "15", month = mar, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "90B10", MRnumber = "80b:90061", MRreviewer = "Edward Minieka", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics)", corpsource = "Computer Sci. Dept., Stanford Univ., Stanford, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "digraphs; directed graphs; directed network; linear orderings; minimum cut; transitive tournament; vertices", treatment = "T Theoretical or Mathematical", } @Article{vanLeeuwen:1979:CSD, author = "Jan {van Leeuwen}", title = "On Compromising Statistical Data-Bases with a Few Known Elements", journal = j-INFO-PROC-LETT, volume = "8", number = "3", pages = "149--153", day = "15", month = mar, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68B15 (94B35)", MRnumber = "82h:68022", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; 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/", journalabr = "Inf Process Lett", keywords = "data base systems; data processing --- Security of Data; known elements; security of data; security problem; statistical databases", treatment = "T Theoretical or Mathematical", } @Article{Brown:1979:ASS, author = "M. R. Brown", title = "Addendum to {``A storage scheme for height-balanced trees''}", journal = j-INFO-PROC-LETT, volume = "8", number = "3", pages = "154--156", day = "15", month = mar, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Mon Nov 16 07:57:29 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", note = "See \cite{Brown:1978:SSH}.", acknowledgement = ack-nhfb, fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", } @Article{Akl:1979:AIA, author = "S. G. Akl and G. T. Toussaint", title = "Addendum to {``An improved algorithm to check for polygon similarity''}", journal = j-INFO-PROC-LETT, volume = "8", number = "3", pages = "157--158", day = "15", month = mar, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Mon Nov 16 07:57:29 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", note = "See \cite{Akl:1978:IAC}.", acknowledgement = ack-nhfb, fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", } @Article{Bonuccelli:1979:MND, author = "M. A. Bonuccelli and D. P. Bovet", title = "Minimum Node Disjoint Path Covering for Circular-Arc Graphs", journal = j-INFO-PROC-LETT, volume = "8", number = "4", pages = "159--161", day = "30", month = apr, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25 (68E10)", MRnumber = "81h:68020", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; 921; C1160 (Combinatorial mathematics)", corpsource = "Inst. 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 = "circular arc graphs; computer metatheory; graph theory; mathematical techniques --- Graph Theory; minimum node disjoint path covering; time complexity", treatment = "T Theoretical or Mathematical", } @Article{Czaja:1979:SPP, author = "Ludwik Czaja", title = "A specification of parallel problems", journal = j-INFO-PROC-LETT, volume = "8", number = "4", pages = "162--167", day = "30", month = apr, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C40 (68B20)", MRnumber = "80g:68066", MRreviewer = "Eugene Levner", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C4290 (Other computer theory)", corpsource = "Inst. Informatyki Uniwersytetu Warszawskiego, Warszawa, Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "bounded quantifiers; computation theory; computer metatheory; deadlock; equality; fairness; lockout; parallel problems; parallel processing; propositional formulae; scheduling; sequencing; timing", treatment = "T Theoretical or Mathematical", } @Article{Huits:1979:PSD, author = "Martin Huits and Vipin Kumar", title = "The Practical Significance of Distributive Partitioning Sort", journal = j-INFO-PROC-LETT, volume = "8", number = "4", pages = "168--169", day = "30", month = apr, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E05 (68C05)", MRnumber = "80e:68161a", MRreviewer = "Amitava Bagchi", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", note = "See original paper \cite{Dobosiewicz:1978:SDP} and rebuttal \cite{Dobosiewicz:1979:PSD}, and further debate \cite{Burton:1978:CSD,Dobosiewicz:1978:ARW}", acknowledgement = ack-nhfb, classification = "C6130 (Data handling techniques)", corpsource = "Information Systems and Automation Res., Philips, Eindhoven, Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "distributive partitioning algorithm; distributive partitioning sort; quick sort; shell sort; sorting", treatment = "G General Review", } @Article{Dobosiewicz:1979:PSD, author = "W{\l}odzimierz Dobosiewicz", title = "The Practical Significance of {D.P.} Sort Revisited", journal = j-INFO-PROC-LETT, volume = "8", number = "4", pages = "170--172", day = "30", month = apr, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E05 (68C05)", MRnumber = "80e:68161b", MRreviewer = "Amitava Bagchi", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", note = "This paper rebuts comments \cite{Huits:1979:PSD} on the original paper \cite{Dobosiewicz:1978:SDP}.", acknowledgement = ack-nhfb, classification = "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/", keywords = "D.P. sort; distributive partitioning sorting; sorting", 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/infoproc1970.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{Hitotumatu:1979:TIB, author = "Hirosi Hitotumatu and Kohei Noshita", title = "A technique for implementing backtrack algorithms and its application", journal = j-INFO-PROC-LETT, volume = "8", number = "4", pages = "174--175", 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 = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C1140E (Game theory); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Computer Sci., Univ. of Electro-Communications, Chofu-city, Tokyo, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "backtrack algorithms; computer programming; game theory; N queens problem; programming theory", treatment = "P Practical", } @Article{Henno:1979:DMF, author = "J. Henno", title = "The depth of monotone functions in multivalued logic", journal = j-INFO-PROC-LETT, volume = "8", number = "4", pages = "176--177", day = "30", month = apr, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25 (03B50)", MRnumber = "81g:68067", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Math., Tallinn Polytech. Inst., Tallinn, USSR", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "Boolean functions; computational complexity; formal logic; monotone functions; multivalued logic", treatment = "T Theoretical or Mathematical", } @Article{Rivest:1979:LBN, author = "Ronald L. Rivest and Jean-Paul {Van de Wiele}", title = "An {$ \Omega ((n / \lg n)^{1 / 2}) $} lower bound on the number of additions necessary to compute $0$-$1$ polynomials over the ring of integer polynomials", journal = j-INFO-PROC-LETT, volume = "8", number = "4", pages = "178--180", day = "30", month = apr, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25", MRnumber = "80b:68058", MRreviewer = "R. G. Larson", bibdate = "Wed Dec 02 18:52:38 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4130 (Interpolation and function approximation); C4240 (Programming and algorithm 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 complexity; computational complexity; integer polynomials; number of additions; polynomials", treatment = "T Theoretical or Mathematical", } @Article{Culik:1979:SIS, author = "K. {Culik, II} and H. A. Maurer", title = "Secure Information Storage and Retrieval Using New Results in Cryptography", journal = j-INFO-PROC-LETT, volume = "8", number = "4", pages = "181--186", day = "30", month = apr, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68B15 (68H05)", MRnumber = "80h:68010", MRreviewer = "James W. Snively, Jr.", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C6130 (Data handling techniques)", 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 = "cryptography; data processing --- Security of Data; encoding; information retrieval; information retrieval systems; information storage; information systems; security of data", } @Article{Ukkonen:1979:NSC, author = "Esko Ukkonen", title = "The nonexistence of some covering context-free grammars", journal = j-INFO-PROC-LETT, volume = "8", number = "4", pages = "187--192", day = "30", month = apr, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68F05", MRnumber = "84a:68088", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "721; 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 = "automata theory; context free grammars; context-free grammars; covering grammars; parsing", treatment = "T Theoretical or Mathematical", } @Article{Yang:1979:NAN, author = "C. C. Yang and D. T. Lee", title = "A note on the all nearest-neighbor problem for convex polygons", journal = j-INFO-PROC-LETT, volume = "8", number = "4", pages = "193--194", day = "30", month = apr, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68G10 (52-04 52A25 68C05)", MRnumber = "80c:68065", MRreviewer = "D. T. Lee", bibdate = "Tue Nov 17 17:26:55 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", note = "See \cite{Lee:1978:ANN,Fournier:1979:CAN}.", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics)", corpsource = "Naval Res. Lab., Washington, DC, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "convex polygon; convex polygons; extremal vertices; nearest neighbour problem; set theory", treatment = "T Theoretical or Mathematical", } @Article{Harel:1979:TRP, author = "David Harel", title = "Two results on process logic", journal = j-INFO-PROC-LETT, volume = "8", number = "4", pages = "195--198", day = "30", month = apr, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68B05", MRnumber = "81b:68007a", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", note = "See also erratum \cite{Harel:1979:ETR}.", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "MIT, Cambridge, MA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "abstract actions; connectives; formal logic; PL; process logic", treatment = "T Theoretical or Mathematical", } @Article{Plesnik:1979:NCH, author = "J. Plesn{\'\i}k", title = "The {NP}-completeness of the {Hamiltonian} cycle problem in planar digraphs with degree bound two", journal = j-INFO-PROC-LETT, volume = "8", number = "4", pages = "199--201", day = "30", month = apr, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25 (05C20 68E10)", MRnumber = "80h:68043", MRreviewer = "David A. Plaisted", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Math., Komensky Univ., Bratislava, Czechoslovakia", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "combinatorial problems; computational complexity; directed graphs; Hamiltonian cycle problem; NP completeness; planar digraphs", treatment = "T Theoretical or Mathematical", } @Article{Pankov:1979:SEE, author = "P. S. Pankov and Si. L. Dolmatov", title = "Substantiable evaluations by electronic computers and their application to one problem in combinatorial geometry", journal = j-INFO-PROC-LETT, volume = "8", number = "4", pages = "202--203", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C1230 (Artificial intelligence)", corpsource = "Inst. of Phys. and Math., Kirgiz Acad. of Sci., Frunze, USSR", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "combinatorial geometry; constructive analysis; electronic computers; geometry; substantiable evaluation; theorem proving", treatment = "T Theoretical or Mathematical", } @Article{Fridman:1979:ALS, author = "Felix J. Fridman and Glenn H. Holloway and Naftaly H. Minsky and Josef Stein", title = "Abstract {FOR}-loops over several aggregates", journal = j-INFO-PROC-LETT, volume = "8", number = "4", pages = "204--206", 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 = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Computer Sci. Dept., Hebrew Univ., Jerusalem, Israel", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "aggregates; computer programming languages; EUCLID like syntax; FOR loop; programming theory", treatment = "T Theoretical or Mathematical", } @Article{Muhlbacher:1979:FGG, author = "J{\"o}rg M{\"u}hlbacher", title = "{$F$}-factors of graphs: a generalized matching problem", journal = j-INFO-PROC-LETT, volume = "8", number = "4", pages = "207--214", day = "30", month = apr, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E10 (05C99)", MRnumber = "80d:68078", MRreviewer = "O. D'Antona", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; 921; C1160 (Combinatorial mathematics)", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "computer metatheory; edge colouring problem; F factor; graph theory; graphs; magic squares; matching problem; mathematical techniques --- Graph Theory", treatment = "T Theoretical or Mathematical", } @Article{Abelson:1979:NTS, author = "Harold Abelson", title = "A note on time-space tradeoffs for computing continuous functions", journal = j-INFO-PROC-LETT, volume = "8", number = "4", pages = "215--217", day = "30", month = apr, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68B05 (68E10)", MRnumber = "80e:68011", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Lab. for Computer Sci., MIT, Cambridge, MA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "computational complexity; computing continuous functions; Euclidean space; time/space tradeoffs", 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/infoproc1970.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{Silva-Filho:1979:ACA, author = "Y. V. Silva-Filho", title = "Average Case Analysis of Region Search in Balanced $k$-$d$ Trees", journal = j-INFO-PROC-LETT, volume = "8", number = "5", pages = "219--223", day = "11", month = jun, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68B15 (68C25 68H05)", MRnumber = "81e:68018", MRreviewer = "Vijay V. Raghavan", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; 921; C6120 (File organisation); C6130 (Data handling techniques)", corpsource = "N.C.E. Univ., Federal Rio Janeiro, Rio de Janeiro, Brazil", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "balanced $k$-$d$ trees; computer programming; data handling; data processing --- Data Structures; data structures; file; information retrieval; mathematical techniques --- Trees; partial match query; region query; region search; simple query", treatment = "T Theoretical or Mathematical", } @Article{Broy:1979:MSP, author = "M. Broy and M. Wirsing and J.-P. Finance and A. Qu{\'e}r{\'e} and J.-L. Remy", title = "Methodical Solution of the Problem of Ascending Subsequences of Maximum Length Within a Given Sequence", journal = j-INFO-PROC-LETT, volume = "8", number = "5", pages = "224--229", day = "11", month = jun, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68B05 (68E99)", MRnumber = "80e:68013", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Inst. f{\"u}r Informatik der Tech. Univ., Munchen, Munchen, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "abstract types; algorithm; ascending subsequences; computer programming; program formation; programming theory", treatment = "T Theoretical or Mathematical", } @Article{Leipala:1979:GBS, author = "Timo Leip{\"a}l{\"a}", title = "On a Generalization of Binary Search", journal = j-INFO-PROC-LETT, volume = "8", number = "5", pages = "230--233", day = "11", month = jun, 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 = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory); C6130 (Data handling techniques)", corpsource = "Inst. of 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 = "algorithm analysis; binary search; computer programming; data handling; programming theory", treatment = "T Theoretical or Mathematical", } @Article{Bini:1979:CAM, author = "Dario Bini and Milvio Capovani and Francesco Romani and Grazia Lotti", title = "{$ O(n^{2.7799}) $} complexity for $ n \times n $ approximate matrix multiplication", journal = j-INFO-PROC-LETT, volume = "8", number = "5", pages = "234--235", day = "11", month = jun, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C05 (68C25)", MRnumber = "80h:68024", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4140 (Linear algebra); C4240 (Programming and algorithm theory)", corpsource = "Istituto di Mat., Univ. of Pisa, Pisa, Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "algorithm analysis; computational complexity; matrix algebra; matrix multiplication", treatment = "T Theoretical or Mathematical", } @Article{Shiloach:1979:FEC, author = "Yossi Shiloach", title = "A fast equivalence-checking algorithm for circular lists", journal = j-INFO-PROC-LETT, volume = "8", number = "5", pages = "236--238", day = "11", month = jun, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C05 (68C25)", MRnumber = "80h:68032", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C6130 (Data handling techniques)", corpsource = "Computer Sci. Dept., Stanford Univ., Stanford, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "circular lists; computer programming; data processing; equivalence checking algorithm; list processing; polygons", treatment = "T Theoretical or Mathematical", } @Article{Reising:1979:NRF, author = "Wolfgang Reising", title = "A note on the representation of finite tree automata", journal = j-INFO-PROC-LETT, volume = "8", number = "5", pages = "239--240", day = "11", month = jun, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68D35", MRnumber = "80e:68154", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory)", corpsource = "Rheinish-Westfalisch-Tech., Hochschule, Aachen, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "finite automata; finite tree automata; graph theory; nets; states; transitions", treatment = "T Theoretical or Mathematical", } @Article{vanderKnijff:1979:CCB, author = "D. {Van der Knijff} and J.-L. Lassez", title = "A clarification of the comparison between some measures of software science", journal = j-INFO-PROC-LETT, volume = "8", number = "5", pages = "241--243", day = "11", month = jun, 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Dept. of Computer Sci., Univ. of Melbourne, Melbourne, Vic., Australia", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "algorithm theory; software physics; software science", treatment = "T Theoretical or Mathematical", } @Article{Bentley:1979:DSP, author = "Jon Louis Bentley", title = "Decomposable Searching Problems", journal = j-INFO-PROC-LETT, volume = "8", number = "5", pages = "244--251", day = "11", month = jun, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68G20 (68C05 68E05)", MRnumber = "81c:68075", MRreviewer = "Fujio Nishida", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory); C6130 (Data handling techniques)", corpsource = "Dept. of Computer Sci. and Math., Carnegie-Mellon Univ., Pittsburgh, PA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "computational complexity; concrete computational complexity; data handling; data processing; data structures; software engineering", treatment = "T Theoretical or Mathematical", } @Article{Loizou:1979:MSD, author = "Georghios Loizou", title = "Mathematical Solution for a Data Processing System", journal = j-INFO-PROC-LETT, volume = "8", number = "5", pages = "252--256", day = "11", month = jun, 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 = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "461; 723; C4210 (Formal logic); C6130 (Data handling techniques)", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "biomedical engineering; Boolean algebra; Boolean matrices; data handling; data processing; data processing system; file organisation; files", treatment = "T Theoretical or Mathematical", } @Article{Ruohonen:1979:DFD, author = "Keijo Ruohonen", title = "The decidability of the {F0L-D0L} equivalence problem", journal = j-INFO-PROC-LETT, volume = "8", number = "5", pages = "257--260", day = "11", month = jun, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68F05", MRnumber = "81k:68063", MRreviewer = "A. Salomaa", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Math. Dept., Tampere Univ. of Technol., Tampere, Finland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "computability and decidability; decidability; DOL system; equivalence; FOL system; formal languages", treatment = "T Theoretical or Mathematical", } @Article{Fischer:1979:IED, author = "C. N. Fischer and K. C. Tai and D. R. Milton", title = "Immediate error detection in strong {$ {\rm LL}(1) $} parsers", journal = j-INFO-PROC-LETT, volume = "8", number = "5", pages = "261--266", day = "11", month = jun, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68F25", MRnumber = "80f:68097", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C4210 (Formal logic)", corpsource = "Univ. of Wisconsin, Madison, WI, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "computer operating systems; context free grammars; context-free grammars; error detection; strong LL(1) parsers; tabular parsing techniques", treatment = "T Theoretical or Mathematical", } @Article{Gurari:1979:SCR, author = "Eitan M. Gurari and Oscar H. Ibarra", title = "On the Space Complexity of Recursive Algorithms", journal = j-INFO-PROC-LETT, volume = "8", number = "5", pages = "267--271", day = "11", month = jun, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C05 (68C25)", MRnumber = "80j:68024", MRreviewer = "R. K. Shyamasundar", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; 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 programming; recursive algorithm; space complexity", treatment = "T Theoretical or Mathematical", } @Article{Rosenberg:1979:NPE, author = "Arnold L. Rosenberg", title = "A note on paths embedded in trees", journal = j-INFO-PROC-LETT, volume = "8", number = "5", pages = "272--273", day = "11", month = jun, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E10", MRnumber = "80e:68172", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Math. Sci. Dept., IBM Watson Res. Center, Yorktown Heights, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "computational complexity; graph theory; paths; trees; trees (mathematics)", treatment = "T Theoretical or Mathematical", } @Article{Soundararajan:1979:APT, author = "N. Soundararajan", title = "Axiomatic proofs of total correctness of programs", journal = j-INFO-PROC-LETT, volume = "8", number = "5", pages = "274--277", day = "11", month = jun, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68B10", MRnumber = "80g:68020", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "NCSDCT, Tata Inst. of Fundamental Res., Bombay, India", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "axiomatic proofs; programming theory; termination; total correctness; while loop", treatment = "T Theoretical or Mathematical", } @Article{Yuval:1979:CSP, author = "G. Yuval", title = "Corrigendum: {``A simple proof of Strassen's result'' (Inform. Process. Lett. {\bf 7} (1978), no. 6, 285--286)}", journal = j-INFO-PROC-LETT, volume = "8", number = "5", pages = "278--278", day = "11", month = jun, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25", MRnumber = "80c:68035", bibdate = "Sat Apr 11 16:45:20 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", note = "See \cite{Yuval:1978:SPS}.", acknowledgement = ack-nhfb, fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", } @Article{Gunn:1979:IC, author = "Hamish I. E. Gunn and Ronald Morrison", title = "On the implementation of constants", journal = j-INFO-PROC-LETT, volume = "9", number = "1", pages = "1--4", day = "20", month = jul, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Tue Nov 17 17:27:13 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C6110 (Systems analysis and programming)", corpsource = "Dept. of Computational Sci., Univ. of St. Andrews, Fife, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "constants implementation; L-value; programming", treatment = "T Theoretical or Mathematical", } @Article{Veloso:1979:CRP, author = "P. A. S. Veloso", title = "Characterizing the regular prefix codes and right power-bounded languages", journal = j-INFO-PROC-LETT, volume = "9", number = "1", pages = "5--7", day = "20", month = jul, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "94B45 (68D45 68F05)", MRnumber = "80g:94065", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory)", corpsource = "Dept. de Informatica, Pontificia Univ. Catolica do Rio de Janeiro, Rio de Janeiro, Brazil", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "finite automata; regular prefix codes; right power bounded language", treatment = "A Application; G General Review", } @Article{Cherniavsky:1979:NCT, author = "John C. Cherniavsky and John Keohane and Peter B. Henderson", title = "A note concerning top down program development and restricted exit control structures", journal = j-INFO-PROC-LETT, volume = "9", number = "1", pages = "8--12", day = "20", month = jul, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68B05", MRnumber = "80i:68006", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm 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 = "exit control structure; programming theory; structured programming; top down program", treatment = "T Theoretical or Mathematical", } @Article{Berry:1979:UDR, author = "D. M. Berry and R. L. Schwartz", title = "United and discriminated record types in strongly typed languages", journal = j-INFO-PROC-LETT, volume = "9", number = "1", pages = "13--18", day = "20", month = jul, 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Faculty of Math., Weizmann Inst. of Sci., Rehovot, Israel", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "discriminated record; programming theory; strongly typed languages", treatment = "T Theoretical or Mathematical", } @Article{Eberlein:1979:NMS, author = "P. J. Eberlein", title = "A note on median selection and spider production", journal = j-INFO-PROC-LETT, volume = "9", number = "1", pages = "19--22", day = "20", month = jul, 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "State Univ. of New York, Buffalo, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "Hasse diagram; median selection; programming theory; spider production", treatment = "A Application; G General Review", } @Article{Bykat:1979:PS, author = "A. Bykat", title = "On polygon similarity", journal = j-INFO-PROC-LETT, volume = "9", number = "1", pages = "23--25", day = "20", month = jul, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68G10 (68C25)", MRnumber = "80e:68218", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "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; graph theory; polygon similarity", treatment = "T Theoretical or Mathematical", } @Article{Jonkers:1979:FGC, author = "H. B. M. Jonkers", title = "A fast garbage compaction algorithm", journal = j-INFO-PROC-LETT, volume = "9", number = "1", pages = "26--30", day = "20", month = jul, 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation)", corpsource = "Math. Centre, Amsterdam, Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "garbage compaction algorithm; storage elements; storage management", treatment = "A Application; T Theoretical or Mathematical", } @Article{Manacher:1979:NGN, author = "Glenn K. Manacher and Albert L. Zobrist", title = "Neither the {Greedy} nor the {Delaunay} triangulation of a planar point set approximates the optimal triangulation", journal = j-INFO-PROC-LETT, volume = "9", number = "1", pages = "31--34", day = "20", month = jul, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25", MRnumber = "81e:68049", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics)", corpsource = "Dept. of Information Engng., Computer Center, Univ. of Illinois, Urbana, IL, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "Delaunay triangulation; graph theory; Greedy triangulation; planar point set approximate", treatment = "T Theoretical or Mathematical", } @Article{DeMillo:1979:ICS, author = "R. A. {De Millo} and R. E. Miller", title = "Implicit computation of synchronization primitives", journal = j-INFO-PROC-LETT, volume = "9", number = "1", pages = "35--38", day = "20", month = jul, 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C6110 (Systems analysis and programming)", 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 = "implicit computation; programming; synchronization primitives", treatment = "A Application; G General Review", } @Article{Lao:1979:NDS, author = "Marek J. Lao", title = "A new data structure for the {UNION-FIND} problem", journal = j-INFO-PROC-LETT, volume = "9", number = "1", pages = "39--45", day = "20", month = jul, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25 (04-04 68B15)", MRnumber = "80i:68035", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Inst. Informatyki, Univ. Warszawskiego, Warszawa, Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "computational complexity; data structures; trees (mathematics); union find problem", treatment = "A Application; T Theoretical or Mathematical", } @Article{Bini:1979:LBC, author = "Dario Bini and Milvio Capovani", title = "Lower bounds of the complexity of linear algebras", journal = j-INFO-PROC-LETT, volume = "9", number = "1", pages = "46--47", day = "20", month = jul, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25 (12-04)", MRnumber = "82h:68062", MRreviewer = "Ondrej S\'ykora", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4140 (Linear algebra); C4240 (Programming and algorithm theory)", corpsource = "Istituto di Matematica, Univ. di Pisa, Pisa, Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "computational complexity; linear algebra; lower bound; m-dimensional vector; tensorial rank", treatment = "T Theoretical or Mathematical", } @Article{Yao:1979:NCK, author = "Andrew C. Yao", title = "A note on a conjecture of {Kam} and {Ullman} concerning statistical databases", journal = j-INFO-PROC-LETT, volume = "9", number = "1", pages = "48--50", day = "20", month = jul, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68B15", MRnumber = "81a:68028", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C0310 (EDP management)", corpsource = "Computer Sci. Dept., Stanford Univ., Stanford, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "database management systems; security of data; statistical databases", treatment = "A Application; G General Review", } @Article{Nijholt:1979:LRG, author = "A. Nijholt", title = "From left-regular to {Greibach} normal form grammars", journal = j-INFO-PROC-LETT, volume = "9", number = "1", pages = "51--55", day = "20", month = jul, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68F05", MRnumber = "80e:68189", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Math., Vrije Univ., Amsterdam, Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "context-free grammars; Greibach normal form grammars; homomorphism; left regular grammars; right regular grammars", treatment = "T Theoretical or Mathematical", } @Article{Brown:1979:SOR, author = "M. R. Brown", title = "Some observations on random $2$-$3$ trees", journal = j-INFO-PROC-LETT, volume = "9", number = "2", pages = "57--59", day = "17", month = aug, 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics)", 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 = "random 2-3 trees; trees (mathematics)", treatment = "T Theoretical or Mathematical", } @Article{Grabowski:1979:USP, author = "Jan Grabowski", title = "The unsolvability of some {Petri} net language problems", journal = j-INFO-PROC-LETT, volume = "9", number = "2", pages = "60--63", day = "17", month = aug, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68B20 (68C30 68D25)", MRnumber = "80j:68017", MRreviewer = "J. Paredaens", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4230D (Sequential switching theory)", corpsource = "Sektion Math, Humboldt-Univ., Berlin, East Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "equality problem; formal languages; nondeterministic generalized sequential machines; Petri net language problems; sequential machines; unsolvability", treatment = "T Theoretical or Mathematical", } @Article{Teskey:1979:DRU, author = "F. N. Teskey", title = "Document retrieval using associative processors", journal = j-INFO-PROC-LETT, volume = "9", number = "2", pages = "64--67", day = "17", month = aug, 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C6140D (High level languages)", corpsource = "Dept. of Computer Sci., Univ. Coll., Swansea, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "associative processors; Boolean search commands; document retrieval system; problem oriented languages; programming language; SIMD processor", treatment = "T Theoretical or Mathematical", } @Article{Yao:1979:GIN, author = "F. Frances Yao", title = "Graph $2$-isomorphism is {NP}-complete", journal = j-INFO-PROC-LETT, volume = "9", number = "2", pages = "68--72", day = "17", month = aug, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25 (03D15 05C99)", MRnumber = "80j:68037", MRreviewer = "R. K. Shyamasundar", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics)", corpsource = "Computer Sci. Dept., Stanford Univ., Stanford, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "graph 2 isomorphism; graph theory", treatment = "T Theoretical or Mathematical", } @Article{Nozaki:1979:NCA, author = "Akihiro Nozaki", title = "A note on the complexity of approximative evaluation of polynomials", journal = j-INFO-PROC-LETT, volume = "9", number = "2", pages = "73--75", day = "17", month = aug, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25", MRnumber = "80i:68036", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4130 (Interpolation and function approximation); C4240 (Programming and algorithm theory)", corpsource = "Natural Sci. Div., Internat. Christian Univ., Mitaka, Tokyo, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "approximative evaluation; complexity; computational complexity; function approximation; polynomials", treatment = "T Theoretical or Mathematical", } @Article{Schwartz:1979:AAP, author = "R. L. Schwartz", title = "Aliasing among pointers in {EUCLID}", journal = j-INFO-PROC-LETT, volume = "9", number = "2", pages = "76--79", day = "17", month = aug, 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C6140D (High level languages)", 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 = "aliasing; EUCLID; parameters; PASCAL; pointers; procedure oriented languages; programming language", treatment = "T Theoretical or Mathematical", } @Article{Luk:1979:PMM, author = "W. S. Luk", title = "{`Possible'} membership of a multivalued dependency in a relational database", journal = j-INFO-PROC-LETT, volume = "9", number = "2", pages = "80--83", day = "17", month = aug, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68B15", MRnumber = "81a:68025", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C6160D (Relational databases)", corpsource = "Dept. of Computing Sci., Simon Fraser Univ., Burnaby, BC, Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "database management systems; DBMS; functional dependency; membership problem; multivalued dependency; relational database", treatment = "T Theoretical or Mathematical", } @Article{Ehrenfeucht:1979:OSG, author = "Andrzej Ehrenfeucht and Grzegorz Rozenberg", title = "An observation on scattered grammars", journal = j-INFO-PROC-LETT, volume = "9", number = "2", pages = "84--85", day = "17", month = aug, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68F05", MRnumber = "80i:68058", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.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 = "context sensitive grammars; context-sensitive grammars; recursively enumerable languages; scattered context languages; scattered grammars", treatment = "T Theoretical or Mathematical", } @Article{Ehrenfeucht:1979:FHB, author = "Andrzej Ehrenfeucht and Grzegorz Rozenberg", title = "Finding a homomorphism between two words is {NP}-complete", journal = j-INFO-PROC-LETT, volume = "9", number = "2", pages = "86--88", day = "17", month = aug, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25 (68F05)", MRnumber = "80j:68030", MRreviewer = "R. K. Shyamasundar", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.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 = "formal language theory; formal languages; homomorphism; NP completeness; words", treatment = "T Theoretical or Mathematical", } @Article{Srinivasan:1979:NRD, author = "B. Srinivasan and V. Rajaraman", title = "On the normalization of relational databases", journal = j-INFO-PROC-LETT, volume = "9", number = "2", pages = "89--92", day = "17", month = aug, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68B15", MRnumber = "80i:68018", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C6160D (Relational databases)", corpsource = "Indian Inst. of Technol., Kanpur, India", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "application problem; Codd's third normal form; database management systems; DBMS; formal logic; logical database design; primitive functional dependencies; relational databases", treatment = "T Theoretical or Mathematical", } @Article{Sengupta:1979:ICP, author = "A. Sengupta and S. Bandyopadhyay and P. K. Srimani", title = "On identification of {CR} property in file organisation", journal = j-INFO-PROC-LETT, volume = "9", number = "2", pages = "93--96", day = "17", month = aug, 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation)", corpsource = "Indian Statistical Inst., Calcutta, India", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "consecutive retrieval property; consecutive storage locations; CR property; file organisation; information retrieval; queries", treatment = "T Theoretical or Mathematical", } @Article{Grant:1979:PVT, author = "John Grant", key = "Grant", title = "Partial Values in a Tabular Database Model", journal = j-INFO-PROC-LETT, volume = "9", number = "2", pages = "97--99", day = "17", month = aug, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68B15", MRnumber = "80i:68015", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", abstract = "none", acknowledgement = ack-nhfb, classification = "C6160D (Relational databases)", corpsource = "Computer and Information Sci., Univ. of Florida, Gainesville, FL, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "database management systems; partial values; Partial values, relational database; relational database; tabular database model", owner = "curtis", treatment = "T Theoretical or Mathematical", } @Article{Jackowski:1979:CSD, author = "Boguslaw L. Jackowski and Ryszard Kubiak and Stefan Soko{\l}owski", title = "Complexity of sorting by distributive partitioning", journal = j-INFO-PROC-LETT, volume = "9", number = "2", pages = "100--100", day = "17", month = aug, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25 (68E05)", MRnumber = "80i:68032", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C6130 (Data handling techniques)", corpsource = "Inst. of Math., Univ. of Gdansk, Gdansk, Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "distributive partitioning; sorting; time complexity", treatment = "T Theoretical or Mathematical", } @Article{Friedman:1979:EOD, author = "Daniel P. Friedman and David S. Wise", title = "Erratum: {``Output Driven Interpretation of Recursive Programs, or Writing Creates and Destroys Data Structures''}", journal = j-INFO-PROC-LETT, volume = "9", number = "2", pages = "101--101", day = "17", month = aug, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C25 (68E05)", MRnumber = "80i:68032", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", note = "See \cite{Friedman:1976:ODI}.", acknowledgement = ack-nhfb, classification = "C6130 (Data handling techniques)", corpsource = "Inst. of Math., Univ. of Gdansk, Gdansk, Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "distributive partitioning; sorting; time complexity", treatment = "T Theoretical or Mathematical", } @Article{Best:1979:NPC, author = "Eike Best", title = "A note on the proof of a concurrent program", journal = j-INFO-PROC-LETT, volume = "9", number = "3", pages = "103--104", day = "5", month = oct, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68B10", MRnumber = "81c:68009", MRreviewer = "Michael Bauer", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Computer Lab., Univ. of Newcastle upon Tyne, Newcastle upon Tyne, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "concurrent program; multiprogramming; programming theory; proof", treatment = "T Theoretical or Mathematical", } @Article{Fournier:1979:CAN, author = "Alain Fournier and Zvi Kedem", title = "Comments on the all nearest-neighbor problem for convex polygons", journal = j-INFO-PROC-LETT, volume = "9", number = "3", pages = "105--107", day = "5", month = oct, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Tue Nov 17 17:45:00 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", note = "See \cite{Lee:1978:ANN,Yang:1979:NAN}.", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics)", corpsource = "Programs in Math. Sci., Univ. of Texas, Richardson, TX, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "convex polygons; nearest neighbour problem; topology", treatment = "A Application; T Theoretical or Mathematical", } @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/infoproc1970.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{Mitchell:1979:LAE, author = "Sandra L. Mitchell and Stephen Hedetniemi", title = "Linear algorithms for edge-coloring trees and unicyclic graphs", journal = j-INFO-PROC-LETT, volume = "9", number = "3", pages = "110--112", day = "5", month = oct, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E10 (05C15)", MRnumber = "81d:68087", MRreviewer = "Y. L. Varol", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics)", 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 = "computational complexity; edge colouring trees; graph theory; linear algorithm; trees (mathematics); unicyclic graphs", treatment = "T Theoretical or Mathematical", } @Article{Arora:1979:MAT, author = "R. K. Arora and S. P. Rana", title = "On module assignment in two-processor distributed systems", journal = j-INFO-PROC-LETT, volume = "9", number = "3", pages = "113--117", day = "5", month = oct, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68B20 (90B35)", MRnumber = "80i:68019", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics)", 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 processing; distributed systems; graph theory; linear time complexity algorithm; module assignment; tree structure", treatment = "A Application; T Theoretical or Mathematical", } @Article{Itai:1979:RAC, author = "Alon Itai", title = "A randomized algorithm for checking equivalence of circular lists", journal = j-INFO-PROC-LETT, volume = "9", number = "3", pages = "118--121", day = "5", month = oct, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C05 (68C25)", MRnumber = "80m:68032", MRreviewer = "Walter Stromquist", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics)", corpsource = "Computer Sci. Div., Univ. of California, Berkeley, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "circular lists; equivalence; equivalence classes; randomised algorithm", treatment = "T Theoretical or Mathematical", } @Article{Williams:1979:TCG, author = "M. H. Williams and A. R. Bulmer", title = "A transportable code generator generator system", journal = j-INFO-PROC-LETT, volume = "9", number = "3", pages = "122--125", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C6150C (Compilers, interpreters and other processors)", corpsource = "Dept. of Computer Sci. and Appl. Math., Rhodes Univ., Grahamstown, South Africa", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "code generator generator system; program compilers; software portability; transportability", treatment = "A Application; T Theoretical or Mathematical", } @Article{Ferrari:1979:DLT, author = "M. Ferrari and G. Guida", title = "{DB}: {A} {LISP}-type data base system", journal = j-INFO-PROC-LETT, volume = "9", number = "3", pages = "126--134", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation); C6160 (Database management systems (DBMS))", corpsource = "Milan Polytech., Milan, Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "data base management facility; data base system; database management systems; DB; file organisation; LISP", treatment = "A Application; T Theoretical or Mathematical", } @Article{Yehudai:1979:NPL, author = "Amiram Yehudai", title = "A note on the pumping lemma for regular languages", journal = j-INFO-PROC-LETT, volume = "9", number = "3", pages = "135--136", day = "5", month = oct, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68F10 (68D45)", MRnumber = "80i:68066", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory)", corpsource = "Tel-Aviv Univ., Tel-Aviv, Israel", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "finite automata; finite automaton; pumping lemma; regular languages", treatment = "A Application; T Theoretical or Mathematical", } @Article{Itano:1979:RPS, author = "K. Itano", title = "Reduction of page swaps on the two dimensional transforms in a paging environment", journal = j-INFO-PROC-LETT, volume = "9", number = "3", pages = "137--140", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation)", corpsource = "Inst. of Information Sci. and Electronics, Univ. of Tsukuba, Ibaraki-ken, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "data structures; matrix; page swaps; paging environment; real memory; two dimensional transforms; virtual storage", treatment = "A Application; 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/infoproc1970.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{Prini:1979:SIS, author = "Gianfranco Prini", title = "Stack implementation of shallow binding in languages with mixed scoping", journal = j-INFO-PROC-LETT, volume = "9", number = "3", pages = "143--154", day = "5", month = oct, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C01", MRnumber = "81b:68033", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation); C6140D (High level languages)", corpsource = "Istituto di Sci. dell'Informazione, Univ. 'degli Studi di Pisa, Pisa, Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "file organisation; languages; mixed scoping; procedure oriented languages; shallow binding; stack implementation", treatment = "A Application; T Theoretical or Mathematical", } @Article{Langmaack:1979:FTP, author = "Hans Langmaack and Wolfram Lippe and Franz Wagner", title = "The formal termination problem for programs with finite {ALGOL} $ 68$-modes", journal = j-INFO-PROC-LETT, volume = "9", number = "3", pages = "155--159", day = "5", month = oct, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C30", MRnumber = "80m:68045", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C6140D (High level languages)", corpsource = "Inst. f{\"u}r Informatik Praktische Math., Univ. Kiel, Kiel, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "ALGOL 60; compiler constructors; conditional statements; finite ALGOL68 modes; formal termination; nondeterministic alternative statements; procedure oriented languages; solvability proof", treatment = "A Application; T Theoretical or Mathematical", } @Article{Harel:1979:ETR, author = "D. Harel", title = "Erratum: {``Two results on process logic''}", journal = j-INFO-PROC-LETT, volume = "9", number = "3", pages = "160--160", day = "5", month = oct, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68B05", MRnumber = "81b:68007b", bibdate = "Sat Apr 11 12:24:20 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", note = "See \cite{Harel:1979:TRP}.", acknowledgement = ack-nhfb, fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", } @Article{Franklin:1979:PLS, author = "W. Randolph Franklin", title = "Padded lists: set operations in expected {$ \theta (\log \log N) $} time", journal = j-INFO-PROC-LETT, volume = "9", number = "4", pages = "161--166", day = "20", month = nov, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68H05 (68B15 68C25)", MRnumber = "80i:68087", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation)", corpsource = "Electrical and Systems Engng. Dept., Rensselaer Polytech. Inst., Troy, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "list processing; padded list; periodic reformatting; preplanned gaps; set operations", treatment = "T Theoretical or Mathematical", } @Article{Leung:1979:BLS, author = "Joseph Y.-T.-T. Leung", title = "Bounds on list scheduling of {UET} tasks with restricted resource constraints", journal = j-INFO-PROC-LETT, volume = "9", number = "4", pages = "167--170", day = "20", month = nov, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C15", MRnumber = "81b:68040", MRreviewer = "Eugene Levner", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation)", corpsource = "Dept. of Electrical Engng., Northwestern Univ., Evanston, IL, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "directed acyclic graph; execution; graph theory; identical processors; list processing; list scheduling; multiprocessing systems; multiprocessor computing system; restricted resource constraints; UET tasks", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Cockayne:1979:AME, author = "E. J. Cockayne and F. Ruskey and A. G. Thomason", title = "An algorithm for the most economic link addition in a tree communications network", journal = j-INFO-PROC-LETT, volume = "9", number = "4", pages = "171--175", day = "20", month = nov, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "94C15 (68C25)", MRnumber = "81g:94065", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "B0260 (Optimisation techniques); B6210 (Telecommunication applications)", corpsource = "Dept. of Math., Univ. of Victoria, Victoria, BC, Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "algorithm; branch; communication networks; economic link addition; economics; operating cost; optimisation; tree communications network; trees (mathematics); vertices", treatment = "E Economic; T Theoretical or Mathematical", } @Article{Moore:1979:MPT, author = "J. Strother Moore", title = "A mechanical proof of the termination of {Takeuchi}'s function", journal = j-INFO-PROC-LETT, volume = "9", number = "4", pages = "176--181", day = "20", month = nov, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68G15", MRnumber = "81f:68113", MRreviewer = "Luigia Aiello", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Computer Sci. Lab., SRI, Internat., Menlo Park, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "lexicographic combination; linear functions; programming theory; recursive equation; Takeuchi's function; termination; total function", treatment = "T Theoretical or Mathematical", } @Article{Akritas:1979:SPE, author = "A. G. Akritas", title = "On the solution of polynomial equations using continued fractions", journal = j-INFO-PROC-LETT, volume = "9", number = "4", pages = "182--184", day = "20", month = nov, 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4130 (Interpolation and function approximation)", corpsource = "Dept. of Appl. Math. II, Univ. of Athens, Athens, Greece", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "continued fractions; polynomial computing time bound; polynomial equations; polynomials; real roots", treatment = "T Theoretical or Mathematical", } @Article{Chandy:1979:DAP, author = "K. M. Chandy and J. Misra", title = "Deadlock absence proofs for networks of communicating processes", journal = j-INFO-PROC-LETT, volume = "9", number = "4", pages = "185--189", day = "20", month = nov, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68A05 (68C15)", MRnumber = "80m:68009", MRreviewer = "B. W. Stuck", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4290 (Other computer theory); C5620 (Computer networks and techniques)", corpsource = "Computer Sci. Dept., Univ. of Texas, Austin, TX, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "communicating processes; computation theory; computer metatheory; computer networks; deadlock absence proofs; labeled graph; message transmission; networks; processes; protocol; vertices", treatment = "P Practical", } @Article{Lee:1979:LMP, author = "D. T. Lee and C. C. Yang", title = "Location of multiple points in a planar subdivision", journal = j-INFO-PROC-LETT, volume = "9", number = "4", pages = "190--193", day = "20", month = nov, 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6130 (Data handling techniques)", corpsource = "Northwestern Univ., Evanston, IL, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "aerial images; calculation steps; computer storage; computerised picture processing; data handling; environmental planning; information; information retrieval; lines; manipulation; multiple points; pictorial data bases; planar subdivision; programming theory; regions", treatment = "P Practical", } @Article{Szwarcfiter:1979:SDR, author = "J. L. Szwarcfiter", title = "Systems of distinct representatives for $k$ families of sets", journal = j-INFO-PROC-LETT, volume = "9", number = "5", pages = "195--196", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics)", corpsource = "Univ. Federal do Rio de Janeiro, Rio de Janeiro, Brazil", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "bipartite graphs; distinct representatives; families of sets; maximum matchings; set theory", treatment = "T Theoretical or Mathematical", } @Article{Morris:1979:TBT, author = "J. M. Morris", title = "Traversing binary trees simply and cheaply", journal = j-INFO-PROC-LETT, volume = "9", number = "5", pages = "197--200", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Computer Sci., Trinity Coll., Dublin, Ireland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "binary trees; nodes; trees (mathematics)", treatment = "T Theoretical or Mathematical", } @Article{McCallum:1979:LAF, author = "Duncan McCallum and David Avis", title = "A linear algorithm for finding the convex hull of a simple polygon", journal = j-INFO-PROC-LETT, volume = "9", number = "5", pages = "201--206", day = "16", month = dec, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68C05", MRnumber = "80k:68021", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics)", corpsource = "School of Computer Sci., McGill Univ., Montreal, Que., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "convex hull; graph theory; linear algorithm; simple polygon; vertices", treatment = "T Theoretical or Mathematical", } @Article{Oulsnam:1979:CND, author = "G. Oulsnam", title = "Cyclomatic numbers do not measure complexity of unstructured programs", journal = j-INFO-PROC-LETT, volume = "9", number = "5", pages = "207--211", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "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/", keywords = "complexity; computational complexity; cyclomatic number; flowgraph programs; unstructured programs", treatment = "T Theoretical or Mathematical", } @Article{Dershowitz:1979:NSO, author = "Nachum Dershowitz", title = "A note on simplification orderings", journal = j-INFO-PROC-LETT, volume = "9", number = "5", pages = "212--215", day = "16", month = dec, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68B10", MRnumber = "81f:68021", MRreviewer = "David A. Plaisted", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "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 = "programming theory; simplification orderings; term rewriting systems; termination", 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/infoproc1970.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{Robson:1979:ECP, author = "J. M. Robson", title = "The emptiness of complement problem for semi extended regular expressions requires $ c^n $ space", journal = j-INFO-PROC-LETT, volume = "9", number = "5", pages = "220--222", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", 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 = "complement problem; emptiness; formal logic; semi extended regular expressions; set intersection", treatment = "T Theoretical or Mathematical", } @Article{Brown:1979:VDC, author = "Kevin Q. Brown", title = "{Voronoi} diagrams from convex hulls", journal = j-INFO-PROC-LETT, volume = "9", number = "5", pages = "223--228", day = "16", month = dec, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Tue Nov 17 17:46:04 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm 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 = "clustering; computational complexity; contour maps; convex hulls; minimum spanning trees; nearest neighbour problems; planar Voronoi diagrams", treatment = "T Theoretical or Mathematical", } @Article{Mitchell:1979:LAR, author = "Sandra L. Mitchell", title = "Linear algorithms to recognize outerplanar and maximal outerplanar graphs", journal = j-INFO-PROC-LETT, volume = "9", number = "5", pages = "229--232", day = "16", month = dec, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E10 (68C05)", MRnumber = "80k:68052", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Math. and Computer Sci., Univ. of Louisville, Louisville, KY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "graph recognition; graph theoretic computing; graph theory; maximal outerplanar graphs", treatment = "T Theoretical or Mathematical", } @Article{Slowinski:1979:CMP, author = "R. S{\l}owi{\'n}ski", title = "Cost-minimal preemptive scheduling of independent jobs with release and due dates on open shop under resource constraints", journal = j-INFO-PROC-LETT, volume = "9", number = "5", pages = "233--237", 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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "C1290F (Systems theory applications in industry)", corpsource = "Inst. of Control Engng., Tech. Univ. of Poznan, Poznan, Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "cost minimal preemptive scheduling; due dates; independent jobs; open shop under resource constraints; release dates; scheduling", 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/infoproc1970.bib", note = "See also errata \cite{Lloyd: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{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 = "Sun May 02 08:24:41 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", note = "See \cite{vanLeeuwen:1980:ELS}.", 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{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/infoproc1970.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{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/infoproc1970.bib", note = "See \cite{Andrew:1979:AEA}.", acknowledgement = ack-nhfb, fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", } @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/infoproc1970.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{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 = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib", note = "See \cite{Bykat:1978:CHF,Devai:1979:CCH,Fournier: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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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:24:50 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.bib", note = "See \cite{vanLeeuwen:1980:DDS}.", 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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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{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/infoproc1970.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{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/infoproc1970.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{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/infoproc1970.bib", note = "See \cite{Petreschi:1980:SAS}.", acknowledgement = ack-nhfb, fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", } @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/infoproc1970.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/infoproc1970.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{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/infoproc1970.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{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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.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/infoproc1970.bib", acknowledgement = ack-nhfb, classification = "723; C6120 (File organisation); C7250L