%%% -*-BibTeX-*- %%% ==================================================================== %%% BibTeX-file{ %%% author = "Nelson H. F. Beebe", %%% version = "1.04", %%% date = "02 May 2024", %%% time = "08:52:39 MST", %%% filename = "intjcomputinfsci.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", %%% URL = "https://www.math.utah.edu/~beebe", %%% checksum = "46393 8161 33464 329156", %%% email = "beebe at math.utah.edu, beebe at acm.org, %%% beebe at computer.org, beebe at ieee.org %%% (Internet)", %%% codetable = "ISO/ASCII", %%% keywords = "BibTeX, bibliography, International Journal %%% of Computer and Information Sciences", %%% license = "public domain", %%% supported = "yes", %%% docstring = "This is an almost complete bibliography of %%% the International Journal of Computer and %%% Information Sciences (CODEN IJCIAH, %%% 0091-7036) published by Plenum Press. %%% Publication began with volume 1 in March %%% 1972, ceased with volume 14 in December 1985, %%% when the journal was renamed the %%% International Journal of Parallel %%% Programming (CODEN IJPPE5, ISSN 0885-7458). %%% The latter is covered in a companion %%% bibliography, intjparallelprogram.bib. %%% %%% At version 1.04, the year coverage looked %%% like this: %%% %%% 1972 ( 20) 1977 ( 22) 1982 ( 25) %%% 1973 ( 19) 1978 ( 14) 1983 ( 27) %%% 1974 ( 19) 1979 ( 29) 1984 ( 27) %%% 1975 ( 22) 1980 ( 25) 1985 ( 30) %%% 1976 ( 20) 1981 ( 24) %%% %%% Article: 323 %%% %%% Total entries: 323 %%% %%% Data for the bibliography has been collected %%% from the INSPEC database (1972--1985), %%% from the MathSciNet database, from the %%% bibliographies in the TeX User Group %%% collection, from bibliographies in the %%% author's personal files, and from the computer %%% science bibliography collection on %%% ftp.ira.uka.de in /pub/bibliography to which %%% many people of have contributed. The %%% snapshot of this collection was taken on %%% 5-May-1994, and it consists of 441 BibTeX %%% files, 2,672,675 lines, 205,289 entries, and %%% 6,375 <at>String{} abbreviations, occupying %%% 94.8MB of disk space. %%% %%% 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.", %%% } %%% ====================================================================

%======================================================================= % Acknowledgement abbreviations:

@String{ack-nhfb= "Nelson H. F. Beebe, Center for Scientific Computing, University of Utah, Department of Mathematics, 110 LCB, 155 S 1400 E RM 233, Salt Lake City, UT 84112-0090, USA, Tel: +1 801 581 5254, FAX: +1 801 585 1640, +1 801 581 4148, e-mail: \path|beebe@math.utah.edu|, \path|beebe@acm.org|, \path|beebe@computer.org|, \path|beebe@ieee.org| (Internet), URL: \path|https://www.math.utah.edu/~beebe/|"}

%======================================================================= % Journal abbreviations:

@String{j-INT-J-COMPUT-INF-SCI= "International Journal of Computer and Information Sciences"}

%======================================================================= % Bibliography entries:

@Article{Simon:1972:APN, author = "J. C. Simon and G. Guiho", title = "On algorithms preserving neighborhood, to file and retrieve information in a memory", journal = j-INT-J-COMPUT-INF-SCI, volume = "1", number = "1", pages = "3--15", month = mar, year = "1972", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6130 (Data handling techniques)", corpsource = "Univ. Paris, France", keywords = "algorithms; approximation methods; binary search; distance; file; hash coding; memory; memory size; neighbourhood; number of access operations; probability properties; retrieve; storage management; variation properties", treatment = "P Practical", } @Article{Biss:1972:DSC, author = "K. O. Biss and R. T. Chien and F. A. Stahl", title = "A data structure for cognitive information retrieval", journal = j-INT-J-COMPUT-INF-SCI, volume = "1", number = "1", pages = "17--27", month = mar, year = "1972", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation); C7250 (Information storage and retrieval)", corpsource = "Univ. Illinois, Urbana-Champaign, IL, USA", keywords = "cognitive information retrieval; data structure; data structures; expressiveness; high order calculus; information retrieval; logical deduction; machine processing; natural language; question answering system", treatment = "P Practical", } @Article{Hunter:1972:DRC, author = "L. W. Hunter", title = "A data representation code for text processing systems", journal = j-INT-J-COMPUT-INF-SCI, volume = "1", number = "1", pages = "29--42", month = mar, year = "1972", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6130 (Data handling techniques); C7240 (Information analysis and indexing)", corpsource = "Univ. Wisconsin, Madison, WI, USA", keywords = "character strings; codes; data representation code; data structure; data structures; string processing; text editing; text processing systems", treatment = "P Practical", } @Article{Tou:1972:ARH, author = "J. T. Tou and R. C. Gonzalez", title = "Automatic recognition of handwritten characters via feature extraction and multi-level decision", journal = j-INT-J-COMPUT-INF-SCI, volume = "1", number = "1", pages = "43--65", month = mar, year = "1972", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "B6140C (Optical information, image and video signal processing); C1250 (Pattern recognition)", corpsource = "Univ. Florida, Gainesville, FL, USA", keywords = "alphanumeric; automatic recognition of handwritten characters; feature extraction; multilevel decision; pattern recognition; stylized forms", treatment = "T Theoretical or Mathematical; X Experimental", } @Article{Terrenoire:1972:EAI, author = "M. Terrenoire and M. Simonet", title = "An evaluation of {ALGOL} 68 for interrogation process algorithms", journal = j-INT-J-COMPUT-INF-SCI, volume = "1", number = "1", pages = "67--73", month = mar, year = "1972", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C7310 (Mathematics computing)", corpsource = "Faculte Sci. Lyon, Villeurbanne, France", keywords = "ALGOL; ALGOL 68; evaluation; interrogation process algorithms; pseudoquestionnaires; random process; random processes; subroutines", treatment = "P Practical", } @Article{Ibaraki:1972:IEP, author = "T. Ibaraki and T. K. Liu and C. R. Baugh and S. Muroga", title = "An implicit enumeration program for zero-one integer programming", journal = j-INT-J-COMPUT-INF-SCI, volume = "1", number = "1", pages = "75--92", month = mar, year = "1972", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "B0260 (Optimisation techniques); C1180 (Optimisation techniques)", keywords = "column vector; computer program; ILLIP; implicit enumeration program; integer programming; pseudo underlining; zero one integer programming", } @Article{Katzan:1972:AAR, author = "H. {Katzan, Jr.}", title = "An {APL} approach to the representation and manipulation of data structures", journal = j-INT-J-COMPUT-INF-SCI, volume = "1", number = "2", pages = "93--113", month = jun, year = "1972", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation); C6140D (High level languages)", corpsource = "Pratt Inst., Brooklyn, NY, USA", keywords = "APL; data structures; linked lists; manipulation; procedure oriented languages; queues; representation; sets; sort trees; stacks; strings; tables", treatment = "T Theoretical or Mathematical", } @Article{Inselberg:1972:TLS, author = "A. D. Inselberg and E. B. Altman", title = "{2-SLIDS}: a two-stage linked storage structure with link-dependent data capabilities", journal = j-INT-J-COMPUT-INF-SCI, volume = "1", number = "2", pages = "115--133", month = jun, year = "1972", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation)", corpsource = "IBM Res. Lab., San Jose, CA, USA", keywords = "2 stage; data definition flexibility; data structures; linked storage structure; physical compactness", treatment = "P Practical", } @Article{Fu:1972:SGL, author = "K. S. Fu and T. Huang", title = "Stochastic grammars and languages", journal = j-INT-J-COMPUT-INF-SCI, volume = "1", number = "2", pages = "135--170", month = jun, year = "1972", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Purdue Univ., Lafayette, IN, USA", keywords = "automata theory; formal languages; fuzzy grammars; grammars; indexed grammars; stochastic automata; stochastic grammars; stochastic nested stack automata; weighted grammars", treatment = "T Theoretical or Mathematical", } @Article{Bohm:1972:CAT, author = "C. Bohm and M. Dezani", title = "A {CUCH-machine}: the automatic treatment of bound variables", journal = j-INT-J-COMPUT-INF-SCI, volume = "1", number = "2", pages = "171--191", month = jun, year = "1972", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory)", corpsource = "Univ. Torino, Italy", keywords = "automata theory; automatic treatment; bound variables; CUCH; machine; memory structures", treatment = "T Theoretical or Mathematical", } @Article{Wells:1972:UDS, author = "M. B. Wells and J. B. Morris", title = "The unified data structure capability in {Madcap} {VI}", journal = j-INT-J-COMPUT-INF-SCI, volume = "1", number = "3", pages = "193--208", month = sep, year = "1972", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation)", corpsource = "Univ. California, Los Alamos, NM, USA", keywords = "data structures; Madcap VI; programming language; programming languages; selector; unified data structure capability", treatment = "P Practical", } @Article{Wile:1972:IBE, author = "D. S. Wile and C. M. Geschke", title = "An implementation base for efficient data structuring", journal = j-INT-J-COMPUT-INF-SCI, volume = "1", number = "3", pages = "209--224", month = sep, year = "1972", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation)", corpsource = "Carnegie-Mellon Univ., Pittsburgh, PA, USA", keywords = "binding of names; data allocation; data structures; efficient data structuring; implementation base; specification", } @Article{Wilkes:1972:ATD, author = "M. V. Wilkes", title = "Associative tabular data structures", journal = j-INT-J-COMPUT-INF-SCI, volume = "1", number = "3", pages = "225--233", month = sep, year = "1972", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C5220 (Computer architecture); C6120 (File organisation)", corpsource = "Univ. Cambridge, UK", keywords = "associative links; associative search operations; associative tabular data structures; core memory; data structures; microprogramming; microprogramming support", treatment = "T Theoretical or Mathematical", } @Article{Busam:1972:DSP, author = "V. A. Busam", title = "A dictionary structure for a {PL/1} compiler", journal = j-INT-J-COMPUT-INF-SCI, volume = "1", number = "3", pages = "235--253", month = sep, year = "1972", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation); C6140D (High level languages); C6150C (Compilers, interpreters and other processors)", corpsource = "Memorex Corp., Santa Clara, CA, USA", keywords = "data structures; dictionary; dictionary structure; format; PL/1; PL/1 compiler; program compilers; symbol table", } @Article{Maruyama:1972:PDI, author = "K. Maruyama", title = "A procedure to determine intersections between polyhedral objects", journal = j-INT-J-COMPUT-INF-SCI, volume = "1", number = "3", pages = "255--266", month = sep, year = "1972", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "B6140C (Optical information, image and video signal processing); C1250 (Pattern recognition)", corpsource = "Univ. Illinois, Urbana-Champaign, IL, USA", keywords = "analysis; intersections; parity mode; pattern recognition; polyhedral objects; procedure", treatment = "T Theoretical or Mathematical", } @Article{Mishelevich:1972:CSA, author = "D. J. Mishelevich", title = "Computer-based semantic analyzers", journal = j-INT-J-COMPUT-INF-SCI, volume = "1", number = "3", pages = "267--286", month = sep, year = "1972", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C7820 (Humanities computing)", corpsource = "Univ. Texas Southwestern Medical School, Dallas, TX, USA", keywords = "bibliographic retrieval; computer; computer aided analysis; content analysis; language translation and linguistics; machine translation; medical information retrieval systems; question and answer systems; semantic analyzers", treatment = "G General Review", } @Article{vanDam:1972:SII, author = "A. {van Dam}", title = "Some implementation issues relating to data structures for interactive graphics", journal = j-INT-J-COMPUT-INF-SCI, volume = "1", number = "4", pages = "287--314", month = dec, year = "1972", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation)", corpsource = "Brown Univ., Providence, RI, USA", keywords = "computer graphics; data structures; implementation; interactive graphics; programming languages; specification languages; storage structures; utility programs", treatment = "G General Review", } @Article{Wilkes:1972:ALA, author = "M. V. Wilkes and W. D. Manville", title = "The associative language {AL-1}", journal = j-INT-J-COMPUT-INF-SCI, volume = "1", number = "4", pages = "315--327", month = dec, year = "1972", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation); C6140D (High level languages); C6150E (General utility programs)", corpsource = "Univ. Cambridge, UK", keywords = "AL-1; associative language; associative tabular data structure manipulation; data structures; low level language; microprogramming; procedure oriented languages; table lookup; table searching; utility programs", treatment = "P Practical", } @Article{Lipovski:1972:DSC, author = "G. J. Lipovski", title = "Data structures in content-addressed cellular memories", journal = j-INT-J-COMPUT-INF-SCI, volume = "1", number = "4", pages = "329--353", month = dec, year = "1972", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation)", corpsource = "Univ. Florida, Gainesville, FL, USA", keywords = "associative memory; associative storage; content-addressable storage; context addressed cellular memories; data base searching; data structure; data structures; EXCLUSIVE-OR rail; OR rail; table lookup", treatment = "P Practical", } @Article{Hughes:1972:DUA, author = "C. E. Hughes", title = "Degrees of unsolvability associated with {Markov} algorithms", journal = j-INT-J-COMPUT-INF-SCI, volume = "1", number = "4", pages = "355--365", month = dec, year = "1972", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Pennsylvania State Univ., University Park, PA, USA", keywords = "algorithm theory; confluence problems; degrees of unsolvability; general halting; immortality problem; Markov algorithms; Markov processes; word problems", } @Article{Walk:1973:MSP, author = "K. Walk", title = "Modeling of storage properties of higher-level languages", journal = j-INT-J-COMPUT-INF-SCI, volume = "2", number = "1", pages = "1--24", month = mar, year = "1973", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation); C6140D (High level languages)", corpsource = "IBM Lab., Vienna, Austria", keywords = "data structures; high level languages; model; modelling; programming languages; storage properties", treatment = "T Theoretical or Mathematical", } @Article{Zalcstein:1973:SLS, author = "Y. Zalcstein", title = "On the semigroups of linear sequential machines", journal = j-INT-J-COMPUT-INF-SCI, volume = "2", number = "1", pages = "25--28", month = mar, year = "1973", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4230D (Sequential switching theory)", corpsource = "Univ. Copenhagen, Denmark", keywords = "characterization; linear sequential machines; nonsingular; semigroups; sequential machines", treatment = "T Theoretical or Mathematical", } @Article{Ivakhnenko:1973:PCS, author = "A. G. Ivakhnenko", title = "Problems of complex system modeling and applied mathematical statistics", journal = j-INT-J-COMPUT-INF-SCI, volume = "2", number = "1", pages = "49--60", month = mar, year = "1973", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C1220 (Simulation, modelling and identification)", corpsource = "Inst. Cybernetics, Acad. Sci., Kiev, Ukrainian SSR, USSR", keywords = "applied mathematical statistics; complex systems; data handling; group method of data handling; mathematical model; modelling; statistics", treatment = "T Theoretical or Mathematical", } @Article{Diday:1973:DCM, author = "E. Diday", title = "The dynamic clusters method in nonhierarchical clustering", journal = j-INT-J-COMPUT-INF-SCI, volume = "2", number = "1", pages = "61--88", month = mar, year = "1973", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics)", corpsource = "Inst. Recherche and Informatique, Rocquencourt, France", keywords = "algorithm; dynamic clusters method; finite set; nonhierarchical clustering; samplings; set theory", treatment = "T Theoretical or Mathematical", } @Article{Brunnstein:1973:SRI, author = "K. Brunnstein and J. W. Schmidt", title = "Structuring and retrieving information in computer-based learning", journal = j-INT-J-COMPUT-INF-SCI, volume = "2", number = "2", pages = "89--101", month = jun, year = "1973", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C7250 (Information storage and retrieval); C7810C (Computer-aided instruction)", corpsource = "Hamburg Univ., West Germany", keywords = "CAI; computer aided instruction; information; information retrieval; learner controlled instruction; learning; retrieving; structuring", } @Article{Babu:1973:APD, author = "C. Chitti Babu", title = "On the application of probabilistic distance measures for the extraction of features from imperfectly labeled patterns", journal = j-INT-J-COMPUT-INF-SCI, volume = "2", number = "2", pages = "103--114", month = jun, year = "1973", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "B6140C (Optical information, image and video signal processing); C1250 (Pattern recognition)", corpsource = "Univ. California, Irvine, CA, USA", keywords = "Bhattacharyya distance; divergence; equivocation; extraction of features; imperfectly identified patterns; Kalmogrov variational distance; Matusita distance; pattern recognition; probabilistic distance measures", treatment = "T Theoretical or Mathematical", } @Article{Rickman:1973:SIO, author = "J. Rickman and W. E. Walden", title = "Structures for an interactive on-line thesaurus", journal = j-INT-J-COMPUT-INF-SCI, volume = "2", number = "2", pages = "115--127", month = jun, year = "1973", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation); C7240 (Information analysis and indexing)", corpsource = "Pennsylvania State Univ., University Park, PA, USA", keywords = "data structure; data structures; display formats; file blocking; file structure; hashing function; interactive; online; partial spellings; plant pathology; sequential searches; thesauri; thesaurus; user command language", treatment = "P Practical", } @Article{Book:1973:SCG, author = "R. V. Book", title = "On the structure of context-sensitive grammars", journal = j-INT-J-COMPUT-INF-SCI, volume = "2", number = "2", pages = "129--139", month = jun, year = "1973", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Harvard Univ., Cambridge, MA, USA", keywords = "constraints; context sensitive grammars; context-sensitive grammars; rules; structure; weak generative capacity", treatment = "T Theoretical or Mathematical", } @Article{Payne:1973:PSL, author = "W. H. Payne", title = "Partial sorting: a large vector technique and its application", journal = j-INT-J-COMPUT-INF-SCI, volume = "2", number = "2", pages = "141--156", month = jun, year = "1973", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6130 (Data handling techniques)", corpsource = "Univ. Illinois, Urbana, Champaign, IL, USA", keywords = "algorithm; application; confidence intervals; large vector technique; partial sorting; programming theory; ranks; rejection procedure; sorting", treatment = "T Theoretical or Mathematical", } @Article{Bohm:1973:NCA, author = "C. Bohm and M. Dezani", title = "Notes on {`A CUCH-machine: the automatic treatment of bound variables'}", journal = j-INT-J-COMPUT-INF-SCI, volume = "2", number = "2", pages = "157--160", month = jun, year = "1973", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory)", corpsource = "Univ. Torino, Italy", keywords = "automata theory; automatic treatment; bound variables; CUCH; machine", treatment = "T Theoretical or Mathematical", } @Article{Findler:1973:PTR, author = "N. V. Findler and D. Chen", title = "On the problems of time, retrieval of temporal relations, causality, and coexistence", journal = j-INT-J-COMPUT-INF-SCI, volume = "2", number = "3", pages = "161--185", month = sep, year = "1973", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C1230 (Artificial intelligence); C6130 (Data handling techniques)", corpsource = "State Univ., New York, Buffalo, Amherst, MA, USA", keywords = "artificial intelligence; causality; coexistence; data handling; deductive inferences; intelligent; logical inconsistencies; question answering programs; retrieval of temporal relations; time", treatment = "P Practical; X Experimental", } @Article{Burke:1973:BFA, author = "J. M. Burke and J. T. Rickman", title = "Bitmaps and filters for attribute-oriented searches", journal = j-INT-J-COMPUT-INF-SCI, volume = "2", number = "3", pages = "187--200", month = sep, year = "1973", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation)", corpsource = "Pennsylvania State Univ., University Park, PA, USA", keywords = "attribute searches; bitmaps; blocking; data structures; file organisation; filters; inverted file structures; search lengths", treatment = "P Practical", } @Article{Spier:1973:MIP, author = "M. J. Spier", title = "A model implementation for protective domains", journal = j-INT-J-COMPUT-INF-SCI, volume = "2", number = "3", pages = "201--229", month = sep, year = "1973", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4290 (Other computer theory); C6130 (Data handling techniques); C6150J (Operating systems)", corpsource = "Digital Equipment Corp., Maynard, MA, USA", keywords = "controlled access; hardware/software mechanism; multi-access systems; protection; protective domains; security of data; sharable information structures; storage", treatment = "T Theoretical or Mathematical", } @Article{Jain:1973:EWF, author = "V. K. Jain", title = "{ECG} waveform feature extraction and its application to automated prognosis", journal = j-INT-J-COMPUT-INF-SCI, volume = "2", number = "3", pages = "231--247", month = sep, year = "1973", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C7330 (Biology and medical computing)", corpsource = "Univ. South Florida, Tampa, FL, USA", keywords = "automated prognosis; data compression; data reduction and analysis; ECG; electrocardiography; information compression; pattern recognition; waveform analysis; waveform feature extraction", treatment = "A Application; T Theoretical or Mathematical", } @Article{Rose:1973:TDF, author = "L. L. Rose and M. H. Gotterer", title = "A theory of dynamic file management in a multilevel store", journal = j-INT-J-COMPUT-INF-SCI, volume = "2", number = "4", pages = "249--256", month = dec, year = "1973", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation)", corpsource = "Pennsylvania State Univ., University Park, PA, USA", keywords = "dynamic file management; file configuration choice time; file movement time; file organisation; job run time; multilevel store; optimisation; storage management; throughput time", treatment = "T Theoretical or Mathematical", } @Article{Osteen:1973:CAB, author = "R. E. Osteen and J. T. Tou", title = "A clique-detection algorithm based on neighborhoods in graphs", journal = j-INT-J-COMPUT-INF-SCI, volume = "2", number = "4", pages = "257--268", month = dec, year = "1973", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "B6140C (Optical information, image and video signal processing); C1250 (Pattern recognition)", corpsource = "Univ. Florida, Gainesville, FL, USA", keywords = "algorithm; cliques; clustering; detection; graph theory; graphs; neighbourhoods; pattern recognition", treatment = "T Theoretical or Mathematical", } @Article{Clark:1973:PTO, author = "J. L. Clark", title = "{PATRICIA-II}. Two-level overlaid indexes for large libraries", journal = j-INT-J-COMPUT-INF-SCI, volume = "2", number = "4", pages = "269--292", month = dec, year = "1973", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C7210 (Information services and centres); C7240 (Information analysis and indexing); C7250 (Information storage and retrieval)", corpsource = "Univ. California, Los Alamos, NM, USA", keywords = "algorithm; Alphanumeric; core resident; FORTRAN program; indexing; information retrieval systems; large libraries; library mechanisation; lower index; overlaid indexes; PATRICIA-II; retrieve Information; two level; upper index", treatment = "P Practical", } @Article{Ealer:1973:DBO, author = "G. C. Ealer and N. F. Jensen and E. G. Monaco", title = "Data base organization and retrieval techniques for steam turbine engineering", journal = j-INT-J-COMPUT-INF-SCI, volume = "2", number = "4", pages = "293--309", month = dec, year = "1973", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation); C7100 (Business and administration); C7250 (Information storage and retrieval); C7490 (Computing in other engineering fields)", corpsource = "Westinghouse Electric Corp., Lester, PA, USA", keywords = "computer; data base organisation; file organisation; information retrieval; management information systems; retrieval techniques; steam turbine engineering; steam turbines", treatment = "P Practical", } @Article{Rozenberg:1973:ETL, author = "G. Rozenberg", title = "Extension of tabled {0L-systems} and languages", journal = j-INT-J-COMPUT-INF-SCI, volume = "2", number = "4", pages = "311--336", month = dec, year = "1973", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "State Univ. New York, Buffalo, Amherst, MA, USA", keywords = "extension; family of languages; formal languages; tabled 0L systems", treatment = "T Theoretical or Mathematical", } @Article{Cohen:1974:NTD, author = "J. Cohen and L. Trilling and P. Wegner", title = "A nucleus of a theorem-prover described in {ALGOL-68}", journal = j-INT-J-COMPUT-INF-SCI, volume = "3", number = "1", pages = "1--31", month = mar, year = "1974", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C1230 (Artificial intelligence); C4210 (Formal logic); C7310 (Mathematics computing)", corpsource = "Brandeis Univ., Waltham, MA, USA", keywords = "ALGOL 68 programs; Beth's method of semantic tableaux; computer aided analysis; nucleus; predicate calculus; subroutines; symbolic manipulation algorithms; theorem proving; tree method", treatment = "T Theoretical or Mathematical", } @Article{Bowdon:1974:STP, author = "E. K. {Bowdon, Sr.} and S. A. Mamrak and F. R. Salz", title = "A simulation tool for performance evaluation of the {IBM 360\slash 75}", journal = j-INT-J-COMPUT-INF-SCI, volume = "3", number = "1", pages = "33--57", month = mar, year = "1974", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6150G (Diagnostic, testing, debugging and evaluating systems); C6150J (Operating systems); C7430 (Computer engineering)", corpsource = "Univ. Illinois, Urbana-Champaign, IL, USA", keywords = "computer testing; CPU and memory utilization; dynamic priority assignment algorithm; GPSS model; IBM 360/75; improving system performance; job's total time in the system; load levelling; network computers; performance evaluation; resource utilization; simulation; simulation tool", treatment = "A Application; T Theoretical or Mathematical", } @Article{Ignizio:1974:HAS, author = "J. P. Ignizio and R. M. Harnett", title = "Heuristically aided set-covering algorithms", journal = j-INT-J-COMPUT-INF-SCI, volume = "3", number = "1", pages = "59--70", month = mar, year = "1974", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "B0260 (Optimisation techniques); C1180 (Optimisation techniques); C7310 (Mathematics computing)", corpsource = "Univ. Alabama, Huntsville, Al, USA", keywords = "computation time variance; computational efficiency; computer aided analysis; heuristic program; heuristically aided; increased problem size capability; integer programming; mathematical programming algorithms; reduced computational time; set covering algorithms", treatment = "A Application; T Theoretical or Mathematical", } @Article{Bouckaert:1974:CDGa, author = "A. Bouckaert", title = "Computer diagnosis of goiters. {IV}. Optimal planning of physical observations", journal = j-INT-J-COMPUT-INF-SCI, volume = "3", number = "1", pages = "71--92", month = mar, year = "1974", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "A8770E (Patient diagnostic methods and instrumentation); B7510 (Biomedical measurement and imaging); C7330 (Biology and medical computing)", corpsource = "Faculty Medicine, Kinshasa, Zaire", keywords = "computer aided analysis; computer diagnosis; diagnostic recognition; goiters; information theoretic criteria; optimal planning of physical observations; optimisation; ordered sequential observations; patient diagnosis; physical signs; stopping rules", treatment = "A Application; T Theoretical or Mathematical", } @Article{Shneiderman:1974:MOI, author = "B. Shneiderman", title = "A model for optimizing indexed file structures", journal = j-INT-J-COMPUT-INF-SCI, volume = "3", number = "1", pages = "93--103", month = mar, year = "1974", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation)", corpsource = "Indiana Univ., Bloomington, IN, USA", keywords = "access cost; accessing records; binary searching; data structures; file organisation; indexing; model; multilevel indexes; optimisation; optimizing indexed file structures; proper size of the index; retrieving; sequential searching; sorted files", treatment = "A Application; T Theoretical or Mathematical", } @Article{Minker:1974:MIR, author = "J. Minker and J. R. McSkimin and D. H. Fishman", title = "{MRPPS} --- an interactive refutation proof procedure system for question answering", journal = j-INT-J-COMPUT-INF-SCI, volume = "3", number = "2", pages = "105--122", month = jun, year = "1974", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C1230 (Artificial intelligence); C6130 (Data handling techniques)", corpsource = "Univ. Maryland, College Park, MD, USA", keywords = "data handling; heuristically; interactive refutation proof procedure; logical deductions; MRPPS; queries; search strategy; theorem proving", treatment = "P Practical", } @Article{Nishihara:1974:FTQ, author = "S. Nishihara and H. Hagiwara", title = "A full table quadratic search method eliminating secondary clustering", journal = j-INT-J-COMPUT-INF-SCI, volume = "3", number = "2", pages = "123--128", month = jun, year = "1974", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation); C6130 (Data handling techniques)", corpsource = "Kyoto Univ., Japan", keywords = "eliminating secondary clustering; file organisation; full table; hash tables; quadratic search method; table lookup", treatment = "A Application; T Theoretical or Mathematical", } @Article{Kandel:1974:AFL, author = "A. Kandel", title = "Application of fuzzy logic to the detection of static hazards in combinational switching systems", journal = j-INT-J-COMPUT-INF-SCI, volume = "3", number = "2", pages = "129--139", month = jun, year = "1974", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4230B (Combinatorial switching theory)", corpsource = "New Mexico Inst. Mining and Technol., Socorro, NM, USA", keywords = "combinational switching systems; combinatorial switching; detection; fuzzy logic; hazards and race conditions; static hazards", treatment = "T Theoretical or Mathematical", } @Article{Santos:1974:OAL, author = "E. S. Santos", title = "One-way acceptors and languages", journal = j-INT-J-COMPUT-INF-SCI, volume = "3", number = "2", pages = "141--151", month = jun, year = "1974", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Youngstown State Univ., OH, USA", keywords = "abstract families of deterministic languages; abstract families of languages; acceptors; formal languages; languages; one way", treatment = "T Theoretical or Mathematical", } @Article{Mateescu:1974:IPM, author = "C. A. Mateescu and I. O. Stamatescu", title = "On an information processing model applied to optical illusions and computer simulations", journal = j-INT-J-COMPUT-INF-SCI, volume = "3", number = "2", pages = "153--166", month = jun, year = "1974", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "B6140C (Optical information, image and video signal processing); C1250 (Pattern recognition)", keywords = "computer simulations; image processing; information processing; optical illusions; optical information processing; simulation; visual phenomena", treatment = "T Theoretical or Mathematical", } @Article{Stonebraker:1974:CPI, author = "M. Stonebraker", title = "The choice of partial inversions and combined indices", journal = j-INT-J-COMPUT-INF-SCI, volume = "3", number = "2", pages = "167--188", month = jun, year = "1974", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation)", corpsource = "Univ. California, Berkeley, CA, USA", keywords = "choice; combined indices; file; file organisation; interaction activity; partial inversions; probabilistic model; queries; secondary storage device; updates", treatment = "T Theoretical or Mathematical", } @Article{Earley:1974:SEU, author = "J. Earley", title = "Syntax extension using a run time model", journal = j-INT-J-COMPUT-INF-SCI, volume = "3", number = "3", pages = "189--196", month = sep, year = "1974", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation); C6140D (High level languages)", corpsource = "Univ. California, Berkeley, CA, USA", keywords = "augmented BNF notation; data structures; problem oriented languages; programming languages; run time model; specialised syntax; syntax extension", treatment = "A Application; T Theoretical or Mathematical", } @Article{Lindstrom:1974:ALS, author = "G. Lindstrom", title = "Algorithms for list structure condensation", journal = j-INT-J-COMPUT-INF-SCI, volume = "3", number = "3", pages = "197--216", month = sep, year = "1974", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation); C7250 (Information storage and retrieval)", corpsource = "Univ. Pittsburgh, PA, USA", keywords = "address identity comparison; data management; data structures; information storage; list processing; list structure condensation; minimally sized equivalent structure; redundancy; redundant information", treatment = "A Application; T Theoretical or Mathematical", } @Article{Minker:1974:RLR, author = "J. Minker and G. J. VanderBrug", title = "Representations of the language recognition problem for a theorem prover", journal = j-INT-J-COMPUT-INF-SCI, volume = "3", number = "3", pages = "217--250", month = sep, year = "1974", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C1230 (Artificial intelligence); C4210 (Formal logic)", corpsource = "Univ. Maryland, College Park, MD, USA", keywords = "Cocke parsing algorithm; cycle inference system; first order logic; formal languages; language recognition; recursive functions; recursive languages; resolution based systems; sentential forms; state space problems; state transformation method; theorem prover; theorem proving", treatment = "T Theoretical or Mathematical", } @Article{Lai:1974:RCT, author = "Hung Chi Lai and S. Muroga and T. Nakagawa", title = "Redundancy check technique for designing optimal networks by branch-and-bound method", journal = j-INT-J-COMPUT-INF-SCI, volume = "3", number = "3", pages = "251--271", month = sep, year = "1974", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C5210B (Computer-aided logic design)", corpsource = "Univ. Illinois, Urbana-Champaign, IL, USA", keywords = "branch and bound algorithm; computer-aided logic design; fan in; fan out; level restrictions; minimal NOR networks; optimal networks; redundancy; redundancy check", treatment = "T Theoretical or Mathematical", } @Article{Velasco:1974:SSD, author = "F. R. D. Velasco and C. {De-Renna e.Souza}", title = "Sequential syntactical decoding", journal = j-INT-J-COMPUT-INF-SCI, volume = "3", number = "4", pages = "273--287", month = dec, year = "1974", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "B6120B (Codes); B6140 (Signal processing and detection); C1260 (Information theory); C4210 (Formal logic)", corpsource = "Univ. Federal Rio de Janeiro, Brazil", keywords = "context-free languages; correction; decoding; error detection; Fano's algorithm; fault tolerant computing; location; minimum distance syntactical decoding algorithm; sequential decoding; sequential syntactical decoding; simulation; syntactical information", treatment = "T Theoretical or Mathematical", } @Article{Greibach:1974:SRW, author = "S. A. Greibach", title = "Some restrictions on {W}-grammars", journal = j-INT-J-COMPUT-INF-SCI, volume = "3", number = "4", pages = "289--327", month = dec, year = "1974", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Univ. California, Los Angeles, CA, USA", keywords = "ALGOL 68; context free grammars; context free languages; context-free grammars; index languages; normal regular based W grammars; programming languages; quasirealtime languages; simple W grammars; W grammars", treatment = "T Theoretical or Mathematical", } @Article{McCormick:1974:TSM, author = "B. H. McCormick and S. N. Jayaramamurthy", title = "Time series model for texture synthesis", journal = j-INT-J-COMPUT-INF-SCI, volume = "3", number = "4", pages = "329--343", month = dec, year = "1974", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "B6140C (Optical information, image and video signal processing); C1250 (Pattern recognition); C5540 (Terminals and graphic displays); C6130 (Data handling techniques)", corpsource = "Univ. Illinois, Chicago, IL, USA", keywords = "boundary conditions; computer graphics; digitized textural scene; pattern recognition; picture elements; pixels; seasonal time series; texture synthesis; time series model", treatment = "A Application; T Theoretical or Mathematical", } @Article{Bouckaert:1974:CDGb, author = "A. Bouckaert", title = "Computer diagnosis of goiters. The optimal size of optimal subsymptomatologies", journal = j-INT-J-COMPUT-INF-SCI, volume = "3", number = "4", pages = "345--362", month = dec, year = "1974", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "B6140C (Optical information, image and video signal processing); C1250 (Pattern recognition); C7330 (Biology and medical computing)", corpsource = "Faculty Medicine, Kinshasa, Zaire", keywords = "Bayesian inference; biomedical applications of computers; computer diagnosis; diagnostic recognition rate; goiters; identification; optimal size; optimal subsymptomatologies; optimisation; patient diagnosis; pattern recognition; sequential diagnosis; thyroid diseases; unbiased evaluation of performance", treatment = "A Application; T Theoretical or Mathematical", } @Article{McCormick:1975:DTM, author = "B. H. McCormick and S. N. Jayaramamurthy", title = "A decision theory method for the analysis of texture", journal = j-INT-J-COMPUT-INF-SCI, volume = "4", number = "1", pages = "1--38", month = mar, year = "1975", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "B0240E (Game theory); B6140C (Optical information, image and video signal processing); C1140E (Game theory); C1250 (Pattern recognition)", corpsource = "Univ. Illinois, Chicago, IL, USA", keywords = "acceptance set; decision theory and analysis; event; interval complexes; interval covering theory; likelihood ratio; local categorizer; operating characteristic curve; pattern recognition; statistical decision theory; textural feature detectors; texture analysis", treatment = "T Theoretical or Mathematical", } @Article{Treu:1975:OSD, author = "S. Treu", title = "On-line student debate: an experiment in communication using computer networks", journal = j-INT-J-COMPUT-INF-SCI, volume = "4", number = "1", pages = "39--51", month = mar, year = "1975", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C5620 (Computer networks and techniques); C7810 (Social and behavioural sciences computing)", corpsource = "Univ. Pittsburgh, PA, USA", keywords = "communication experiment; computer network; data communication systems; file based communication; hierarchical file structure; interpersonal communication; man computer interface; online debate; social and behavioural sciences", treatment = "X Experimental", } @Article{Wood:1975:NLS, author = "D. Wood", title = "A note on {Lindenmayer} systems, {Szilard} languages, spectra, and equivalence", journal = j-INT-J-COMPUT-INF-SCI, volume = "4", number = "1", pages = "53--62", month = mar, year = "1975", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "McMaster Univ., Hamilton, Ont., Canada", keywords = "computability and decidability; formal languages; Lindenmayer systems; regular languages; spectra: equivalence; Szilard languages", treatment = "T Theoretical or Mathematical", } @Article{DalCin:1975:FAT, author = "M. {Dal Cin}", title = "Fuzzy-state automata: their stability and fault tolerance", journal = j-INT-J-COMPUT-INF-SCI, volume = "4", number = "1", pages = "63--80", month = mar, year = "1975", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory)", corpsource = "Univ. T{\"u}bingen, West Germany", keywords = "almost periodic behaviour; error correction; fault tolerance; fault tolerant computing; finite automata; fixed point behaviour; fuzzy state automata; intermittent state transition errors; stability; tests", treatment = "T Theoretical or Mathematical", } @Article{DalCin:1975:MTF, author = "M. {Dal Cin}", title = "Modification tolerance of fuzzy-state automata", journal = j-INT-J-COMPUT-INF-SCI, volume = "4", number = "1", pages = "81--93", month = mar, year = "1975", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory)", corpsource = "Univ. T{\"u}bingen, West Germany", keywords = "fault masking; fault tolerance; fault tolerant computing; finite automata; fuzzy state; modification tolerance; permanent state transition errors; reliable languages; structural modifications; time variant", treatment = "T Theoretical or Mathematical", } @Article{Shyr:1975:LL, author = "H. J. Shyr and G. Thierrin", title = "Left-noncounting languages", journal = j-INT-J-COMPUT-INF-SCI, volume = "4", number = "1", pages = "95--102", month = mar, year = "1975", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Univ. Western Ontario, London, Ont., Canada", keywords = "automaton; code; combinatorial monoid; combinatorial right congruence; disjunctive subset; formal languages; free monoid; left combinatorial monoid; left noncounting language; power separating language; regular language; syntactic monoid", treatment = "T Theoretical or Mathematical", } @Article{Hoare:1975:RDS, author = "C. A. R. Hoare", title = "Recursive data structures", journal = j-INT-J-COMPUT-INF-SCI, volume = "4", number = "2", pages = "105--132", month = jun, year = "1975", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation)", corpsource = "Dept. of Computer Sci., Queen's Univ. of Belfast, Belfast, UK", keywords = "axiomatic proof rules; data structures; dynamic storage allocation; efficiency; high level programming language; programming language; recursive data structures; recursive functions; storage allocation; symbol manipulation; treelike data structures", treatment = "T Theoretical or Mathematical", } @Article{Spier:1975:PPI, author = "M. J. Spier", title = "A pragmatic proposal for the improvement of program modularity and reliability", journal = j-INT-J-COMPUT-INF-SCI, volume = "4", number = "2", pages = "133--149", month = jun, year = "1975", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6150J (Operating systems)", corpsource = "Digital Equipment Corp., Software Engng. Dept., Maynard, MA, USA", keywords = "controlled procedure entry points; database protection; domain concept; economic; fault tolerant computing; operating system design; operating system monitor; operating systems (computers); program correctness; program modularity; program reliability; software error conditions; software quality; structured modularity", treatment = "A Application; T Theoretical or Mathematical", } @Article{Shrivastava:1975:PSH, author = "S. K. Shrivastava", title = "Process synchronization in high-level languages", journal = j-INT-J-COMPUT-INF-SCI, volume = "4", number = "2", pages = "151--169", month = jun, year = "1975", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6110 (Systems analysis and programming)", corpsource = "Computer Lab., Cambridge Univ., Cambridge, UK", keywords = "conditional critical region method; high level programming languages; parallel programs; process synchronisation; programming; resource allocation; synchronizing primitives", treatment = "A Application; T Theoretical or Mathematical", } @Article{Wang:1975:DRU, author = "Y. R. Wang", title = "On data retrieval from unambiguous bit matrices", journal = j-INT-J-COMPUT-INF-SCI, volume = "4", number = "2", pages = "171--187", month = jun, year = "1975", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation)", corpsource = "Dept. of Computer Sci., Univ. of Nebraska, Lincoln, NE, USA", keywords = "data compression; data files; data handling; data retrieval; descriptor; file organisation; parallel reconstruction; unambiguous bit matrices", treatment = "A Application; T Theoretical or Mathematical", } @Article{Rosenberg:1975:SAM, author = "A. L. Rosenberg", title = "On storing arbitrarily many extendible arrays of arbitrary dimensions", journal = j-INT-J-COMPUT-INF-SCI, volume = "4", number = "2", pages = "189--196", month = jun, year = "1975", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation)", corpsource = "Math. Sci. Dept., IBM Watson Res. Center, Yorktown Heights, NY, USA", keywords = "allocation scheme; arbitrary dimensions; computational characteristics; dynamic storage allocation; file organisation; storage allocation", treatment = "A Application; T Theoretical or Mathematical", } @Article{Rose:1975:FEA, author = "L. L. Rose and M. H. Gotterer", title = "File evaluation in auxiliary storage", journal = j-INT-J-COMPUT-INF-SCI, volume = "4", number = "3", pages = "197--204", month = sep, year = "1975", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation); C7250 (Information storage and retrieval)", corpsource = "School of Advanced Technol., State Univ. of New York, Binghamton, New York, NY, USA", keywords = "auxiliary storage; data; Dynamic File Management model; evaluation function; exogenous variables; file evaluation; file organisation; information retrieval system evaluation; objective function; simulation; storage management routine; throughput time", treatment = "T Theoretical or Mathematical", } @Article{Persoon:1975:SCS, author = "E. Persoon and K. S. Fu", title = "Sequential classification of strings generated by {SCFG's}", journal = j-INT-J-COMPUT-INF-SCI, volume = "4", number = "3", pages = "205--217", month = sep, year = "1975", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "School of Electrical Engng., Purdue Univ., West Lafayette, IN, USA", keywords = "classification; context-free grammars; Earley's parsing algorithm; error; optimum decision rule; processing time; sequential classification; sequential classification algorithm; stochastic context free languages; strings; suboptimal stopping rule; time bound", treatment = "T Theoretical or Mathematical", } @Article{Ehrenfeucht:1975:SCV, author = "A. Ehrenfeucht and K. P. Lee and G. Rozenberg", title = "Subword complexities of various classes of deterministic developmental languages with interactions", journal = j-INT-J-COMPUT-INF-SCI, volume = "4", number = "3", pages = "219--236", month = sep, year = "1975", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Computer Sci., Univ. of Colorado, Boulder, CO, USA", keywords = "computational complexity; D0L language; deterministic developmental languages; DIL language; formal languages; interactions; subword complexities; tables", treatment = "T Theoretical or Mathematical", } @Article{Hwang:1975:SSC, author = "K. Hwang", title = "Some structural complexities of time-varying sequential machines", journal = j-INT-J-COMPUT-INF-SCI, volume = "4", number = "3", pages = "237--245", month = sep, year = "1975", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4230D (Sequential switching theory)", corpsource = "School of Electrical Engng., Purdue Univ., West Lafayette, IN, USA", keywords = "convertibility; extended time; finite state realizability; infinite state machine; internal states; isomorphism; logic elements; memory elements; minimality; periodic structure; periodicity; sequential machines; structural complexities; time invariance; time varying sequential machines; time-varying systems", treatment = "T Theoretical or Mathematical", } @Article{Yeh:1975:POS, author = "Hsi-Han Yeh", title = "Parameter optimization of stochastic automata operating in random environments", journal = j-INT-J-COMPUT-INF-SCI, volume = "4", number = "3", pages = "247--263", month = sep, year = "1975", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory)", corpsource = "Univ. of Kentucky, Lexington, KY, USA", keywords = "automata theory; convergence; equilibrium probability distribution; fourth order systems; lower bounds; Markov processes; parameter optimization; probability transition matrix; random environments; random processes; stochastic automata; stochastic systems; transient probability distribution", treatment = "T Theoretical or Mathematical", } @Article{Moyne:1975:RCS, author = "J. A. Moyne", title = "Relevance of computer science to linguistics and vice versa", journal = j-INT-J-COMPUT-INF-SCI, volume = "4", number = "3", pages = "265--279", month = sep, year = "1975", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4290 (Other computer theory)", corpsource = "Dept. of Computer Sci., Queens Coll., City Univ. of New York, New York, NY, USA", keywords = "computational linguistics; computer science; grammars; linguistics", treatment = "B Bibliography", } @Article{Yue:1975:NHA, author = "P. C. Yue and C. K. Wong", title = "Near-optimal heuristics for an assignment problem in mass storage", journal = j-INT-J-COMPUT-INF-SCI, volume = "4", number = "4", pages = "281--294", month = dec, year = "1975", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation); C6150J (Operating systems)", corpsource = "Computer Sci. Dept., IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA", keywords = "archive organisation; assignment problem; directed graphs; lower bound; mass storage; near optimal heuristics; optimisation; pairwise majorisation; stepwise minimisation; storage allocation; tree enumeration", treatment = "E Economic; T Theoretical or Mathematical", } @Article{Kameda:1975:AAW, author = "H. Kameda", title = "The analysis of an adaptive workload balancing strategy in computing system resources management", journal = j-INT-J-COMPUT-INF-SCI, volume = "4", number = "4", pages = "295--306", month = dec, year = "1975", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6150J (Operating systems)", corpsource = "Dept. of Computer Sci., Univ. of Toronto, Toronto, Ont., Canada", keywords = "adaptive workload balancing strategy; coherent priority queueing; computing system resources management; IBM OS/VS2 release 2; operating systems (computers); priority pricing; resource utilisation; throughput; turnaround time", treatment = "E Economic; T Theoretical or Mathematical", } @Article{Yue:1975:SCC, author = "P. C. Yue and C. K. Wong", title = "Storage cost considerations in secondary index selection", journal = j-INT-J-COMPUT-INF-SCI, volume = "4", number = "4", pages = "307--327", month = dec, year = "1975", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation)", corpsource = "Computer Sci. Dept., IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA", keywords = "constrained minimisation; data transfer; knapsack problem; multilevelled storage; query time; relational data base; secondary index selection; storage allocation; storage block; storage cost", treatment = "E Economic; T Theoretical or Mathematical", } @Article{Ang:1975:HAP, author = "Beng-Tung Ang", title = "A heuristic-adaptive procedure for segmentation of time patterns", journal = j-INT-J-COMPUT-INF-SCI, volume = "4", number = "4", pages = "329--348", month = dec, year = "1975", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "B0290F (Interpolation and function approximation); C1230 (Artificial intelligence); C4130 (Interpolation and function approximation)", corpsource = "Div. of Appl. Math., Brown Univ., Providence, RI, USA", keywords = "adaptive systems; artificial intelligence; heuristic adaptive operators; heuristic search; image restoration; least squares approximations; regimed pattern; segmentation of time patterns", treatment = "A Application; T Theoretical or Mathematical", } @Article{Parks:1975:SMB, author = "P. C. Parks and A. G. Ivakhnenko and L. M. Boichuk and Svetalsky and B. K.", title = "A self-organizing model of the {British} economy for control with optimal prediction using the balance-of-variables criterion", journal = j-INT-J-COMPUT-INF-SCI, volume = "4", number = "4", pages = "349--379", month = dec, year = "1975", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C1290D (Systems theory applications in economics and business)", corpsource = "Dept. of Engng., Univ. of Warwick, Coventry, UK", keywords = "balance of variables criterion; British economy; control with optimal prediction; economic cybernetics; group method of data handling; linear differential equations; maximum principle; moving prediction interval; optimal control; self organising model", treatment = "E Economic", } @Article{Dasarathy:1976:SLE, author = "B. V. Dasarathy and A. L. Lakshminarasimhan", title = "Sequential learning employing unfamiliar teacher hypothesis ({SLEUTH}) with concurrent estimation of both the parameters and teacher characteristics", journal = j-INT-J-COMPUT-INF-SCI, volume = "5", number = "1", pages = "1--7", month = mar, year = "1976", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C1230 (Artificial intelligence)", corpsource = "Computer Sci. Corp., Huntsville, AL, USA", keywords = "concurrent estimation; learning systems; parameters; sequential learning; SLEUTH; teacher characteristics; unfamiliar environment", treatment = "T Theoretical or Mathematical", } @Article{Bowie:1976:AGT, author = "W. S. Bowie", title = "Applications of graph theory in computer systems", journal = j-INT-J-COMPUT-INF-SCI, volume = "5", number = "1", pages = "9--31", month = mar, year = "1976", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics); C4290 (Other computer theory)", corpsource = "Dept. of Computing and Information Sci., Univ. of Guelph, Guelph, Ont., Canada", keywords = "algorithms; application; basic problems; computer systems; directed arcs; directed graphs; graph theory; states; transitions; vertices", treatment = "T Theoretical or Mathematical", } @Article{Shneiderman:1976:TTE, author = "B. Shneiderman and S. C. Shapiro", title = "Toward a theory of encoded data structures and data translation", journal = j-INT-J-COMPUT-INF-SCI, volume = "5", number = "1", pages = "33--43", month = mar, year = "1976", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation)", corpsource = "Dept. of Computer Sci., Indiana Univ., Bloomington, IN, USA", keywords = "data base systems; data structures; data translation; encoded data structures; levels of abstraction; model; theory", treatment = "T Theoretical or Mathematical", } @Article{Fung:1976:ESD, author = "L. W. Fung and K. S. Fu", title = "An error-correcting syntactic decoder for computer networks", journal = j-INT-J-COMPUT-INF-SCI, volume = "5", number = "1", pages = "45--58", month = mar, year = "1976", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C5620 (Computer networks and techniques); C6130 (Data handling techniques)", corpsource = "Dept. of Electrical Engng., Univ. of Tennessee, Knoxville, TN, USA", keywords = "binary coded; Chomsky Normal Form; computer networks; context-free grammars; error correcting; error correction codes; information source; memoryless symmetric noisy channel; syntactic decoder", treatment = "T Theoretical or Mathematical", } @Article{White:1976:OSS, author = "J. W. White", title = "An off-line simulation system for development of real-time {FORTRAN} programs", journal = j-INT-J-COMPUT-INF-SCI, volume = "5", number = "1", pages = "59--79", month = mar, year = "1976", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6110 (Systems analysis and programming); C6140D (High level languages)", corpsource = "Dept. of Chem. Engng., Coll. of Mines, Univ. of Arizona, Tucson, AZ, USA", keywords = "development; digital simulation; FORTRAN; FORTRAN programs; offline; online operation; precompiler generation; programming; real time; simulation system", treatment = "P Practical", } @Article{Thomason:1976:BDT, author = "M. G. Thomason and E. W. Page", title = "{Boolean} difference techniques in fault tree analysis", journal = j-INT-J-COMPUT-INF-SCI, volume = "5", number = "1", pages = "81--88", month = mar, year = "1976", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Computer Sci., Univ. of Tennessee, Knoxville, TN, USA", keywords = "Boolean algebra; Boolean difference techniques; fault tree analysis; individual component failure probabilities; logic expressions; reliability theory; system reliability", treatment = "T Theoretical or Mathematical", } @Article{Furtado:1976:CSD, author = "A. L. Furtado", title = "Characterizing sets of data structures by the connectivity relation", journal = j-INT-J-COMPUT-INF-SCI, volume = "5", number = "2", pages = "89--109", month = jun, year = "1976", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation)", corpsource = "Pontificia Univ. Catolica do Rio de Janeiro, Rio de Janeiro, Brazil", keywords = "characterise; connectivity relation; data structures; directed graph; formalism; graph theory; predicate calculus", treatment = "T Theoretical or Mathematical", } @Article{Guttmann:1976:PRD, author = "A. J. Guttmann", title = "Programming recursively defined functions in {FORTRAN}", journal = j-INT-J-COMPUT-INF-SCI, volume = "5", number = "2", pages = "111--122", month = jun, year = "1976", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6140D (High level languages)", corpsource = "Dept. of Math., Univ. of Newcastle, NSW, Australia", keywords = "FORTRAN; function arguments; programming; programming theory; recursive functions; recursively defined functions; stack", treatment = "A Application; T Theoretical or Mathematical", } @Article{Shneiderman:1976:EEP, author = "B. Shneiderman", title = "Exploratory experiments in programmer behavior", journal = j-INT-J-COMPUT-INF-SCI, volume = "5", number = "2", pages = "123--143", month = jun, year = "1976", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C0200 (General computer topics); C6110 (Systems analysis and programming)", corpsource = "Computer Sci. Dept., Indiana Univ., Bloomington, IN, USA", keywords = "arithmetic statements; behaviour; cognitive psychological experimentation; FORTRAN; logical IF statements; personnel; programmer; programming; psychology", treatment = "X Experimental", } @Article{Gonzalez:1976:AIT, author = "R. C. Gonzalez and J. J. Edwards and M. G. Thomason", title = "An algorithm for the inference of tree grammars", journal = j-INT-J-COMPUT-INF-SCI, volume = "5", number = "2", pages = "145--164", month = jun, year = "1976", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Electrical Engng. Dept., Univ. of Tennessee, Knoxville, TN, USA", keywords = "algorithm; grammars; inference; tree grammars; trees (mathematics)", treatment = "T Theoretical or Mathematical", } @Article{Dorrough:1976:PCT, author = "D. Dorrough", title = "Pattern classes: a technique for recovering their distributions", journal = j-INT-J-COMPUT-INF-SCI, volume = "5", number = "2", pages = "165--199", month = jun, year = "1976", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "B6140C (Optical information, image and video signal processing); C1250 (Pattern recognition)", keywords = "decision class; distributions; pattern classes; pattern recognition; recovering", treatment = "T Theoretical or Mathematical", } @Article{Lassez:1976:CCS, author = "J.-L. Lassez", title = "Circular codes and synchronization", journal = j-INT-J-COMPUT-INF-SCI, volume = "5", number = "2", pages = "201--208", month = jun, year = "1976", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C6130 (Data handling techniques)", corpsource = "Dept. de Phys.-Math., Univ. de Moncton, Moncton, NB, Canada", keywords = "characterisation; circular codes; codes; computability and decidability; finite synchronization delay", treatment = "T Theoretical or Mathematical", } @Article{Johnston:1976:CGB, author = "H. C. Johnston", title = "Cliques of a graph-variations on the {Bron-Kerbosch} algorithm", journal = j-INT-J-COMPUT-INF-SCI, volume = "5", number = "3", pages = "209--238", month = sep, year = "1976", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics); C4210 (Formal logic)", corpsource = "Dept. of Computer Sci., Queen's Univ. of Belfast, Belfast, UK", keywords = "Bron Kerbosch algorithm; cliques; combinatorial programming; graph theory; sorting; stepwise refinement; tree search; undirected graph", treatment = "T Theoretical or Mathematical", } @Article{Maekawa:1976:DPB, author = "M. Maekawa", title = "Detection of parallelism between statements by decomposing into separate sequential processes", journal = j-INT-J-COMPUT-INF-SCI, volume = "5", number = "3", pages = "239--255", month = sep, year = "1976", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Dept. of Computer Sci., Univ. of Iowa, Iowa City, IA, USA", keywords = "multilevel pipelining; parallel processing; parallelism; pipeline processing; pipelining; sequential processes", treatment = "P Practical", } @Article{Cannon:1976:ATC, author = "R. L. {Cannon, Jr.}", title = "An algebraic technique for context-sensitive parsing", journal = j-INT-J-COMPUT-INF-SCI, volume = "5", number = "3", pages = "257--276", month = sep, year = "1976", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Math. and Computer Sci., Univ. of South Carolina, Columbia, SC, USA", keywords = "algebraic parsing; canonical parse; context free; context sensitive; context-sensitive grammars; context-sensitive languages; grammar; parsing; semiring; state grammars", treatment = "T Theoretical or Mathematical", } @Article{Hinomoto:1976:OFI, author = "H. Hinomoto", title = "Observations of a firm's information processing with a data base management system", journal = j-INT-J-COMPUT-INF-SCI, volume = "5", number = "3", pages = "277--302", month = sep, year = "1976", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation); C7100 (Business and administration)", corpsource = "Dept. of Business Administration, Univ. of Illinois, Urbana-Champaign, IL, USA", keywords = "data base management system; data processing; database management systems; IMS; transaction processing", treatment = "A Application; P Practical", } @Article{Stallings:1976:ACB, author = "W. Stallings", title = "An application of coroutines and backtracking in interactive systems", journal = j-INT-J-COMPUT-INF-SCI, volume = "5", number = "4", pages = "303--313", month = dec, year = "1976", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6110 (Systems analysis and programming)", corpsource = "Advanced Computer Tech., Arlington, VA, USA", keywords = "backtracking; coroutines; interactive systems; programming; recognition; software structure; translation", treatment = "P Practical", } @Article{Ibaraki:1976:TCS, author = "T. Ibaraki", title = "Theoretical comparisons of search strategies in branch-and-bound algorithms", journal = j-INT-J-COMPUT-INF-SCI, volume = "5", number = "4", pages = "315--344", month = dec, year = "1976", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C1180 (Optimisation techniques)", corpsource = "Dept. of Appl. Math. and Phys., Faculty of Engng., Kyoto Univ., Kyoto, Japan", keywords = "best bound search; branch and bound; breadth first search; comparisons; depth first search; heuristic search; optimisation; search strategies", treatment = "T Theoretical or Mathematical", } @Article{Gabow:1976:UEP, author = "H. N. Gabow", title = "Using {Euler} partitions to edge color bipartite multigraphs", journal = j-INT-J-COMPUT-INF-SCI, volume = "5", number = "4", pages = "345--355", month = dec, year = "1976", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics)", corpsource = "Dept. of Computer Sci., Univ. of Colorado, Boulder, CO, USA", keywords = "algorithm; bipartite multigraphs; divide and conquer; edge colouring; euler partitions; graph colouring; matching", treatment = "T Theoretical or Mathematical", } @Article{Skavaril:1976:BIO, author = "R. V. Skavaril and O. R. Miller", title = "Binary input, output, and manipulation extensions of conversational programming with some biological applications", journal = j-INT-J-COMPUT-INF-SCI, volume = "5", number = "4", pages = "357--373", month = dec, year = "1976", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6110 (Systems analysis and programming); C7330 (Biology and medical computing)", corpsource = "Dept. of Genetics, Ohio State Univ., Columbus, OH, USA", keywords = "binary; biology computing; conversational programming system; extensions; input; interactive programming; manipulation; output", treatment = "P Practical", } @Article{Hellerman:1977:SMP, author = "H. Hellerman and R. Cavallo", title = "On the solution of multiattribute problems involving counting in intersecting sets", journal = j-INT-J-COMPUT-INF-SCI, volume = "6", number = "1", pages = "1--7", month = mar, year = "1977", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics)", corpsource = "School of Advanced Technol., State Univ. of New York, Binghamton, NY, USA", keywords = "counting; intersecting sets; multiattribute problems; set theory; solution", treatment = "T Theoretical or Mathematical", } @Article{Jordan:1977:NLU, author = "S. R. Jordan", title = "A natural language understander based on a freely associated learned memory net", journal = j-INT-J-COMPUT-INF-SCI, volume = "6", number = "1", pages = "9--25", month = mar, year = "1977", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C1230 (Artificial intelligence)", corpsource = "Computer Sci. Dept., Univ. of Tennessee-Knoxville, Knoxville, TN, USA", keywords = "artificial intelligence; computer systems; freely associated learned memory net; human trainer; interactive computer program; natural language understander; unsegmented input strings", treatment = "T Theoretical or Mathematical", } @Article{Kai:1977:SED, author = "Hwang Kai", title = "On syntactic edge detection in noisy pictures", journal = j-INT-J-COMPUT-INF-SCI, volume = "6", number = "1", pages = "27--40", month = mar, year = "1977", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "B6140C (Optical information, image and video signal processing); C1250 (Pattern recognition)", corpsource = "Dept. of Electrical and Computer Engng., Wayne State Univ., Detroit, MI, USA", keywords = "line drawing programs; noisy pictures; pattern recognition; picture parsing methods; primitive recognizing mechanism methods; syntactic edge detection", treatment = "T Theoretical or Mathematical", } @Article{Starks:1977:AOS, author = "S. A. Starks and R. J. P. {de Figueiredo} and D. L. {Van Rooy}", title = "An algorithm for optimal single linear feature extraction from several {Gaussian} pattern classes", journal = j-INT-J-COMPUT-INF-SCI, volume = "6", number = "1", pages = "41--54", month = mar, year = "1977", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "B6140C (Optical information, image and video signal processing); C1250 (Pattern recognition)", corpsource = "Electrical Engng. Dept., Rice Univ., Houston, TX, USA", keywords = "algorithm; computational; feature extraction; Gaussian pattern classes; linear; optimal; pattern recognition; single", treatment = "T Theoretical or Mathematical", } @Article{Neff:1977:SFS, author = "T. P. Neff and A. Kandel", title = "Simplification of fuzzy switching functions", journal = j-INT-J-COMPUT-INF-SCI, volume = "6", number = "1", pages = "55--70", month = mar, year = "1977", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4230 (Switching theory)", corpsource = "Computer Sci. Dept., New Mexico Inst. of Mining and Technol., Socorro, NM, USA", keywords = "algorithm; direct simplification; fuzzy prime implicants; fuzzy switching functions; simplification; switching functions", treatment = "T Theoretical or Mathematical", } @Article{Hughes:1977:AFA, author = "J. S. Hughes and A. Kandel", title = "Applications of fuzzy algebra to hazard detection in combinational switching circuits", journal = j-INT-J-COMPUT-INF-SCI, volume = "6", number = "1", pages = "71--82", month = mar, year = "1977", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4230B (Combinatorial switching theory)", corpsource = "Computer Sci. Dept., New Mexico Inst. of Mining and Technol., Socorro, NM, USA", keywords = "algebra; combinational switching circuits; combinatorial circuits; fuzzy algebra; hazard detection; hazards and race conditions", treatment = "T Theoretical or Mathematical", } @Article{Tanatsugu:1977:CSD, author = "K. Tanatsugu and S. Arikawa", title = "On characteristics sets and degrees of finite automata", journal = j-INT-J-COMPUT-INF-SCI, volume = "6", number = "1", pages = "83--93", month = mar, year = "1977", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory)", corpsource = "Dept. of Math., Kitakyushu Univ., Kitakyushu, Japan", keywords = "characteristics sets; converges; degrees; finite automata", treatment = "T Theoretical or Mathematical", } @Article{Edmundson:1977:SIM, author = "H. P. Edmundson", title = "Statistical inference in mathematical and computational linguistics", journal = j-INT-J-COMPUT-INF-SCI, volume = "6", number = "2", pages = "95--129", month = jun, year = "1977", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4290 (Other computer theory)", corpsource = "Dept. of Computer Sci., Univ. of Maryland, College Park, MD, USA", keywords = "computational linguistics; interdisciplinary studies; statistical linguistics", treatment = "T Theoretical or Mathematical", } @Article{Maruyama:1977:GPA, author = "K. Maruyama and D. T. Tang and S. K. Chang", title = "A general packing algorithm for multidimensional resource requirements", journal = j-INT-J-COMPUT-INF-SCI, volume = "6", number = "2", pages = "131--149", month = jun, year = "1977", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA", keywords = "algorithms; distributed computer system design; heuristic; memory allocation; operations research; packing algorithm; resource allocations; resource requirements; storage allocation", treatment = "T Theoretical or Mathematical", } @Article{Muzio:1977:POS, author = "J. C. Muzio", title = "A prefix operator for a switching algebra", journal = j-INT-J-COMPUT-INF-SCI, volume = "6", number = "2", pages = "151--163", month = jun, year = "1977", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4230B (Combinatorial switching theory)", corpsource = "Dept. of Computer Sci., Univ. of Manitoba, Winnipeg, Man., Canada", keywords = "Boolean algebra; circuit manipulation; combinatorial switching; gate inputs; NAND operator; operator; prefix operator; switching algebra", treatment = "T Theoretical or Mathematical", } @Article{Iscovici:1977:FAM, author = "S. Iscovici", title = "Field analysis: a mathematical method of analysis for information handling processes", journal = j-INT-J-COMPUT-INF-SCI, volume = "6", number = "2", pages = "165--178", month = jun, year = "1977", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4290 (Other computer theory)", corpsource = "Ministry of State for Urban Affairs, Ottawa, Ont., Canada", keywords = "computation theory; design; documentation; field equations; information fields; information handling processes; information processing; specification", treatment = "T Theoretical or Mathematical", } @Article{Minker:1977:NAE, author = "J. Minker", title = "A note on answer extraction in resolution-based systems", journal = j-INT-J-COMPUT-INF-SCI, volume = "6", number = "3", pages = "179--192", month = sep, year = "1977", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C1230 (Artificial intelligence); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Computer Sci., Univ. of Maryland, College Park, MD, USA", keywords = "answer extraction; artificial intelligence; Luckham Nilsson algorithm; programming theory; proof graph; resolution based systems; tautologies", treatment = "G General Review", } @Article{Koch:1977:ISD, author = "H. S. Koch", title = "Information system design for real-time multiprocessing systems", journal = j-INT-J-COMPUT-INF-SCI, volume = "6", number = "3", pages = "193--209", month = sep, year = "1977", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6110 (Systems analysis and programming); C6150J (Operating systems)", corpsource = "Dept. of Computer and Information Sci., Ohio State Univ., Columbus, OH, USA", keywords = "information systems; multiprocessing; multiprocessing programs; multiprocessing systems; real time multiprocessing; system design; systems analysis", treatment = "A Application; T Theoretical or Mathematical", } @Article{Ting:1977:CHT, author = "T. C. Ting", title = "Compacting homogeneous text for minimizing storage space", journal = j-INT-J-COMPUT-INF-SCI, volume = "6", number = "3", pages = "211--221", month = sep, year = "1977", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6130 (Data handling techniques)", corpsource = "School of Information and Computer Sci., Georgia Inst. of Technol., Atlanta, GA, USA", keywords = "data compression; decoding; encoding; homogeneous text; numerical coding method; storage; storage allocation; storage space; text compaction; text editing; text information", treatment = "G General Review", } @Article{Aalto:1977:DNU, author = "S. Aalto and E. Schuegraf", title = "Determination of the number of unambiguous bit matrices", journal = j-INT-J-COMPUT-INF-SCI, volume = "6", number = "3", pages = "223--235", month = sep, year = "1977", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C1110 (Algebra); C6130 (Data handling techniques)", corpsource = "Dept. of Math., St. Francis Xavier Univ., Antigonish, NS, Canada", keywords = "binary matrix; binary matrix compression; bit matrices; data handling; matrix algebra; storage allocation; unambiguous bit matrices", treatment = "G General Review; T Theoretical or Mathematical", } @Article{Bouckaert:1977:CDG, author = "A. Bouckaert", title = "Computer diagnosis of goiters. {V}. The input", journal = j-INT-J-COMPUT-INF-SCI, volume = "6", number = "3", pages = "237--261", month = sep, year = "1977", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C7330 (Biology and medical computing)", corpsource = "Dept. of Physiopathology, Faculty of Medicine, Kinshasa, Zaire", keywords = "classification errors; computer diagnosis; diagnostic accuracy; differential diagnosis; error analysis; goiters; medical diagnostic computing; observation errors; recognition method; thyroid pathology", treatment = "A Application; G General Review", } @Article{Hamlet:1977:ETP, author = "R. G. Hamlet", title = "Execution traces and programming-language semantics", journal = j-INT-J-COMPUT-INF-SCI, volume = "6", number = "4", pages = "263--278", month = dec, year = "1977", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4220 (Automata theory)", corpsource = "Dept. of Computer Sci., Univ. of Maryland, College Park, MD, USA", keywords = "computability and decidability; formal languages; trace languages; traces; Turing machine; Turing machines", treatment = "T Theoretical or Mathematical", } @Article{Thesen:1977:PAC, author = "A. Thesen and T. Pinkerton", title = "Predicting the availability of contiguous memory", journal = j-INT-J-COMPUT-INF-SCI, volume = "6", number = "4", pages = "279--287", month = dec, year = "1977", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6120 (File organisation)", corpsource = "Dept. of Industrial Engng., Univ. of Wisconsin, Madison, WI, USA", keywords = "contiguous memory; fragmentation; garbage collection; memory; memory allocation; probability distributions; simulation model; storage allocation; storage management", treatment = "T Theoretical or Mathematical", } @Article{DiasVelasco:1977:AFL, author = "F. R. {Dias Velasco} and C. {de Renna e Souza}", title = "An application of formal linguistics to scene recognition", journal = j-INT-J-COMPUT-INF-SCI, volume = "6", number = "4", pages = "289--306", month = dec, year = "1977", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "B6140C (Optical information, image and video signal processing); C1250 (Pattern recognition); C4210 (Formal logic)", corpsource = "Computer and Information Sci., Space Res. Inst. (INPE), Sao Jose dos Campos, Sao Paulo, Brazil", keywords = "computational linguistics; formal linguistics; grammars; parsing; pattern recognition; picture processing; scene description; scene recognition; syntactical recognition", treatment = "T Theoretical or Mathematical", } @Article{Dasarathy:1977:FFE, author = "B. V. Dasarathy", title = "{FEAST}: feature evaluation and selection technique for deployment in unsupervised nonparametric environments", journal = j-INT-J-COMPUT-INF-SCI, volume = "6", number = "4", pages = "307--315", month = dec, year = "1977", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "B6140C (Optical information, image and video signal processing); C1250 (Pattern recognition)", corpsource = "M and S Computing Inc., Huntsville, AL, USA", keywords = "automaton model; clustering; feature selection; pattern recognition; unsupervised learning; unsupervised nonparametric environments", treatment = "T Theoretical or Mathematical", } @Article{Srivastava:1977:GMQ, author = "H. M. Srivastava and H. B. Kekre and Y. N. Bapat", title = "{G/M/1} queue study of buffer behavior in the decoding system of computer communication", journal = j-INT-J-COMPUT-INF-SCI, volume = "6", number = "4", pages = "317--326", month = dec, year = "1977", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C1140C (Queueing theory); C1260 (Information theory); C5600 (Data communication equipment and techniques)", corpsource = "Computer Centre, Indian Inst. of Technol., Bombay, India", keywords = "buffer behaviour; computer communication; data communication systems; decoding; G/M/1 model; Huffman code; multiplexing; queue study; queueing theory; waiting time", treatment = "A Application; T Theoretical or Mathematical", } @Article{Moyne:1977:SDB, author = "J. A. Moyne", title = "{Simple-English} for data base communication", journal = j-INT-J-COMPUT-INF-SCI, volume = "6", number = "4", pages = "327--343", month = dec, year = "1977", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C6120 (File organisation); C6140D (High level languages)", corpsource = "Dept. of Computer Sci., Queens Coll., City Univ. of New York, Flushing, NY, USA", keywords = "artificial programming languages; data base communication; database management systems; natural languages; procedure oriented languages; simple English", treatment = "G General Review; T Theoretical or Mathematical", } @Article{Salomon:1978:SGG, author = "K. B. Salomon", title = "String and graph grammar characterizations of bounded regular languages", journal = j-INT-J-COMPUT-INF-SCI, volume = "7", number = "1", pages = "1--10", month = mar, year = "1978", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Math., California State Univ., Hayward, CA, USA", keywords = "bounded regular languages; formal languages; grammar; grammars; graph grammars; state graphs; string grammars; uniquely recursive", treatment = "T Theoretical or Mathematical", } @Article{Berry:1978:TRRa, author = "D. M. Berry and L. M. Chirica and D. F. Martin and A. Sorkin and J. B. Johnson", title = "Time required for reference count management in retention block-structured languages. {I}", journal = j-INT-J-COMPUT-INF-SCI, volume = "7", number = "1", pages = "11--64", month = mar, year = "1978", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6110 (Systems analysis and programming); C6140 (Programming languages)", corpsource = "Computer Sci. Dept., Univ. of California, Los Angeles, CA, USA", keywords = "block structured languages; deletion strategy; lifetime stack model; programming languages; reference count management; retention strategy; structured programming", treatment = "T Theoretical or Mathematical", } @Article{Biermann:1978:AII, author = "A. W. Biermann", title = "Automatic insertion of indexing instructions in program synthesis", journal = j-INT-J-COMPUT-INF-SCI, volume = "7", number = "1", pages = "65--90", month = mar, year = "1978", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6110 (Systems analysis and programming); C6120 (File organisation)", corpsource = "Dept. of Computer Sci., Duke Univ., Durham, NC, USA", keywords = "automatic programming; autoprogramming; data structures; indexing instructions; interactive programming; program synthesis", treatment = "T Theoretical or Mathematical", } @Article{Berry:1978:TRRb, author = "D. M. Berry and L. M. Chirica and D. F. Martin and A. Sorkin and J. B. Johnston", title = "On the time required for reference count management in retention block-structured languages. {II}", journal = j-INT-J-COMPUT-INF-SCI, volume = "7", number = "2", pages = "91--119", month = jun, year = "1978", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6110 (Systems analysis and programming); C6140 (Programming languages)", corpsource = "Computer Sci. Dept., Univ. of California, Los Angeles, CA, USA", keywords = "block structured languages; contour model; deletion strategy; lifetime checks; programming languages; reference count management; retention strategy; stack model; structured programming", treatment = "T Theoretical or Mathematical", } @Article{Hofri:1978:GAM, author = "M. Hofri", title = "A generating-function analysis of multiprogramming queues", journal = j-INT-J-COMPUT-INF-SCI, volume = "7", number = "2", pages = "121--155", month = jun, year = "1978", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C1140C (Queueing theory); C1140Z (Other topics in statistics)C4150 (Nonlinear and functional equations); C6150J (Operating systems)", corpsource = "Computer Sci. Dept., Technion-Israel Inst. of Technol., Haifa, Israel", keywords = "functional equation; functional equations; Markov chain; Markov processes; multiprogramming; multiprogramming queues; probability generating functions; queueing theory", treatment = "T Theoretical or Mathematical", } @Article{Minsky:1978:OSA, author = "N. Minsky", title = "An operation-control scheme for authorization in computer systems", journal = j-INT-J-COMPUT-INF-SCI, volume = "7", number = "2", pages = "157--191", month = jun, year = "1978", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C0310 (EDP management); C6150J (Operating systems)", corpsource = "Dept. of Computer Sci., Rutgers Univ., New Brunswick, NJ, USA", keywords = "access control; authorisation; databases; information systems; operating systems; operating systems (computers); operation control; protection; security of data", treatment = "G General Review", } @Article{Hunter:1978:MPP, author = "D. W. Hunter and G. S. Shedler", title = "Multivariate point process models for response times in multiprogrammed systems", journal = j-INT-J-COMPUT-INF-SCI, volume = "7", number = "2", pages = "193--217", month = jun, year = "1978", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation); C6150J (Operating systems)", corpsource = "IBM T.J. Watson Res. Center, Yorktown Heights, NY, USA", keywords = "database management systems; multiprocessing systems; multiprogrammed systems; multivariate point process models; R-process; response times; system performance predictions; workload characteristics", treatment = "T Theoretical or Mathematical", } @Article{Ellis:1978:ASA, author = "Clarence A. Ellis", title = "Analysis of some abstract measures of protection in computer systems", journal = j-INT-J-COMPUT-INF-SCI, volume = "7", number = "3", pages = "219--251", month = sep, year = "1978", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68B20", MRnumber = "80a:68025", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4290 (Other computer theory); C5420 (Mainframes and minicomputers); C6130 (Data handling techniques)", corpsource = "Dept. of Electrical Engng. and Computer Sci., MIT, Cambridge, MA, USA", keywords = "abstract measures of protection; access mechanisms; computer systems; multi-access systems; security; security of data; system cost; time-sharing systems", treatment = "T Theoretical or Mathematical", } @Article{Dasarathy:1978:CCH, author = "B. V. Dasarathy and K. P. {Bharath Kumar}", title = "{CHITRA}: cognitive handprinted input-trained recursively analyzing system for recognition of alphanumeric characters", journal = j-INT-J-COMPUT-INF-SCI, volume = "7", number = "3", pages = "253--282", month = sep, year = "1978", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "B6140C (Optical information, image and video signal processing); C1250B (Character recognition); C5530 (Pattern recognition and computer vision equipment)", corpsource = "M and S Computing Inc., Huntsville, AL, USA", keywords = "character recognition; CHITRA; cognitive; handprinted; multistage feature extractor; recognition algorithm; recognition of alphanumeric characters", treatment = "T Theoretical or Mathematical", } @Article{Singh:1978:PAT, author = "Shanker Singh and Vijendra Pal Singh", title = "A probabilistic approach for testing large-scale integrated circuits", journal = j-INT-J-COMPUT-INF-SCI, volume = "7", number = "3", pages = "283--294", month = sep, year = "1978", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "94C05", MRnumber = "80a:94048", MRreviewer = "Ernest S. Kuh", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "B0170E (Production facilities and engineering); B2220 (Integrated circuits); C5210 (Logic design methods)", corpsource = "IBM Corp., East Fishkill, NY, USA", keywords = "circuit testing; integrated circuit testing; integrated logic circuit chips; logic testing; LSI; probabilistic; reference standard; reliable screening test procedure", treatment = "T Theoretical or Mathematical", } @Article{Chen:1978:SOS, author = "T. C. Chen and K. P. Eswaran and V. Y. Lum and C. Tung", title = "Simplified odd-even sort using multiple shift-register loops", journal = j-INT-J-COMPUT-INF-SCI, volume = "7", number = "3", pages = "295--314", month = sep, year = "1978", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C5320E (Storage on stationary magnetic media); C6120 (File organisation); C6130 (Data handling techniques)", corpsource = "IBM Res. Lab., San Jose, CA, USA", keywords = "bubbles; loops; magnetic film stores; odd even sort; parallel sorting; shift register; sorting; storage management", treatment = "T Theoretical or Mathematical", } @Article{Ibaraki:1978:DSB, author = "Toshihide Ibaraki", title = "Depth-$m$ search in branch-and-bound algorithms", journal = j-INT-J-COMPUT-INF-SCI, volume = "7", number = "4", pages = "315--343", month = dec, year = "1978", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "90C10 (68C05)", MRnumber = "80a:90098", MRreviewer = "Uwe Zimmermann", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C1180 (Optimisation techniques)", corpsource = "Dept. of Appl. Math. and Phys., Kyoto Univ., Kyoto, Japan", keywords = "branch-and-bound algorithms; computational experiment; depth-m search; exact upper bound; heuristic search; memory space; optimisation", treatment = "T Theoretical or Mathematical", } @Article{Sebesta:1978:PIG, author = "Robert W. Sebesta and Neil D. Jones", title = "Parsers for indexed grammars", journal = j-INT-J-COMPUT-INF-SCI, volume = "7", number = "4", pages = "345--359", month = dec, year = "1978", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68F25", MRnumber = "80b:68103", MRreviewer = "Anton Nijholt", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "State Univ. of New York, Oswego, NY, USA", keywords = "canonical systems; context free grammars; context free languages; context-free grammars; context-free languages; context-sensitive languages; flag strings; linear time; LL algorithms; LR algorithms; noncontextfree languages; parsable indexed grammars", treatment = "T Theoretical or Mathematical", } @Article{Berry:1978:TRG, author = "D. M. Berry and A. Sorkin", title = "Time required for garbage collection in retention block-structured languages", journal = j-INT-J-COMPUT-INF-SCI, volume = "7", number = "4", pages = "361--404", month = dec, year = "1978", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68B15", MRnumber = "80e:68043", MRreviewer = "A. N. Maslov", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation)", corpsource = "Computer Sci. Dept., Univ. of California, Los Angeles, CA, USA", keywords = "garbage collection; optimized; recovering inaccessible storage; retention block structured languages; storage management; time requirements", treatment = "T Theoretical or Mathematical", } @Article{Tou:1979:ZTB, author = "J. T. Tou", title = "Zoom-thresholding technique for boundary determination", journal = j-INT-J-COMPUT-INF-SCI, volume = "8", number = "1", pages = "3--8", month = feb, year = "1979", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "B6140C (Optical information, image and video signal processing); C1180 (Optimisation techniques); C1250 (Pattern recognition)", corpsource = "Center for Information Res., Univ. of Florida, Gainesville, FL, USA", keywords = "automatic determination; boundary determination; computerised picture processing; edge detection; fuzzy boundary; image processing; lung tissues; optimal threshold; optimisation; optimization process; pattern recognition; photomicrographs; picture processing; zoom thresholding", treatment = "G General Review", } @Article{Epstein:1979:STE, author = "H. I. Epstein and B. F. Caviness", title = "A structure theorem for the elementary functions and its application to the identity problem", journal = j-INT-J-COMPUT-INF-SCI, volume = "8", number = "1", pages = "9--37", month = feb, year = "1979", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "12H05 (68C05)", MRnumber = "80k:12032", MRreviewer = "Michael F. Singer", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C1110 (Algebra)", corpsource = "Dept. of Math., Boston Coll., Chestnut Hill, MA, USA", keywords = "algebra; algebraic independence; canonical form; differential algebra; elementary functions; elementary transcendental functions; exponential functions; hyperbolic functions; identity problem; Liouville fields; logarithmic functions; regular form; Risch; structure theorem; symbolic mathematical computation; trigonometric functions", treatment = "T Theoretical or Mathematical", } @Article{Gotlieb:1979:DSB, author = "C. C. Gotlieb and A. L. Furtado", title = "Data schemata based on directed graphs", journal = j-INT-J-COMPUT-INF-SCI, volume = "8", number = "1", pages = "39--73", month = feb, year = "1979", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic); C6120 (File organisation)", corpsource = "Dept. of Computer Sci., Univ. of Toronto, Toronto, Ont., Canada", keywords = "CODASYL; data definition; data manipulation; data structures; database systems; directed graphs; grammars; languages; RLDs", treatment = "T Theoretical or Mathematical", } @Article{Dasarathy:1979:LUV, author = "B. V. Dasarathy and A. L. Lakshminarasimhan", title = "Learning under a {VEDIC} teacher (pattern recognition)", journal = j-INT-J-COMPUT-INF-SCI, volume = "8", number = "1", pages = "75--88", month = feb, year = "1979", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "B6140C (Optical information, image and video signal processing); C1240 (Adaptive system theory); C1250 (Pattern recognition)", corpsource = "M and S Computing Inc., Huntsville, AL, USA", keywords = "imperfectly counseling; learning systems; parametric learning; pattern recognition; simulation results; supervision; VEDIC teacher; vicissitudinous environment defining; vicissitudinous teacher", treatment = "T Theoretical or Mathematical", } @Article{Maryanski:1979:PSS, author = "Fred J. Maryanski and Michael G. Thomason", title = "Properties of stochastic syntax-directed translation schemata", journal = j-INT-J-COMPUT-INF-SCI, volume = "8", number = "2", pages = "89--110", month = apr, year = "1979", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68F15 (68D25 94A15)", MRnumber = "80e:68209", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Computer Sci. Dept., Kansas State Univ., Manhattan, KS, USA", keywords = "automata; context free languages; context-free grammars; context-free languages; language translation; Markov chains; Markov processes; stochastic grammars; stochastic mappings; stochastic pushdown transducer; translation schemata", treatment = "T Theoretical or Mathematical", } @Article{Ivakhnenko:1979:DMO, author = "A. G. Ivakhnenko", title = "Development of models of optimal complexity using self-organization theory", journal = j-INT-J-COMPUT-INF-SCI, volume = "8", number = "2", pages = "111--127", month = apr, year = "1979", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C1180 (Optimisation techniques); C7000 (Computer applications)", corpsource = "Acad. of Sci., Kiev, Ukrainian SSR, USSR", keywords = "digital simulation; mathematical model; optimal complexity; optimisation; polynomial; prediction optimisation; self organisation theory", treatment = "G General Review", } @Article{Schinnar:1979:GIS, author = "Arie P. Schinnar", title = "Generalized inverse solutions of multiattribute accounting problems", journal = j-INT-J-COMPUT-INF-SCI, volume = "8", number = "2", pages = "129--139", month = apr, year = "1979", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "92A15", MRnumber = "80g:92028", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C1290 (Applications of systems theory)", corpsource = "School of Public and Urban Policy, Univ. of Pennsylvania, Philadelphia, PA, USA", keywords = "computing; factorization; generalized inverse methods; information retrieval; intersecting sets; multiattribute accounting problems; operations research", treatment = "T Theoretical or Mathematical", } @Article{Cannon:1979:NCL, author = "Robert L. {Cannon, Jr.}", title = "Notes on canonical label languages", journal = j-INT-J-COMPUT-INF-SCI, volume = "8", number = "2", pages = "141--148", month = apr, year = "1979", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68F05", MRnumber = "80e:68182", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Math., Computer Sci. and Statistics, Univ. of South Carolina, Columbia, SC, USA", keywords = "canonical label languages; context free grammars; formal languages; label words; phrase structure grammar", treatment = "T Theoretical or Mathematical", } @Article{Vere:1979:CRP, author = "Steven A. Vere", title = "Composition of relational productions for plans and programs", journal = j-INT-J-COMPUT-INF-SCI, volume = "8", number = "2", pages = "149--179", month = apr, year = "1979", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68B10 (68B99)", MRnumber = "80e:68041", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C1230 (Artificial intelligence); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Information Engng., Univ. of Illinois, Chicago, IL, USA", keywords = "artificial intelligence; artificial intelligence plans; composition theorem; computer programs; information processing; loop semantics; mathematical model; programming theory; relational productions; structured data; verification method", treatment = "T Theoretical or Mathematical", } @Article{Edmundson:1979:NPC, author = "H. P. Edmundson and Immanuel I. Tung", title = "The notion of a probabilistic cellular acceptor", journal = j-INT-J-COMPUT-INF-SCI, volume = "8", number = "3", pages = "181--208", month = jun, year = "1979", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68D25 (68D20)", MRnumber = "80e:68146", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4220 (Automata theory)", corpsource = "Dept. of Computer Sci., Univ. of Maryland, College Park, MD, USA", keywords = "cellular automaton; finite automata; formal languages; languages; PBCA; probabilistic automaton; probabilistic bounded cellular acceptor; probabilistic cellular acceptor", treatment = "T Theoretical or Mathematical", } @Article{Thayse:1979:EPP, author = "A. Thayse", title = "Encoding of parallel program schemata by vector addition systems", journal = j-INT-J-COMPUT-INF-SCI, volume = "8", number = "3", pages = "209--218", month = jun, year = "1979", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68B20", MRnumber = "80e:68064", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C5420 (Mainframes and minicomputers)", corpsource = "MBLE Res. Lab., Brussels, Belgium", keywords = "encoding; parallel processing; parallel program schemata; vector addition systems", treatment = "T Theoretical or Mathematical", } @Article{Shneiderman:1979:SSI, author = "B. Shneiderman and R. Mayer", title = "Syntactic\slash semantic interactions in programmer behavior: a model and experimental results", journal = j-INT-J-COMPUT-INF-SCI, volume = "8", number = "3", pages = "219--238", month = jun, year = "1979", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C0310 (EDP management); C6110 (Systems analysis and programming); C6150G (Diagnostic, testing, debugging and evaluating systems)", corpsource = "Dept. of Information Systems Management, Univ. of Maryland, College Park, MD, USA", keywords = "cognitive framework; composition; comprehension; debugging; DP management; information processing model; modification; program debugging; programmer behaviour; programming; syntactic knowledge; syntactic/semantic interactions", treatment = "T Theoretical or Mathematical", } @Article{Sheela:1979:ONA, author = "B. V. Sheela and B. V. Dasarathy", title = "{OPAL}: a new algorithm for optimal partitioning and learning in nonparametric unsupervised environments", journal = j-INT-J-COMPUT-INF-SCI, volume = "8", number = "3", pages = "239--253", month = jun, year = "1979", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "B6140C (Optical information, image and video signal processing); C1180 (Optimisation techniques); C1250 (Pattern recognition)", corpsource = "ISRO Satellite Center, Bangalore, India", keywords = "algorithm; clustering; intergroup; intragroup distinct scatters; learning; nonlinear programming; nonparametric unsupervised environments; OPAL; optimal partitioning and learning; optimisation; pattern recognition", treatment = "N New Development; T Theoretical or Mathematical", } @Article{Anisimov:1979:IS, author = "A. V. Anisimov and D. E. Knuth", title = "Inhomogeneous sorting", journal = j-INT-J-COMPUT-INF-SCI, volume = "8", number = "4", pages = "255--260", month = aug, year = "1979", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6130 (Data handling techniques)", corpsource = "Dept. of Cybernetics, Kiev State Univ., Kiev, Ukrainian SSR, USSR", keywords = "commute; inhomogeneous; lexicographically smallest; sorting; topological", treatment = "T Theoretical or Mathematical", } @Article{V:1979:IS, author = "A. V. An{\=\i}s{\=\i}mov and D. E. Knuth", title = "Inhomogeneous sorting", journal = j-INT-J-COMPUT-INF-SCI, volume = "8", number = "4", pages = "255--260", year = "1979", MRclass = "68E05", MRnumber = "80j:68049", MRreviewer = "R. J. McEliece", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, } @Article{Alter:1979:ESG, author = "Ronald Alter and Johnson M. Hart", title = "Enumerating syntactical graphs and lattices of derivations", journal = j-INT-J-COMPUT-INF-SCI, volume = "8", number = "4", pages = "261--277", month = aug, year = "1979", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68F05 (68C05 68E10)", MRnumber = "80g:68090", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Computer Sci., Univ. of Kentucky, Lexington, KY, USA", keywords = "grammars; graph theory; lattices of derivations; phrase structure grammars; syntactical graphs", treatment = "T Theoretical or Mathematical", } @Article{Al-Fedaghi:1979:AAC, author = "S. S. Al-Fedaghi and Y. H. Chin", title = "Algorithmic approach to the consecutive retrieval property", journal = j-INT-J-COMPUT-INF-SCI, volume = "8", number = "4", pages = "279--301", month = aug, year = "1979", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68H05 (68B15 68C05)", MRnumber = "80h:68079", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation)", corpsource = "Dept. of Electrical Engng. and Computer Sci., Northwestern Univ., Evanston, IL, USA", keywords = "consecutive retrieval property; data base design; file organisation; file organization; incidence matrix", treatment = "T Theoretical or Mathematical", } @Article{Tangwongsan:1979:ALR, author = "S. Tangwongsan and K. S. Fu", title = "An application of learning to robotic planning", journal = j-INT-J-COMPUT-INF-SCI, volume = "8", number = "4", pages = "303--333", month = aug, year = "1979", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C1230 (Artificial intelligence)", corpsource = "School of Electrical Engng., Purdue Univ., W.Lafayette, IN, USA", keywords = "analogy; learning; learning systems; robotic planning; robots; speed; supervised learning", treatment = "T Theoretical or Mathematical", } @Article{Culik:1979:DDT, author = "K. {Culik, II} and D. Wood", title = "Doubly deterministic tabled {OL} systems", journal = j-INT-J-COMPUT-INF-SCI, volume = "8", number = "4", pages = "335--347", month = aug, year = "1979", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68F05", MRnumber = "80k:68058", MRreviewer = "Juhani Karhum{\"a}ki", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Computer Sci., Univ. of Waterloo, Waterloo, Ont., Canada", keywords = "biological; computability and decidability; decidability; doubly deterministic; grammars; OL systems; tabled", treatment = "T Theoretical or Mathematical", } @Article{A:1979:NME, author = "Gyula A. Mag{\'o}", title = "A network of microprocessors to execute reduction languages. {I}", journal = j-INT-J-COMPUT-INF-SCI, volume = "8", number = "5", pages = "349--385", year = "1979", MRclass = "68F10", MRnumber = "80i:68065", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, } @Article{Mago:1979:NMEa, author = "G. A. Mago", title = "A network of microprocessors to execute reduction languages. {I}", journal = j-INT-J-COMPUT-INF-SCI, volume = "8", number = "5", pages = "349--385", month = oct, year = "1979", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C5220 (Computer architecture)", corpsource = "Dept. of Computer Sci., Univ. of North Carolina, Chapel Hill, NC, USA", keywords = "cellular processor; computer architecture; interconnected networks; microprocessors; reduction languages; unbounded parallelism", treatment = "P Practical", } @Article{Weyuker:1979:APS, author = "Elaine J. Weyuker", title = "The applicability of program schema results to programs", journal = j-INT-J-COMPUT-INF-SCI, volume = "8", number = "5", pages = "387--403", month = oct, year = "1979", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68B10 (03D80)", MRnumber = "81d:68026", MRreviewer = "H. J{\"u}rgensen", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Dept. of Computer Sci., New York Univ., New York, NY, USA", keywords = "computability and decidability; optimisation; optimization; program schema results; program testing; programming theory; translatability", treatment = "T Theoretical or Mathematical", } @Article{Proskurowski:1979:MDC, author = "Andrzej Proskurowski", title = "Minimum dominating cycles in $2$-trees", journal = j-INT-J-COMPUT-INF-SCI, volume = "8", number = "5", pages = "405--417", month = oct, year = "1979", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68E10 (05C05)", MRnumber = "80m:68059", MRreviewer = "James R. Evans", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics)", corpsource = "Dept. of Computer Sci., Univ. of Oregon, Eugene, OR, USA", keywords = "directed trees; graphs; linear time algorithm; minimum dominating cycles; recursive representation; trees (mathematics); Z trees", treatment = "T Theoretical or Mathematical", } @Article{Stoutemyer:1979:CAC, author = "D. R. Stoutemyer", title = "Computer algebra for the calculus of variations, the maximum principle and automatic control", journal = j-INT-J-COMPUT-INF-SCI, volume = "8", number = "5", pages = "419--434", month = oct, year = "1979", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C1330 (Optimal control); C7420 (Control engineering computing)", corpsource = "Electrical Engng. Dept., Univ. of Hawaii, Honolulu, HI, USA", keywords = "automatic control; calculus of variations; control engineering computing; functional integrands; Hamiltonian; maximum principle; optimal control; optimal control problem; variational techniques", treatment = "T Theoretical or Mathematical", } @Article{Mago:1979:NMEb, author = "G. A. Mago", title = "A network of microprocessors to execute reduction languages. {II}", journal = j-INT-J-COMPUT-INF-SCI, volume = "8", number = "6", pages = "435--471", month = dec, year = "1979", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C5220 (Computer architecture)", corpsource = "Dept. of Computer Sci., Univ. of North Carolina, Chapel Hill, NC, USA", keywords = "cellular processor; computer architecture; computer networks; microprocessors; network; parallel processing; reduction languages; unbounded parallelism; user programs", treatment = "P Practical", } @Article{Koh:1979:FMS, author = "Hikyoo Koh and Henry Y. H. Chuang", title = "Finding a minimal set of base paths of a program", journal = j-INT-J-COMPUT-INF-SCI, volume = "8", number = "6", pages = "473--488", month = dec, year = "1979", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68B05 (68E10)", MRnumber = "81a:68012", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Dept. of Computer Sci., Wichita State Univ., Wichita, KS, USA", keywords = "base paths; eliminable arc; graph theory; maximal cutset; minimal set; program; program digraph; programming theory; weighted loopfree graph", treatment = "T Theoretical or Mathematical", } @Article{Kodratoff:1979:CFS, author = "Yves Kodratoff", title = "A class of functions synthesized from a finite number of examples and a {LISP} program scheme", journal = j-INT-J-COMPUT-INF-SCI, volume = "8", number = "6", pages = "489--521", month = dec, year = "1979", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68G10 (68B10)", MRnumber = "80i:68074", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Inst. de Programmation, CNRS, Paris, France", keywords = "finite number of examples; functions; LISP program scheme; pattern matching; programming theory", treatment = "T Theoretical or Mathematical", } @Article{Bochmann:1979:SEC, author = "Gregor V. Bochmann", title = "Semantic equivalence of covering attribute grammars", journal = j-INT-J-COMPUT-INF-SCI, volume = "8", number = "6", pages = "523--539", month = dec, year = "1979", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68F20", MRnumber = "81c:68070", MRreviewer = "Gianni Aguzzi", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. d'Informatique et de Recherche Operationnelle, Univ. de Montreal, Montreal, Que., Canada", keywords = "attribute grammars; equivalence; grammars; language definition; language implementation; language specifications; program verification; syntactic coverings", treatment = "T Theoretical or Mathematical", } @Article{Tou:1979:DDO, author = "Julius T. Tou", title = "{DYNOC}---a dynamic optimal cluster-seeking technique", journal = j-INT-J-COMPUT-INF-SCI, volume = "8", number = "6", pages = "541--547", month = dec, year = "1979", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68G10 (68C05)", MRnumber = "80k:68082", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "B6140C (Optical information, image and video signal processing); C1250 (Pattern recognition)", corpsource = "Center for Information Res., Univ. of Florida, Gainesville, FL, USA", keywords = "automatic clustering; computerised pattern recognition; DYNOC; multivariate data; optimal clusters; pattern recognition; performance index", treatment = "T Theoretical or Mathematical", } @Article{Tou:1980:AUG, author = "J. T. Tou", title = "An approach to understanding geometrical configurations by computer", journal = j-INT-J-COMPUT-INF-SCI, volume = "9", number = "1", pages = "1--13", month = feb, year = "1980", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6130 (Data handling techniques)", corpsource = "Center for Information Res., Univ. of Florida, Gainesville, FL, USA", keywords = "computer; computerised pattern recognition; geometrical configurations; topological transformations", treatment = "P Practical", } @Article{Stephenson:1980:MCB, author = "C. J. Stephenson", title = "A method for constructing binary search trees by making insertions at the root", journal = j-INT-J-COMPUT-INF-SCI, volume = "9", number = "1", pages = "15--29", month = feb, year = "1980", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6130 (Data handling techniques)", corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA", keywords = "binary search trees; insertions; sorting; symbol table; trees (mathematics)", treatment = "P Practical", } @Article{Maibaum:1980:HOD, author = "T. S. E. Maibaum and Carlos J. Lucena", title = "Higher order data types", journal = j-INT-J-COMPUT-INF-SCI, volume = "9", number = "1", pages = "31--53", month = feb, year = "1980", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68B15 (68J10)", MRnumber = "81d:68034", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation)", corpsource = "Dept. of Computer Sci., Univ. of Waterloo, Waterloo, Ont., Canada", keywords = "abstract data type; data base; data structures; functionality; higher order data type; query; update functions", } @Article{Chen:1980:FCR, author = "Tsong Yueh Chen", title = "Formalization of correctness of recursive definitions", journal = j-INT-J-COMPUT-INF-SCI, volume = "9", number = "1", pages = "55--61", month = feb, year = "1980", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "03D20 (68B10 68C25)", MRnumber = "81g:03047", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Computer Center, Univ. of Hong Kong, Hong Kong", keywords = "correctness; least fixpoint semantics; predicate calculus; programming theory; recursive definitions", treatment = "T Theoretical or Mathematical", } @Article{Lemme:1980:AQA, author = "J. M. Lemme and J. R. Rice", title = "Adaptive quadrature algorithms for the {ILLIAC IV}", journal = j-INT-J-COMPUT-INF-SCI, volume = "9", number = "1", pages = "63--72", month = feb, year = "1980", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4160 (Numerical integration and differentiation); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Computer Sci., Purdue Univ., Lafayette, IN, USA", keywords = "adaptive quadrature algorithms; algorithm theory; ILLIAC IV; integration; sequential processing; simulation tests", treatment = "T Theoretical or Mathematical", } @Article{Shedler:1980:RSM, author = "G. S. Shedler", title = "Response-time simulation of multivariate point process models for multiprogrammed jobstreams", journal = j-INT-J-COMPUT-INF-SCI, volume = "9", number = "2", pages = "73--91", month = apr, year = "1980", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6150J (Operating systems)", corpsource = "IBM Res. Lab., San Jose, CA, USA", keywords = "autoregressive dependency structure; discrete random variables; interval estimates; job response times; multiprogrammed jobstreams; multiprogramming; multivariable systems; multivariate point process models; response time simulation", treatment = "A Application; T Theoretical or Mathematical", } @Article{Townley:1980:PAR, author = "Judy A. Townley", title = "A pragmatic approach to resolution-based theorem proving", journal = j-INT-J-COMPUT-INF-SCI, volume = "9", number = "2", pages = "93--116", month = apr, year = "1980", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68G15 (03B35)", MRnumber = "81d:68129", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C1230 (Artificial intelligence)", corpsource = "Center for Res. in Computing Technol., Harvard Univ., Cambridge, MA, USA", keywords = "pragmatic approach; resolution based theorem proving; system theory; theorem proving", treatment = "T Theoretical or Mathematical", } @Article{Yang:1980:AFD, author = "Chao Chih Yang and Charmane P. May", title = "Algorithms for finding directed graph isomorphisms by finite automata", journal = j-INT-J-COMPUT-INF-SCI, volume = "9", number = "2", pages = "117--140", month = apr, year = "1980", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68E10", MRnumber = "81g:68099", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4220 (Automata theory)", corpsource = "Univ. of Alabama, Birmingham, AL, USA", keywords = "directed graph; directed graphs; finite automata; isomorphisms; Moore machines", treatment = "T Theoretical or Mathematical", } @Article{Bernorio:1980:QDD, author = "M. Bernorio and M. Bertoni and A. Dabbene and M. Somalvico", title = "Querying databases with a domain-oriented natural language understanding system", journal = j-INT-J-COMPUT-INF-SCI, volume = "9", number = "2", pages = "141--159", month = apr, year = "1980", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C1230 (Artificial intelligence); C4210 (Formal logic)", corpsource = "Politecnico di Milano, Milan, Italy", keywords = "artificial intelligence; domain oriented system; DONAU; grammars; natural language understanding system; querying databases; robotics; semantic domain", treatment = "T Theoretical or Mathematical", } @Article{Cunha:1980:DSM, author = "P. R. F. Cunha and C. J. Lucena and T. S. E. Maibaum", title = "On the design and specification of message oriented programs", journal = j-INT-J-COMPUT-INF-SCI, volume = "9", number = "3", pages = "161--191", month = jun, year = "1980", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6110 (Systems analysis and programming); C6120 (File organisation)", corpsource = "Dept. of Computer Sci., Univ. of Waterloo, Waterloo, Ont., Canada", keywords = "abstract data type; control structures; data structures; high level language; message oriented programs; module coupling; module strength; program and system documentation; program implementation; program specification; programming", treatment = "P Practical", } @Article{Cohen:1980:INL, author = "J. Cohen and R. Stachel", title = "An interpreter for a nondeterministic language", journal = j-INT-J-COMPUT-INF-SCI, volume = "9", number = "3", pages = "193--217", month = jun, year = "1980", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6150C (Compilers, interpreters and other processors)", corpsource = "Phys. Dept., Brandeis Univ., Waltham, MA, USA", keywords = "computer; interpreter; nondeterministic language; nucleus; PASCAL; primitive commands; problem solving; program interpreters; recursive procedures; recursive programming; top down description", treatment = "P Practical", } @Article{Lee:1980:TAC, author = "D. T. Lee and B. J. Schachter", title = "Two algorithms for constructing a {Delaunay} triangulation", journal = j-INT-J-COMPUT-INF-SCI, volume = "9", number = "3", pages = "219--242", month = jun, year = "1980", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "52-04 (32B25 68K05)", MRnumber = "81m:52001", MRreviewer = "Wolfgang Boehm", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics)", keywords = "average case performance; Delaunay triangulation; divide and conquer; geometric properties; topology", treatment = "T Theoretical or Mathematical", } @Article{Dhamdhere:1980:CAS, author = "D. M. Dhamdhere and J. R. Isaac", title = "A composite algorithm for strength reduction and code movement optimization", journal = j-INT-J-COMPUT-INF-SCI, volume = "9", number = "3", pages = "243--273", month = jun, year = "1980", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6110 (Systems analysis and programming)", corpsource = "Computer Centre, Indian Inst. of Technol., Bombay, India", keywords = "code movement optimization; composite algorithm; global program optimisation; loop invariant code; operator strength; programming; strength reduction; subexpression elimination", treatment = "P Practical", } @Article{Tou:1980:KE, author = "J. T. Tou", title = "Knowledge Engineering", journal = j-INT-J-COMPUT-INF-SCI, volume = "9", number = "4", pages = "275--285", month = aug, year = "1980", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C7250L (Non-bibliographic retrieval systems)", corpsource = "Center for Information Res., Univ. of Florida, Gainesville, FL, USA", keywords = "automated knowledge transfer; decision support system; information processing; information retrieval; knowledge engineering; MEDIKS", treatment = "A Application", } @Article{Arora:1980:WDM, author = "S. K. Arora and K. C. Smith", title = "{WCRL}: a data model independent language for database systems", journal = j-INT-J-COMPUT-INF-SCI, volume = "9", number = "4", pages = "287--305", month = aug, year = "1980", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6140E (Other programming languages); C6160B (Distributed databases)", corpsource = "Dept. of Electrical and Computer Engng., McMaster Univ., Hamilton, Ont., Canada", keywords = "data model independent language; data restructuring; database management systems; database systems; distributed database system; distributed processing; programming languages; WCRL", treatment = "A Application", } @Article{Hart:1980:FRB, author = "Johnson M. Hart", title = "Fast recognition of {Baxter} permutations using syntactical and complete bipartite composite dag's", journal = j-INT-J-COMPUT-INF-SCI, volume = "9", number = "4", pages = "307--321", month = aug, year = "1980", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68E10 (05C20)", MRnumber = "81m:68054", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic)", corpsource = "Dept. of Computer Sci., Univ. of Kentucky, Lexington, KY, USA", keywords = "Baxter permutations; complete bipartite composite dag; digraphs; fast recognition; formal languages; graph theory; language theory; syntactical graphs", treatment = "A Application; T Theoretical or Mathematical", } @Article{Bezdek:1980:SPC, author = "James C. Bezdek and Michael P. Windham and Robert Ehrlich", title = "Statistical parameters of cluster validity functionals", journal = j-INT-J-COMPUT-INF-SCI, volume = "9", number = "4", pages = "323--336", month = aug, year = "1980", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68G10 (03E72 62H30 92A05 92A27)", MRnumber = "82a:68166", MRreviewer = "Abraham Kandel", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "B6140C (Optical information, image and video signal processing); C1140Z (Other topics in statistics); C1160 (Combinatorial mathematics); C1250 (Pattern recognition)", corpsource = "Math. Dept., Utah State Univ., Logan, UT, USA", keywords = "classification entropy; cluster validity functionals; finite data sets; fuzzy c-partitions; fuzzy set theory; mean; monotonicity; partition coefficients; pattern recognition; statistical analysis; statistical tests; variance", treatment = "T Theoretical or Mathematical", } @Article{Cutler:1980:UPI, author = "Robert B. Cutler and Saburo Muroga", title = "Useless prime implicants of incompletely specified multiple-output switching functions", journal = j-INT-J-COMPUT-INF-SCI, volume = "9", number = "4", pages = "337--350", month = aug, year = "1980", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "94C10", MRnumber = "81m:94031", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4230 (Switching theory)", corpsource = "Dept. of Computer Sci., Univ. of Illinois, Urbana, IL, USA", keywords = "minimal sum representation; multiple-output switching functions; prime implicants; switching functions", treatment = "T Theoretical or Mathematical", } @Article{Putkonen:1980:OMO, author = "Anne Putkonen", title = "The order of merging operations for queries in inverted file systems", journal = j-INT-J-COMPUT-INF-SCI, volume = "9", number = "5", pages = "351--369", month = oct, year = "1980", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68H05", MRnumber = "82b:68085", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation)", corpsource = "Dept. of Computer Sci., Univ. of Turku, Turku, Finland", keywords = "address lists; Boolean expressions; CPU time; file organisation; heuristic algorithm; information retrieval; intersections; inverted file systems; merging operations; queries; search logic", treatment = "A Application; T Theoretical or Mathematical", } @Article{Veloso:1980:CRP, author = "Paulo A. S. Veloso", title = "Characterizations for the regular prefix codes and related families", journal = j-INT-J-COMPUT-INF-SCI, volume = "9", number = "5", pages = "371--382", month = oct, year = "1980", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68F05 (94B45)", MRnumber = "83e:68121", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4220 (Automata theory)", corpsource = "Dept. de Informatica, Pontificia Univ. Catolica, Rio de Janeiro, Brazil", keywords = "finite automata; formal languages; regular languages; regular prefix codes; related families", treatment = "A Application; T Theoretical or Mathematical", } @Article{Maekawa:1980:CPC, author = "M. Maekawa", title = "A classification of process coordination schemes in descriptive power", journal = j-INT-J-COMPUT-INF-SCI, volume = "9", number = "5", pages = "383--406", month = oct, year = "1980", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6110 (Systems analysis and programming); C6150J (Operating systems)", corpsource = "Dept. of Information Sci., Univ. of Tokyo, Tokyo, Japan", keywords = "classification; deadlock prevention; descriptive power; designers; event occurrences; logical conditions; multiplexing; mutual exclusions; operating system; operating systems (computers); process coordination schemes; process synchronization; systems analysis", treatment = "A Application", } @Article{Ng:1980:DIS, author = "Peter A. Ng and Lun Tsai", title = "The design and implementation of a scheme for large ordered indices", journal = j-INT-J-COMPUT-INF-SCI, volume = "9", number = "5", pages = "407--434", month = oct, year = "1980", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68B15 (68H05)", MRnumber = "82b:68016", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C6120 (File organisation); C6130 (Data handling techniques)", corpsource = "Dept. of Computer Sci., Univ. of Missouri, Columbia, MO, USA", keywords = "codes; design; file organisation; hierarchical tree structure; indexed sequential files; interruption; key compression; key redundancy; keys; large ordered indices; storage space; storage structure design; trees (mathematics)", treatment = "A Application", } @Article{Dujmovic:1980:CSC, author = "J. J. Dujmovic", title = "Computer selection and criteria for computer performance evaluation", journal = j-INT-J-COMPUT-INF-SCI, volume = "9", number = "6", pages = "435--458", month = dec, year = "1980", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C5420 (Mainframes and minicomputers)", corpsource = "Dept. of Computer and Information Sci., Univ. of Florida, Gainesville, FL, USA", keywords = "comparison; computer performance evaluation; computer selection and evaluation; decision process; monoprogramming; multiprogramming; selection; synthetic benchmark programs; worth indicators", treatment = "A Application", } @Article{Moyne:1980:LUP, author = "J. A. Moyne", title = "Language use: a performance model", journal = j-INT-J-COMPUT-INF-SCI, volume = "9", number = "6", pages = "459--481", month = dec, year = "1980", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C1230 (Artificial intelligence)", corpsource = "Dept. of Computer Sci., Queens Coll., City Univ. of New York, New York, NY, USA", keywords = "artificial intelligence; artificial intelligence models; human language comprehension; language understanding; language use; linguistics; performance", treatment = "A Application; T Theoretical or Mathematical", } @Article{Charnes:1980:CCS, author = "A. Charnes and W. W. Cooper and S. Duffuaa and M. Kress", title = "Complexity and computability of solutions to linear programming systems", journal = j-INT-J-COMPUT-INF-SCI, volume = "9", number = "6", pages = "483--506", month = dec, year = "1980", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "90C05", MRnumber = "83e:90082", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C1180 (Optimisation techniques); C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Univ. of Texas, Austin, TX, USA", keywords = "complexity; computability; computability and decidability; computational complexity; interval programming; linear programming; linear programming systems; polynomial", treatment = "T Theoretical or Mathematical", } @Article{Boyles:1981:EAT, author = "Stephanie M. Boyles and Gerhard X. Ritter", title = "The encoding of arbitrary two-dimensional geometric configurations", journal = j-INT-J-COMPUT-INF-SCI, volume = "10", number = "1", pages = "1--25", month = feb, year = "1981", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "52-04 (51-04 68K05)", MRnumber = "83a:52001", MRreviewer = "S. Amarel", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "B6120B (Codes); C1260 (Information theory); C6130 (Data handling techniques)", corpsource = "Center for Information Res., Univ. of Florida, Gainesville, FL, USA", keywords = "arbitrary curves; coherently oriented simplicial complexes; computing equipment; encoding; octagonal chain encoding; oriented simplexes; simplicial sentence; topology; triangulation; two-dimensional geometric configurations", treatment = "T Theoretical or Mathematical", } @Article{Huang:1981:NTW, author = "C. H. Huang and F. J. Taylor", title = "A new technique for {WFTA} input\slash output reordering", journal = j-INT-J-COMPUT-INF-SCI, volume = "10", number = "1", pages = "27--37", month = feb, year = "1981", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C5230 (Digital arithmetic methods)", corpsource = "Lockheed Palo Alto Res. Lab., Lockheed Missiles and Space Co. Inc., Palo Alto, CA, USA", keywords = "base numbers; Chinese remainder theorem; digital arithmetic; digital hardware; fast Fourier transforms; FFT; input/output reordering; multiplication count; number theoretic transform; residual arithmetic; RNS; transform; WFTA; Winograd Fourier transform algorithm", treatment = "T Theoretical or Mathematical", } @Article{DiSanto:1981:EIR, author = "M. {Di Santo} and L. Nigro and W. Russo", title = "On the efficient implementation of retention block-structured languages", journal = j-INT-J-COMPUT-INF-SCI, volume = "10", number = "1", pages = "39--54", month = feb, year = "1981", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6150J (Operating systems)", corpsource = "Dipartimento Elettrico, Univ. della Calabria, Cosenza, Italy", keywords = "dangling references; deletion strategy; deletion-retention contour machine; DRCM; garbage collector; garbage compaction algorithm; lifetime checks; LWS program; nonlocal gotos; retention block-structured languages; retention strategy; stack machine; storage management", treatment = "P Practical", } @Article{Farley:1981:PTM, author = "Arthur Farley and Stephen Hedetniemi and Andrzej Proskurowski", title = "Partitioning trees: matching, domination, and maximum diameter", journal = j-INT-J-COMPUT-INF-SCI, volume = "10", number = "1", pages = "55--61", month = feb, year = "1981", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68C05 (05C05 05C70 68E10)", MRnumber = "83a:68033", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics)", corpsource = "Dept. of Computer and Information Sci., Univ. of Oregon, Eugene, OR, USA", keywords = "associate partitions; diameter-bounded subtree; domination; graph theory; matching; maximum diameter; NP-complete; partitioning trees", treatment = "T Theoretical or Mathematical", } @Article{Kobayashi:1981:EQB, author = "I. Kobayashi", title = "Evaluation of queries based on the extended relational calculi", journal = j-INT-J-COMPUT-INF-SCI, volume = "10", number = "2", pages = "63--103", month = apr, year = "1981", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C1180 (Optimisation techniques); C6160D (Relational databases); C7250 (Information storage and retrieval)", corpsource = "SANNO Inst. of Business Administration, Kanagawa, Japan", keywords = "calculus; database management systems; database search algorithm; extended relational calculi; information retrieval; logical function; optimisation; optimization; queries; sequential collation; target list", treatment = "A Application; T Theoretical or Mathematical", } @Article{Jappinen:1981:SFR, author = "H. Jappinen", title = "Sense-controlled flexible robot behavior", journal = j-INT-J-COMPUT-INF-SCI, volume = "10", number = "2", pages = "105--125", month = apr, year = "1981", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C1230 (Artificial intelligence); C3355 (Control applications in manufacturing processes)", corpsource = "Digital Systems Lab., Helsinki Univ. of Technol., Espoo, Finland", keywords = "advice-taking mode; artificial intelligence; execution mode; flexible robot behavior; human teacher; industrial robots; robots; sense-controlled robot; skills", treatment = "A Application", } @Article{Proskurowski:1981:MDC, author = "Andrzej Proskurowski and Maciej M. Sys{\l}o", title = "Minimum dominating cycles in outerplanar graphs", journal = j-INT-J-COMPUT-INF-SCI, volume = "10", number = "2", pages = "127--139", month = apr, year = "1981", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "05C38 (05C10 68C25)", MRnumber = "83b:05083", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics)", corpsource = "Dept. of Computer and Information Sci., Univ. of Oregon, Eugene, OR, USA", keywords = "dominating cycles; graph theory; minimum size; outerplanar graphs; planar graphs; plane embedding", treatment = "T Theoretical or Mathematical", } @Article{Yager:1981:ARP, author = "Ronald R. Yager", title = "Approximate reasoning and possibilistic models in classification", journal = j-INT-J-COMPUT-INF-SCI, volume = "10", number = "2", pages = "141--175", month = apr, year = "1981", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68G10", MRnumber = "83b:68096", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C1140Z (Other topics in statistics); C1160 (Combinatorial mathematics)", corpsource = "Machine Intelligence Inst., Iona Coll., New Rochelle, NY, USA", keywords = "approximate reasoning; classification; fuzzy set theory; fuzzy sets; possibilistic models; probability", treatment = "T Theoretical or Mathematical", } @Article{Leipala:1981:DOI, author = "T. Leipala", title = "On the design of one-level indexed sequential files", journal = j-INT-J-COMPUT-INF-SCI, volume = "10", number = "3", pages = "177--186", month = jun, year = "1981", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6110 (Systems analysis and programming); C6120 (File organisation)", keywords = "continuous approximation; file organisation; indexed sequential files; one-level indexed sequential files; optimal design; probabilities; probability; records; systems analysis", treatment = "A Application; T Theoretical or Mathematical", } @Article{Arora:1981:GID, author = "Sudhir K. Arora and K. C. Smith", title = "A graphical interpretation of dependency structures in relational data bases", journal = j-INT-J-COMPUT-INF-SCI, volume = "10", number = "3", pages = "187--213", month = jun, year = "1981", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68H05 (68B15)", MRnumber = "83i:68145", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C6120 (File organisation); C6160D (Relational databases)", keywords = "automatic constraint checking; damaged data base; data structures; database management systems; dependency structures; graph theory; graphical interpretation; relational data bases; S-diagram; semantic situations", treatment = "A Application; T Theoretical or Mathematical", } @Article{Lewis:1981:STM, author = "F. D. Lewis", title = "Stateless {Turing} machines and fixed points", journal = j-INT-J-COMPUT-INF-SCI, volume = "10", number = "3", pages = "215--218", month = jun, year = "1981", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "03D10 (03D15 68C40)", MRnumber = "84a:03042", MRreviewer = "Andreas Brandst{\"a}dt", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory); C4240 (Programming and algorithm theory)", keywords = "computational complexity; fixed points; iteration theorem; iterative methods; recursion theorems; stateless Turing machines; subelementary; subrecursively; Turing machines", treatment = "A Application; T Theoretical or Mathematical", } @Article{Sarda:1981:CAD, author = "N. L. Sarda and J. R. Isaac", title = "Computer aided design of database internal schema", journal = j-INT-J-COMPUT-INF-SCI, volume = "10", number = "4", pages = "219--234", month = aug, year = "1981", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6110 (Systems analysis and programming); C6120 (File organisation); C6160 (Database management systems (DBMS)); C7430 (Computer engineering)", corpsource = "Computer Centre, Indian Inst. of Technol., Bombay, India", keywords = "computer aided design; data structures; database internal schema; database management systems; database systems; design; systems analysis; virtual machines", treatment = "P Practical", } @Article{Arora:1981:GNF, author = "S. K. Arora and K. C. Smith", title = "Graphical normal forms based on root dependencies in relational data base systems", journal = j-INT-J-COMPUT-INF-SCI, volume = "10", number = "4", pages = "235--259", month = aug, year = "1981", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6110 (Systems analysis and programming); C6160D (Relational databases)", corpsource = "Dept. of Electrical and Computer Engng., Wayne State Univ., Detroit, MI, USA", keywords = "database management systems; dependencies; graphical normal forms; hypergraphs; normal forms; relational data base systems; root dependencies; S-diagrams; systems analysis", treatment = "P Practical", } @Article{Arora:1981:TN, author = "S. K. Arora and S. R. Dumpala", title = "Theta-join and normalization", journal = j-INT-J-COMPUT-INF-SCI, volume = "10", number = "4", pages = "261--281", month = aug, year = "1981", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6110 (Systems analysis and programming); C6160D (Relational databases)", corpsource = "Dept. of Electrical and Computer Engng., Wayne State Univ., Detroit, MI, USA", keywords = "database management systems; dependency theory; logical design; normalization; relational data bases; splitting; systems analysis; theta-join; union", treatment = "P Practical", } @Article{Guida:1981:EPS, author = "G. Guida", title = "An effective preprocessor for structured {FORTRAN}: the {HENTRAN} system", journal = j-INT-J-COMPUT-INF-SCI, volume = "10", number = "4", pages = "283--297", month = aug, year = "1981", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6110 (Systems analysis and programming); C6140D (High level languages); C6150C (Compilers, interpreters and other processors)", corpsource = "Milan Polytech. Artificial Intelligence Project, Milan, Italy", keywords = "efficiency; HENTRAN; high level languages; portability; preprocessor; program interpreters; program processors; reliability; structured FORTRAN; structured programming; translator", treatment = "P Practical", } @Article{dosSantos:1981:CMD, author = "C. S. {dos Santos} and T. S. E. Maibaum and A. L. Furtado", title = "Conceptual modeling of data base operations", journal = j-INT-J-COMPUT-INF-SCI, volume = "10", number = "5", pages = "299--314", month = oct, year = "1981", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6160 (Database management systems (DBMS))", corpsource = "Univ. Federal do Rio Grande do Sul, Porto Alegre, Brazil", keywords = "conceptual modelling; data base operations; database management systems; predicate calculus; programming theory; query; theorem proving; update", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Bhargava:1981:OSI, author = "B. Bhargava and L. Lilien", title = "On optimal scheduling of integrity assertions in a transaction processing system", journal = j-INT-J-COMPUT-INF-SCI, volume = "10", number = "5", pages = "315--330", month = oct, year = "1981", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6160 (Database management systems (DBMS))", corpsource = "Dept. of Computer Sci., Univ. of Pittsburgh, Pittsburgh, PA, USA", keywords = "compile-time; database management systems; database values; DBMS; integrity assertions; optimal scheduling; post-execution validations; predicates; run-time; scheduling; transaction processing system", treatment = "P Practical; T Theoretical or Mathematical", } @Article{H:1981:CPL, author = "H. J{\"u}rgensen and D. E. Matthews and D. Wood", title = "Cut point languages of {Markov DTOL} systems", journal = j-INT-J-COMPUT-INF-SCI, volume = "10", number = "5", pages = "331--340", year = "1981", MRclass = "68F05 (68D22)", MRnumber = "83c:68094", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, } @Article{Jurgensen:1981:CPL, author = "H. Jurgensen and D. E. Matthews and D. Wood", title = "Cut point languages of {Markov DTOL} systems", journal = j-INT-J-COMPUT-INF-SCI, volume = "10", number = "5", pages = "331--340", month = oct, year = "1981", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C1140Z (Other topics in statistics); C4210 (Formal logic)", corpsource = "Inst. fur Theoretische Informatik, Tech. Hochschule Darmstadt, Darmstadt, West Germany", keywords = "classification; cut point; DDTOL languages; formal languages; grammars; Markov DTOL languages; Markov processes", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Zaki:1981:MBM, author = "M. Zaki", title = "Magnetic bubble memory structures for relational database management systems", journal = j-INT-J-COMPUT-INF-SCI, volume = "10", number = "5", pages = "341--358", month = oct, year = "1981", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C5320E (Storage on stationary magnetic media); C6120 (File organisation); C6130 (Data handling techniques); C6160D (Relational databases)", corpsource = "Dept. of Electrical Engng., Univ. of Suez Canal, Port Said, Egypt", keywords = "data handling; data structures; database management systems; logical operations; loops; magnetic bubble memory; magnetic storage; records permutation; relational database management systems; searching; sorting", treatment = "P Practical", } @Article{Bhargava:1981:CAR, author = "B. Bhargava and C. Hua", title = "Cost analysis of recovery block scheme and its implementation issues", journal = j-INT-J-COMPUT-INF-SCI, volume = "10", number = "6", pages = "359--382", month = dec, year = "1981", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C0310F (Software development management); C6150G (Diagnostic, testing, debugging and evaluating systems)", corpsource = "Dept. of Computer Sci., Univ. of Pittsburgh, PA, USA", keywords = "cost analysis; cost of failure; cost-reliability index; perfect acceptance tests; performance evaluation measures; real-time applications; recovery block scheme; selection criterion; software engineering; software granularity; software reliability; system failure and recovery; system recovery", treatment = "E Economic; P Practical", } @Article{Zaki:1981:QCH, author = "A. S. Zaki and J. L. Baer", title = "Query costs in {HB(1)} trees versus $2$-$3$ trees", journal = j-INT-J-COMPUT-INF-SCI, volume = "10", number = "6", pages = "383--395", month = dec, year = "1981", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation); C7250L (Non-bibliographic retrieval systems)", corpsource = "Coll. of William and Mary, Williamsburg, VA, USA", keywords = "2-3 trees; data structures; HB(1) trees; information retrieval; key comparisons; main storage; node visits; query costs; random AVL trees; trees (mathematics)", treatment = "P Practical", } @Article{Murty:1981:HCP, author = "M. N. Murty and G. Krishna", title = "A hybrid clustering procedure for concentric and chain-like clusters", journal = j-INT-J-COMPUT-INF-SCI, volume = "10", number = "6", pages = "397--412", month = dec, year = "1981", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6130 (Data handling techniques)", corpsource = "School of Automation, Indian Inst. of Sci., Bangalore, India", keywords = "chain-like clusters; concentric clusters; data handling; hybrid clustering procedure; initial seed points; input data order; isotropic clusters; K-means algorithm; multilevel theory; nonhierarchical method; partitioning; relabeling; representative samples; storage requirements", treatment = "P Practical", } @Article{Shapiro:1981:NLS, author = "Marvin Shapiro", title = "A note on {Lee} and {Schachter}'s algorithm for {Delaunay} triangulation", journal = j-INT-J-COMPUT-INF-SCI, volume = "10", number = "6", pages = "413--418", month = dec, year = "1981", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "52-04", MRnumber = "83k:52002", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics)", corpsource = "Div. of Computer Res. and Technol., Nat. Inst. of Health, Bethesda, MD, USA", keywords = "convex hull; Delaunay triangulation; Dirichlet tesselation; graph theory; Voronoi tesselation", treatment = "T Theoretical or Mathematical", } @Article{Tai:1982:ICC, author = "J. W. Tai and K. S. Fu", title = "Inference of a class of {CFPG} by means of semantic rules", journal = j-INT-J-COMPUT-INF-SCI, volume = "11", number = "1", pages = "1--23", month = feb, year = "1982", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68F05", MRnumber = "83g:68113", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Inst. of Automation, Acad. of Sci., Beijing, China", keywords = "binary tree; CFPG; context-free grammars; context-free programmed grammars; control diagram; grammatical inference; maximum-likelihood estimate; semantic rules; subtrees; syntactic pattern recognition", treatment = "P Practical", } @Article{Giloi:1982:CRH, author = "W. K. Giloi and R. Gueth", title = "Concepts and realization of a high-performance data type architecture", journal = j-INT-J-COMPUT-INF-SCI, volume = "11", number = "1", pages = "25--54", month = feb, year = "1982", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C5220 (Computer architecture); C6120 (File organisation)", corpsource = "Fachbereich Informatik, Tech. Univ. of Berlin, Berlin, West Germany", keywords = "abstract data types; computer architecture; data structures; fifth generation computer architecture; hardware structure; high-performance data type architecture; quality software; run time checking; SIMD; strongly coupled asymmetric multicomputer system; structured machine data type; vector-structured basic machine data type", treatment = "P Practical", } @Article{Stout:1982:SEI, author = "Quentin F. Stout", title = "Searching and encoding for infinite ordered sets", journal = j-INT-J-COMPUT-INF-SCI, volume = "11", number = "1", pages = "55--72", month = feb, year = "1982", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68E05", MRnumber = "84i:68107", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation)", corpsource = "Math. Sci., State Univ. of New York, Binghamton, NY, USA", keywords = "binary prefix encodings; binary search algorithms; encoding; infinite ordered sets; search-related codes; table lookup", treatment = "P Practical", } @Article{Thomason:1982:SST, author = "M. G. Thomason", title = "Syntactic\slash semantic techniques in pattern recognition: a survey", journal = j-INT-J-COMPUT-INF-SCI, volume = "11", number = "2", pages = "75--100", month = apr, year = "1982", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "B6140C (Optical information, image and video signal processing); C1250 (Pattern recognition)", corpsource = "Dept. of Computer Sci., Univ. of Tennessee, Knoxville, TN, USA", keywords = "attributes; automata; formal languages; grammars; grammatical inferrence; pattern recognition; probabilistic models; semantics; stochastic systems; syntactic error-correction; syntax", } @Article{Hooper:1982:SS, author = "J. W. Hooper and K. D. Reilly", title = "Simulation strategies", journal = j-INT-J-COMPUT-INF-SCI, volume = "11", number = "2", pages = "101--122", month = apr, year = "1982", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6140D (High level languages); C7400 (Engineering computing)", corpsource = "Computer Sci. Dept., Univ. of Alabama, Huntsville, AL, USA", keywords = "activity scanning; digital simulation; event scheduling; next event selection; process interaction; simulation languages; Simulation strategies; time control procedure; timing management", treatment = "P Practical", } @Article{Alia:1982:SNF, author = "G. Alia and E. Martinelli", title = "On switching network functionalities and their relationships", journal = j-INT-J-COMPUT-INF-SCI, volume = "11", number = "2", pages = "123--138", month = apr, year = "1982", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4230 (Switching theory); C5220 (Computer architecture)", corpsource = "Istituto di Elaborazione dell'Informazione, CNR, Pisa, Italy", keywords = "circuit switching networks; composition; computer architecture; inclusion; multiprocessor systems; resource allocation; specularity; switching functions; switching network functionalities; telephone applications", treatment = "P Practical", } @Article{Remy:1982:CDT, author = "J.-L. R{\'e}my and P. A. S. Veloso", title = "Comparing data type specifications via their normal forms", journal = j-INT-J-COMPUT-INF-SCI, volume = "11", number = "3", pages = "141--153", month = jun, year = "1982", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68B15", MRnumber = "83m:68042", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation)", corpsource = "CRIN, Nancy, France", keywords = "abstract data type; data structures; data type specifications; isomorphic initial algebras; normal forms", treatment = "T Theoretical or Mathematical", } @Article{Ottman:1982:CID, author = "Th. Ottman and D. Wood", title = "A comparison of iterative and defined classes of search trees", journal = j-INT-J-COMPUT-INF-SCI, volume = "11", number = "3", pages = "155--178", year = "1982", MRclass = "68E05", MRnumber = "83m:68113", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, } @Article{Ottmann:1982:CID, author = "Th. Ottmann and D. Wood", title = "A comparison of iterative and defined classes of search trees", journal = j-INT-J-COMPUT-INF-SCI, volume = "11", number = "3", pages = "155--178", month = jun, year = "1982", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation)", keywords = "data structures; iterative; iteratively defined classes; search trees; trees (mathematics)", treatment = "T Theoretical or Mathematical", xxauthor = "Th. Ottman and D. Wood", } @Article{Grant:1982:OES, author = "John Grant and Jack Minker", title = "On optimizing the evaluation of a set of expressions", journal = j-INT-J-COMPUT-INF-SCI, volume = "11", number = "3", pages = "179--191", month = jun, year = "1982", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68H05 (68C20)", MRnumber = "83m:68165", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C6160D (Relational databases)", corpsource = "Towson State Univ., Towson, MD, USA", keywords = "Boolean algebra; Boolean optimization; branch-and-bound type algorithm; database management systems; database queries; heuristic information; optimisation; relational expressions; set of expressions", treatment = "T Theoretical or Mathematical", } @Article{Brody:1982:PUA, author = "E. J. Brody", title = "A procedure for the unsupervised abduction of linguistic distributional classes in probabilistic languages", journal = j-INT-J-COMPUT-INF-SCI, volume = "11", number = "3", pages = "193--210", month = jun, year = "1982", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68F15 (68D27 68G05)", MRnumber = "83m:68148", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4220 (Automata theory)", corpsource = "Dept. of Math. Engng. and Instrumentation Phys., Univ. of Tokyo, Tokyo, Japan", keywords = "computational linguistics; computational procedure; finite automata; formal languages; linguistic distributional classes; probabilistic languages; syntactic distributional classes; unsupervised abduction; word distributional equivalence", treatment = "T Theoretical or Mathematical", } @Article{Xu:1982:PSC, author = "Jian Hua Xu and Julius T. Tou", title = "Predictive searching for chain encoding by computers", journal = j-INT-J-COMPUT-INF-SCI, volume = "11", number = "4", pages = "213--229", month = aug, year = "1982", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68G10 (92A10)", MRnumber = "84b:68133", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C7410F (Communications computing)", corpsource = "Center for Information Res., Univ. of Florida, Gainesville, FL, USA", keywords = "chain encoding; chromosomes; computer analysis; computerised pattern recognition; computers; crossing; curve; minimum mean-square-error; optimal code direction; overlapping; predictive searching; touching", treatment = "P Practical", } @Article{Barnard:1982:HSE, author = "David T. Barnard and Richard C. Holt", title = "Hierarchic syntax error repair for {LR} grammars", journal = j-INT-J-COMPUT-INF-SCI, volume = "11", number = "4", pages = "231--258", month = aug, year = "1982", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68F25 (68B10)", MRnumber = "84b:68113", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C6150C (Compilers, interpreters and other processors)", corpsource = "Computer Systems Res. Group, Univ. of Toronto, Toronto, Ont., Canada", keywords = "compilers; grammars; hierarchic error repair; LR grammars; parser; program compilers; syntax error repair", treatment = "P Practical", } @Article{Voukalis:1982:RCO, author = "D. C. Voukalis", title = "Remarks concerning the optimization of matrix codes", journal = j-INT-J-COMPUT-INF-SCI, volume = "11", number = "4", pages = "259--273", month = aug, year = "1982", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "B6120B (Codes)", keywords = "digital channels; error correction codes; matrix codes; optimization; parallelotope; parity check; systematic binary error correcting codes", treatment = "T Theoretical or Mathematical", } @Article{Ras:1982:AAI, author = "Z. W. Ras", title = "An algebraic approach to information retrieval systems", journal = j-INT-J-COMPUT-INF-SCI, volume = "11", number = "4", pages = "275--293", month = aug, year = "1982", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C7250L (Non-bibliographic retrieval systems)", corpsource = "Dept. of Math., Univ. of North Carolina, Charlotte, NC, USA", keywords = "Boolean algebra; information retrieval systems; mathematical pictoriality; objects; partially ordered set; requests; retrieval methods", treatment = "P Practical", } @Article{W:1982:AAI, author = "Zbigniew W. Ra{\'s}", title = "An algebraic approach to information retrieval systems", journal = j-INT-J-COMPUT-INF-SCI, volume = "11", number = "4", pages = "275--293", year = "1982", MRclass = "68H05", MRnumber = "84b:68139", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, } @Article{Veloso:1982:MSA, author = "P. A. S. Veloso", title = "Methodical specification of abstract data types via rewriting systems", journal = j-INT-J-COMPUT-INF-SCI, volume = "11", number = "5", pages = "295--323", month = oct, year = "1982", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68B15", MRnumber = "84f:68020", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6110 (Systems analysis and programming); C6120 (File organisation)", corpsource = "Dept. Informatica, Pontificia Univ. Catolica, Rio de Janeiro, Brazil", keywords = "abstract data types; data structures; formal specification; programming; rewriting systems", treatment = "P Practical", } @Article{Chang:1982:FAD, author = "Shi Kuo Chang and An Chi Liu", title = "File allocation in a distributed database", journal = j-INT-J-COMPUT-INF-SCI, volume = "11", number = "5", pages = "325--340", month = oct, year = "1982", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68B15 (68H05 90B10)", MRnumber = "84f:68015", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation); C6160B (Distributed databases)", corpsource = "Dept. of Electrical Engng., Illinois Inst. of Technol., Chicago, IL, USA", keywords = "concurrency control cost; database management systems; distributed database; distributed processing; file allocation problem; file organisation; network flow problem; optimal solution", treatment = "P Practical", } @Article{Pawlak:1982:RS, author = "Zdzis{\l}aw Pawlak", title = "Rough sets", journal = j-INT-J-COMPUT-INF-SCI, volume = "11", number = "5", pages = "341--356", month = oct, year = "1982", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68G99 (03E72)", MRnumber = "84f:68077", bibdate = "Wed Nov 01 08:48:45 2000", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics)", corpsource = "Inst. of Computer Sci., Polish Acad. of Sci., Warsaw, Poland", keywords = "AI; approximate operations; classification; cluster analysis; fuzzy sets theory; learning algorithms; measurement theory; pattern recognition; set theory; sets; tolerance theory", treatment = "T Theoretical or Mathematical", } @Article{Hassen:1982:ESD, author = "J. V. Hassen and W. F. {Messier, Jr.}", title = "Expert systems for decision support in {EDP} auditing", journal = j-INT-J-COMPUT-INF-SCI, volume = "11", number = "5", pages = "357--379", month = oct, year = "1982", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C0310 (EDP management); C1230 (Artificial intelligence); C7190 (Other fields of business and administrative computing)", corpsource = "Brigham Young Univ., Provo, UT, USA", keywords = "artificial intelligence; computer auditing; decision support; DP management; EDP auditing; EDP management; expert systems; management information systems; MIS", treatment = "A Application", } @Article{Motzkin:1982:EES, author = "Dalia Motzkin and Christina L. Hansen", title = "An efficient external sorting with minimal space requirement", journal = j-INT-J-COMPUT-INF-SCI, volume = "11", number = "6", pages = "381--396", month = dec, year = "1982", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68P10", MRnumber = "703 945", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation)", corpsource = "Dept. of Computer Sci., Western Michigan Univ., Kalamazoo, MI, USA", keywords = "disk space; external sorting; internal storage; minimal space requirement; passes; quicksort; sorting", treatment = "P Practical", } @Article{Ewa:1982:RTI, author = "Ewa Or{\l}owska", title = "Representation of temporal information", journal = j-INT-J-COMPUT-INF-SCI, volume = "11", number = "6", pages = "397--408", year = "1982", MRclass = "03B45 (68Q60)", MRnumber = "85e:03046", MRreviewer = "Joseph Y. Halpern", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, } @Article{Orlowska:1982:RTI, author = "E. Orlowska", title = "Representation of temporal information", journal = j-INT-J-COMPUT-INF-SCI, volume = "11", number = "6", pages = "397--408", month = dec, year = "1982", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C6160 (Database management systems (DBMS))", corpsource = "Inst. of Computer Sci., Polish Acad. of Sci., Warszawa, Poland", keywords = "assertion; database management systems; DBMS; formal languages; logic formalism; objects; Pawlak's information system; temporal information", treatment = "P Practical", } @Article{Lee:1982:EAF, author = "Edward T. Lee", title = "An efficient algorithm for finding {Kleene} closure of regular expression matrices", journal = j-INT-J-COMPUT-INF-SCI, volume = "11", number = "6", pages = "409--415", month = dec, year = "1982", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68F10", MRnumber = "84i:68140", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "B6140C (Optical information, image and video signal processing); C1110 (Algebra); C1250 (Pattern recognition); C4220 (Automata theory)", corpsource = "Dept. of Math. Sci., Memphis State Univ., Memphis, TN, USA", keywords = "automata theory; efficient algorithm; fuzzy regular expression matrices; Kleene closure; matrix algebra; pattern recognition; pictorial information systems; regular expression matrices", treatment = "T Theoretical or Mathematical", } @Article{Lin:1982:CPT, author = "Wei Chung Lin and King Sun Fu", title = "Conversion and parsing of tree transducers for syntactic pattern analysis", journal = j-INT-J-COMPUT-INF-SCI, volume = "11", number = "6", pages = "417--458", month = dec, year = "1982", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68G10 (68F25)", MRnumber = "84i:68155", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "B6140C (Optical information, image and video signal processing); C1250 (Pattern recognition); C4210 (Formal logic); C4220 (Automata theory)", corpsource = "School of Electrical Engng., Purdue Univ., Lafayette, IN, USA", keywords = "automata theory; finite state transformation; grammars; human motion; minimum distance structure-preserved error-correcting tree automaton; parsing; picture processing; syntactic pattern analysis; top-down backtrack parsing algorithm; tree transducers", treatment = "T Theoretical or Mathematical", } @Article{Barrero:1983:RLT, author = "A. Barrero and M. G. Thomason and R. C. Gonzalez", title = "Regular-like tree expressions", journal = j-INT-J-COMPUT-INF-SCI, volume = "12", number = "1", pages = "1--11", year = "1983", MRclass = "68F05", MRnumber = "84m:68058", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, } @Article{Barrero:1983:RTE, author = "A. Barrero and M. G. Thomason and R. C. Gonzalez", title = "Regular-like tree expressions", journal = j-INT-J-COMPUT-INF-SCI, volume = "12", number = "1", pages = "1--121", month = feb, year = "1983", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic)", corpsource = "Dept. of Electrical Engng., Univ. of Tennessee, Knoxville, TN, USA", keywords = "chemistry grammars; context-free languages; expansive tree grammar; expansive tree languages; one-to-one correspondence; regular-like tree; regularity-preserving transformations; trees (mathematics)", treatment = "P Practical", } @Article{Zaki:1983:CST, author = "A. S. Zaki", title = "A comparative study of $2$-$3$ trees and {AVL} trees", journal = j-INT-J-COMPUT-INF-SCI, volume = "12", number = "1", pages = "13--33", month = feb, year = "1983", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation)", corpsource = "Coll. of William and Mary, Williamsburg, VA, USA", keywords = "2-3 trees; AVL trees; construction; data structure; data structures; query cost; space complexity; storage cost; top-down insertion; trees (mathematics)", treatment = "P Practical", } @Article{Hansen:1983:SME, author = "J. V. Hansen and W. F. {Messier, Jr.}", title = "Scheduling the monitoring of {EDP} controls in online systems", journal = j-INT-J-COMPUT-INF-SCI, volume = "12", number = "1", pages = "35--46", month = feb, year = "1983", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C0310B (Computer facilities); C7100 (Business and administration)", corpsource = "Brigham Young Univ., Provo, UT, USA", keywords = "administrative data processing; ADP; audit modules; computer applications; database management systems; distributed networks; DP management; EDP controls; financial reporting; internal control; monitoring; online processing; online systems; operational effectiveness; scheduling; systems design", treatment = "P Practical", } @Article{Srimani:1983:SWN, author = "P. K. Srimani and B. P. Sinha", title = "A simple way to near minimization of microprogram control memory", journal = j-INT-J-COMPUT-INF-SCI, volume = "12", number = "1", pages = "47--64", month = feb, year = "1983", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C5220 (Computer architecture); C6110 (Systems analysis and programming)", corpsource = "Indian Inst. of Management Calcutta, Calcutta, India", keywords = "dynamic microprogramming; feasible cost; maximal compatible class; microprogram control memory; microprogrammed digital computer; microprogramming; minimization; reduction methodology; ROM; WCS minimization", treatment = "P Practical", } @Article{Bradley:1983:AAR, author = "James Bradley", title = "Application of {SQL/N} to the attribute-relation associations implicit in functional dependencies", journal = j-INT-J-COMPUT-INF-SCI, volume = "12", number = "2", pages = "65--86", year = "1983", MRclass = "68B15 (68H05)", MRnumber = "84m:68011", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, } @Article{Bradley:1983:ASA, author = "J. Bradley", title = "Application of {SQL/N} to the attribute-relation associations implicit in functional dependencies", journal = j-INT-J-COMPUT-INF-SCI, volume = "12", number = "2", pages = "65--86", month = apr, year = "1983", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6140D (High level languages); C6160D (Relational databases); C7250 (Information storage and retrieval)", corpsource = "Univ. of Calgary, Alta., Canada", keywords = "attribute-relation associations; database management systems; DBMS; expressive nonprocedural data base language; functional dependencies; high level languages; information retrieval; natural quantifiers; retrieval language; SQL/N", treatment = "P Practical", } @Article{Lee:1983:FCH, author = "D. T. Lee", title = "On finding the convex hull of a simple polygon", journal = j-INT-J-COMPUT-INF-SCI, volume = "12", number = "2", pages = "87--98", month = apr, year = "1983", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68U05 (52-04)", MRnumber = "85a:68169", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Electrical Engng. and Computer Sci., Northwestern Univ., Evanston, IL, USA", keywords = "algorithm theory; computational geometry; convex hull; linear time algorithm; simple polygon; stack; topology", treatment = "T Theoretical or Mathematical", } @Article{Badii:1983:AMP, author = "F. Badi'i and B. Peikari", title = "Approximation of multipath planar shapes in pattern analysis", journal = j-INT-J-COMPUT-INF-SCI, volume = "12", number = "2", pages = "99--110", month = apr, year = "1983", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "B6140C (Optical information, image and video signal processing); C1250 (Pattern recognition)", corpsource = "Southern Methodist Univ., Dallas, TX, USA", keywords = "edge detection; feature extraction; function approximation; functional approximation; multipath approximation; multipath curves; multipath planar shapes; pattern analysis; pattern recognition; two-dimensional images", treatment = "T Theoretical or Mathematical", } @Article{Hooper:1983:GCG, author = "J. W. Hooper and K. D. Reilly", title = "The {GPSS-GASP} combined ({GGC}) system", journal = j-INT-J-COMPUT-INF-SCI, volume = "12", number = "2", pages = "111--136", month = apr, year = "1983", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6140D (High level languages)", corpsource = "Computer Sci. Dept., Univ. of Alabama, Huntsville, AL, USA", keywords = "discrete event modeling; discrete event simulation languages; GASP; GASP IV; GGC; GPSS; simulation languages; SLAM", treatment = "P Practical", } @Article{Brody:1983:TFL, author = "E. J. Brody", title = "A topological formulation of linguistic typology", journal = j-INT-J-COMPUT-INF-SCI, volume = "12", number = "3", pages = "137--150", month = jun, year = "1983", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68Q45 (54H99 68S05)", MRnumber = "85a:68087", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Math. Engng. and Instrumentation Phys., Univ. of Tokyo, Tokyo, Japan", keywords = "compacta; continuous mappings; equivalence problem; formal languages; isomorphism; linguistic typology; programming languages; topological formulation", treatment = "T Theoretical or Mathematical", } @Article{Casanova:1983:TDD, author = "Marco A. Casanova", title = "A theory of data dependencies over relational expressions", journal = j-INT-J-COMPUT-INF-SCI, volume = "12", number = "3", pages = "151--191", month = jun, year = "1983", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68P15", MRnumber = "85a:68033", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6160D (Relational databases)", corpsource = "Centro Cientifico de Brasilia, IBM do Brazil, Brasilia, Brazil", keywords = "data dependencies; database management systems; first-order analytic tableaux; IDEX; implicational dependencies; integrity constraints; relational expressions; relational model", treatment = "T Theoretical or Mathematical", } @Article{Kostovetsky:1983:TST, author = "A. Kostovetsky", title = "Time separation technique for large databases", journal = j-INT-J-COMPUT-INF-SCI, volume = "12", number = "3", pages = "193--209", month = jun, year = "1983", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6160 (Database management systems (DBMS))", corpsource = "Computervision Corp., Bedford, MA, USA", keywords = "closed-loop algorithm; database management systems; large databases; network aggregation; operating schedule; probabilistic approach; time decomposition technique; time separation technique", treatment = "P Practical", } @Article{Gligor:1983:VPM, author = "V. D. Gligor", title = "The verification of the protection mechanisms of high-level language machines", journal = j-INT-J-COMPUT-INF-SCI, volume = "12", number = "4", pages = "211--246", month = aug, year = "1983", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C5220 (Computer architecture)", corpsource = "Dept. of Electrical Engng., Univ. of Maryland, College Park, MD, USA", keywords = "Burroughs B6700/6800; computer architecture; high-level language machines; protection mechanisms; verification", treatment = "T Theoretical or Mathematical", } @Article{Gyssens:1983:AVF, author = "M. Gyssens and J. Paredaens", title = "Another view of functional and multivalued dependencies in the relational database model", journal = j-INT-J-COMPUT-INF-SCI, volume = "12", number = "4", pages = "247--267", month = aug, year = "1983", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68P15", MRnumber = "85f:68017", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6160D (Relational databases)", corpsource = "Dept. of Math., Univ. of Antwerp, Wilrijk, Belgium", keywords = "acyclic join dependencies; database management systems; integrity constraints; multivalued dependencies; pseudo-multivalued dependencies; relational database model", treatment = "T Theoretical or Mathematical", } @Article{Jajodia:1983:EDW, author = "S. Jajodia and P. A. Ng and F. N. Springsteel", title = "Entity-relationship diagrams which are in {BCNF}", journal = j-INT-J-COMPUT-INF-SCI, volume = "12", number = "4", pages = "269--283", month = aug, year = "1983", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C6160D (Relational databases)", corpsource = "Dept. of Computer Sci., Univ. of Missouri-Columbia, Columbia, MO, USA", keywords = "BCNF; Boyce-Codd Normal Form; database management systems; database theory; databases; entity-relationship diagrams; ERD; functional dependency; grammars; loop-free ERD; regularity; relational scheme", treatment = "T Theoretical or Mathematical", } @Article{Jajodia:1983:ERD, author = "Sushil Jajodia and Peter A. Ng and Frederick N. Springsteel", title = "Entity-relationship diagrams which are in {BCNF}", journal = j-INT-J-COMPUT-INF-SCI, volume = "12", number = "4", pages = "269--283", year = "1983", MRclass = "68P15", MRnumber = "85i:68014", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, } @Article{Akritas:1983:CEA, author = "A. G. Akritas and S. S. Iyengar and A. A. Rampuria", title = "Computationally efficient algorithms for a one-time pad scheme", journal = j-INT-J-COMPUT-INF-SCI, volume = "12", number = "4", pages = "285--316", month = aug, year = "1983", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68P25 (94A99)", MRnumber = "741 781", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6130 (Data handling techniques)", corpsource = "Dept. of Computer Sci., Univ. of Kansas, Lawrence, KS, USA", keywords = "chi-square method; ciphers security; cryptography; data processing; one-time pad scheme", treatment = "T Theoretical or Mathematical", } @Article{Lee:1983:SSA, author = "Tony T. Lee", title = "A state space approach to the finite automata", journal = j-INT-J-COMPUT-INF-SCI, volume = "12", number = "5", pages = "317--335", month = oct, year = "1983", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68Q99", MRnumber = "85h:68062", MRreviewer = "I. Pe{\'a}k", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory)", corpsource = "Polytech. Inst. of New York, New York, NY, USA", keywords = "finite automata; fixed point theorem; invariant subspace; Psi -representation; state equation; state space approach; state-space methods", treatment = "T Theoretical or Mathematical", } @Article{Kak:1983:EMP, author = "Subhash C. Kak", title = "Exponentiation modulo a polynomial for data security", journal = j-INT-J-COMPUT-INF-SCI, volume = "12", number = "5", pages = "337--346", month = oct, year = "1983", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68P25 (94A60)", MRnumber = "85f:68023", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6130 (Data handling techniques)", corpsource = "Dept. of Electrical and Computer Engng., Louisiana State Univ., Baton Rouge, LA, USA", keywords = "cryptography; data security; encryption; exponential modulo; public-key cryptosystem; RSA algorithm; security of data", treatment = "P Practical", } @Article{Toussaint:1983:CLE, author = "Godfried T. Toussaint", title = "Computing largest empty circles with location constraints", journal = j-INT-J-COMPUT-INF-SCI, volume = "12", number = "5", pages = "347--358", month = oct, year = "1983", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68U05 (52-04)", MRnumber = "85f:68093", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C1290 (Applications of systems theory)", corpsource = "School of Computer Sci., McGill Univ., Montreal, Que., Canada", keywords = "computational complexity; computational geometry; facility location; largest empty circles; location constraints; operations research; polygons; Voronoi diagram", treatment = "T Theoretical or Mathematical", } @Article{H:1983:LWS, author = "H. J{\"u}rgensen and G. Thierrin", title = "On $ \omega $-languages whose syntactic monoid is trivial", journal = j-INT-J-COMPUT-INF-SCI, volume = "12", number = "5", pages = "359--365", year = "1983", MRclass = "68Q45 (20M35)", MRnumber = "85m:68016", MRreviewer = "M. Kunze", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, } @Article{Jurgensen:1983:OWS, author = "H. Jurgensen and G. Thierrin", title = "On omega-languages whose syntactic monoid is trivial", journal = j-INT-J-COMPUT-INF-SCI, volume = "12", number = "5", pages = "359--365", month = oct, year = "1983", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Computer Sci., Univ. of Western Ontario, London, Ont., Canada", keywords = "finite state acceptable omega -languages; formal languages; omega -languages; syntactic monoid", treatment = "T Theoretical or Mathematical", } @Article{Nau:1983:GGS, author = "Dana S. Nau", title = "On game graph structure and its influence on pathology", journal = j-INT-J-COMPUT-INF-SCI, volume = "12", number = "6", pages = "367--383", month = dec, year = "1983", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68T01 (90D35 92A25)", MRnumber = "85h:68071", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C1140E (Game theory); C1160 (Combinatorial mathematics); C1230 (Artificial intelligence)", corpsource = "Dept. of Computer Sci., Univ. of Maryland, College Park, MD, USA", keywords = "artificial intelligence; game graph structure; game theory; game tree search procedures; graph theory; minimaxing; pathology; sibling nodes", treatment = "T Theoretical or Mathematical", } @Article{Niemi:1983:FRF, author = "Timo Niemi", title = "Formal restructuring functions for hierarchical data bases", journal = j-INT-J-COMPUT-INF-SCI, volume = "12", number = "6", pages = "385--411", month = dec, year = "1983", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68P15", MRnumber = "85e:68018", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation); C6160 (Database management systems (DBMS))", corpsource = "Dept. of Math. Sci., Tampere Univ., Tampere, Finland", keywords = "data restructuring; data structures; database management systems; hierarchical data bases; hierarchical data structures; restructuring software; target data base; transformation language", treatment = "P Practical", } @Article{Budd:1983:SGP, author = "Timothy A. Budd", title = "Safety in grammatical protection systems", journal = j-INT-J-COMPUT-INF-SCI, volume = "12", number = "6", pages = "413--431", month = dec, year = "1983", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68N25", MRnumber = "85e:68007", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C6150J (Operating systems)", corpsource = "Dept. of Computer Sci., Univ. of Arizona, Tucson, AZ, USA", keywords = "context free languages; grammars; grammatical protection systems; NP-complete; operating system protection mechanisms; operating systems (computers); P-space complete; polynomial time decision procedure; safety; security of data", treatment = "T Theoretical or Mathematical", } @Article{Ankeney:1983:CTA, author = "Lawrence A. Ankeney and Gerhard X. Ritter", title = "Cellular topology and its applications in image processing", journal = j-INT-J-COMPUT-INF-SCI, volume = "12", number = "6", pages = "433--456", month = dec, year = "1983", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68U10 (68Q80)", MRnumber = "85e:68094", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "B6140C (Optical information, image and video signal processing); C1160 (Combinatorial mathematics); C1250 (Pattern recognition)", corpsource = "Air Force Armament Lab., Eglin Air Force Base, FL, USA", keywords = "cellular automata; cellular image processing operations; image processing; Minkowski algebra; neighborhood transform; nondiscrete cellular topologies; picture processing; topology", treatment = "T Theoretical or Mathematical", } @Article{Landskov:1984:MCE, author = "D. Landskov", title = "Microcode compaction; extending the boundaries", journal = j-INT-J-COMPUT-INF-SCI, volume = "13", number = "1", pages = "1--21", month = feb, year = "1984", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C5220 (Computer architecture); C6150C (Compilers, interpreters and other processors)", corpsource = "Dept. of Computer Sci., Univ. of Lowell, Lowell, MA, USA", keywords = "data compression; global compaction; microcode compaction; microprogramming; program processors; trace compaction technique", treatment = "P Practical", } @Article{Lee:1984:OTM, author = "D. T. Lee", title = "An optimal time and minimal space algorithm for rectangle intersection problems", journal = j-INT-J-COMPUT-INF-SCI, volume = "13", number = "1", pages = "23--32", month = feb, year = "1984", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68U05 (52-04)", MRnumber = "85j:68104", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C1180 (Optimisation techniques); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Electrical Engng. and Computer Sci., Northwestern Univ., Evanston, IL, USA", keywords = "computational geometry; data structures; divide-and-conquer technique; linked lists; minimal space algorithm; optimal time; optimisation; programming theory; range trees; rectangle intersection problems; rectangle trees; segment trees", treatment = "T Theoretical or Mathematical", } @Article{Lu:1984:ICF, author = "H. R. Lu and K. S. Fu", title = "Inferability of context-free programmed grammars", journal = j-INT-J-COMPUT-INF-SCI, volume = "13", number = "1", pages = "33--58", year = "1984", MRclass = "68T25", MRnumber = "85k:68093", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, } @Article{Lu:1984:ICP, author = "H. R. Lu and K. S. Fu", title = "Inferability of context-free programmed grammars", journal = j-INT-J-COMPUT-INF-SCI, volume = "13", number = "1", pages = "33--58", month = feb, year = "1984", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "School of Electrical Engng., Purdue Univ., West Lafayette, IN, USA", keywords = "autocorrelation; CFPG inferability; context-free grammars; context-free programmed grammars; control diagram; grammatical inference; pattern recognition; string language description; syntactic pattern analysis", treatment = "T Theoretical or Mathematical", } @Article{Yang:1984:AIG, author = "Chao Chih Yang and Hou Kuan Huang", title = "Algorithms for the inverse and a generalization of the state space approach to finite automata", journal = j-INT-J-COMPUT-INF-SCI, volume = "13", number = "1", pages = "59--76", month = feb, year = "1984", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68Q05", MRnumber = "86i:68034", MRreviewer = "F. G{\'e}cseg", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory)", corpsource = "Dept. of Computer and Information Sci., Univ. of Alabama, Birmingham, AL, USA", keywords = "contraction mapping; finite automata; inverse; modulo 2; power series; state space approach", treatment = "T Theoretical or Mathematical", } @Article{Ottmann:1984:BST, author = "Thomas Ottmann and Arnold L. Rosenberg and Hans-Werner Six and Derick Wood", title = "Binary search trees with binary comparison cost", journal = j-INT-J-COMPUT-INF-SCI, volume = "13", number = "2", pages = "77--101", month = apr, year = "1984", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68P05 (68P10)", MRnumber = "85j:68016", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C6120 (File organisation)", corpsource = "Inst. fur Angewande Inf. und Formalebeschreibungsverfahren, Univ. Karlsruhe, West Germany", keywords = "BCOST; binary comparison cost; binary search trees; cost measure; data structures; Fibonacci trees; information retrieval; maximal BCOST-height trees; mode visit cost; stratified trees; TCOST; trees (mathematics)", treatment = "T Theoretical or Mathematical", } @Article{Kak:1984:MPK, author = "S. C. Kak", title = "On the method of puzzles for key distribution", journal = j-INT-J-COMPUT-INF-SCI, volume = "13", number = "2", pages = "103--109", month = apr, year = "1984", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "B6120B (Codes); C6130 (Data handling techniques)", corpsource = "Dept. of Electr. and Comput. Eng., Louisiana State Univ., Baton Rouge, LA, USA", keywords = "codes; cryptography; key distribution; nested puzzles method; public channel; puzzles; work advantage", treatment = "P Practical", } @Article{Yu:1984:PMN, author = "Ging-Shung Yu and S. Muroga", title = "Parallel multipliers with {NOR} gates based on {G}-minimum adders", journal = j-INT-J-COMPUT-INF-SCI, volume = "13", number = "2", pages = "111--121", month = apr, year = "1984", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "B1265Z (Other digital circuits); C5120 (Logic and switching circuits)", corpsource = "Inst. of Nucl. Energy Res., Lung-tan, Taiwan", keywords = "adders; carry-save adder-type multipliers; G-minimum adders; logic gates; multiplying circuits; NOR gates; parallel multipliers", treatment = "P Practical", } @Article{Er:1984:IAC, author = "M. C. Er", title = "An iterative algorithm for the cyclic {Towers of Hanoi} problem", journal = j-INT-J-COMPUT-INF-SCI, volume = "13", number = "2", pages = "123--129", month = apr, year = "1984", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68Q20", MRnumber = "86c:68029", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Wollongong Univ., NSW, Australia", keywords = "algorithm theory; cyclic Towers of Hanoi problem; discs; iterative algorithm; source peg", treatment = "T Theoretical or Mathematical", } @Article{Santoro:1984:MCD, author = "Nicola Santoro", title = "On the message complexity of distributed problems", journal = j-INT-J-COMPUT-INF-SCI, volume = "13", number = "3", pages = "131--147", month = jun, year = "1984", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68M10", MRnumber = "86d:68005", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "B1110 (Network topology); B6110 (Information theory); C1260 (Information theory); C4290 (Other computer theory); C5620 (Computer networks and techniques)", corpsource = "Sch. of Comput. Sci., Carleton Univ., Ottawa, Ont., Canada", keywords = "asynchronous message passing systems; distributed algorithms; distributed computing; distributed processing; equivalence; extrema-finding; information theory; lower-bounds; message complexity; minimum-weight spanning-tree construction; network topology; reducibility; topological information; worst-case optimality", treatment = "T Theoretical or Mathematical", } @Article{Orman:1984:FMD, author = "L. Orman", title = "Familial model of data", journal = j-INT-J-COMPUT-INF-SCI, volume = "13", number = "3", pages = "149--175", month = jun, year = "1984", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4250 (Database theory)", corpsource = "Cornell Univ., Ithaca, NY, USA", keywords = "abstractions; algebra of families; conceptual model; data definition; database application systems; database constructs; database theory; derived data; directed binary association; diverse user views; familial data model; family of sets; indexing; maintenance; metamodels; procedural programming languages; processing language; specification language", treatment = "T Theoretical or Mathematical", } @Article{Fukuda:1984:ITA, author = "H. Fukuda and K. Kamata", title = "Inference of tree automata from sample sets of trees", journal = j-INT-J-COMPUT-INF-SCI, volume = "13", number = "3", pages = "177--196", month = jun, year = "1984", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68Q70", MRnumber = "86d:68054", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory)", corpsource = "Fujisawa Dev. Lab., IBM Japan Ltd., Japan", keywords = "automata theory; inference; k-follower; sample tree set; tree automata; trees (mathematics)", treatment = "T Theoretical or Mathematical", } @Article{Toussaint:1984:CCU, author = "Godfried T. Toussaint", title = "Complexity, convexity, and unimodality", journal = j-INT-J-COMPUT-INF-SCI, volume = "13", number = "3", pages = "197--217", month = jun, year = "1984", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68U05 (52-04 52A10 68T10)", MRnumber = "86d:68065", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4190 (Other numerical methods); C4240 (Programming and algorithm theory)", corpsource = "Sch. of Comput. Sci., McGill Univ., Montreal, Que., Canada", keywords = "algorithms; all furthest neighbor problem; all nearest neighbor problem; artificial intelligence; closer pair problem; computational complexity; computational geometry; convexity; diameter; distance function; Euclidean distance; fixed edge; fixed vertex; geometric complexity; linear-time-complexity; pattern recognition; polygons; unimodality", treatment = "T Theoretical or Mathematical", } @Article{Stark:1984:GPC, author = "W. Richard Stark", title = "A glimpse into the paradise of combinatory algebra", journal = j-INT-J-COMPUT-INF-SCI, volume = "13", number = "3", pages = "219--236", month = jun, year = "1984", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68Q55 (03B40 03B70 68Q70)", MRnumber = "86d:68048", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic); C6140 (Programming languages)", corpsource = "Dept. of Math., Univ. of South Florida, Tampa, FL, USA", keywords = "algebra; combinatorial mathematics; combinatory algebra; finite state automata; fixed point; FP; functional languages; history; KRC; lambda calculus; LISP; programming languages; recursion; semantics; syntax; terms", treatment = "G General Review; T Theoretical or Mathematical", } @Article{Kostovetsky:1984:FDT, author = "A. Kostovetsky", title = "Frequency decomposition technique for large archivable databases", journal = j-INT-J-COMPUT-INF-SCI, volume = "13", number = "4", pages = "237--249", month = aug, year = "1984", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6160Z (Other DBMS)", corpsource = "Computervision Corp., Bedford, MA, USA", keywords = "back up procedures; CAD/CAM; database management systems; database recoverability; file management system; frequency decomposition technique; frequency separation criterion; large archivable databases; prolonged archiving; transaction management", treatment = "P Practical", } @Article{Pargas:1984:PSR, author = "Roy P. Pargas", title = "Parallel solution of recurrences on a tree machine", journal = j-INT-J-COMPUT-INF-SCI, volume = "13", number = "4", pages = "251--277", month = aug, year = "1984", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "65W05 (65Q05)", MRnumber = "86f:65225", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C5440 (Multiprocessing systems)", corpsource = "Dept. of Comput. Sci., Clemson Univ., SC, USA", keywords = "complexity; computational complexity; parallel processing; parallel solutions; recurrences; tree machine; trees (mathematics)", treatment = "T Theoretical or Mathematical", } @Article{Atallah:1984:CSP, author = "Mikhail J. Atallah", title = "Checking similarity of planar figures", journal = j-INT-J-COMPUT-INF-SCI, volume = "13", number = "4", pages = "279--290", month = aug, year = "1984", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68U05 (68Q25)", MRnumber = "783 724", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C1250 (Pattern recognition); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Purdue Univ., West Lafayette, IN, USA", keywords = "circles; computational geometry; ellipses; pattern recognition; planar figures; straight line segments", treatment = "T Theoretical or Mathematical", } @Article{Kou:1984:CT, author = "Wei Dong Kou and Zheng Hu", title = "{CH} transform", journal = j-INT-J-COMPUT-INF-SCI, volume = "13", number = "4", pages = "291--307", month = aug, year = "1984", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "42A38 (44A35 94A15)", MRnumber = "86g:42014", MRreviewer = "B. D. Donevski", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "B0230 (Integral transforms); B6110 (Information theory); C1130 (Integral transforms); C1260 (Information theory)", corpsource = "Dept. of Inf. Eng., Northwest Telecommun. Eng. Inst., Xian, China", keywords = "CH transform; cyclic shift; fast Hadamard transform; information theory; invariant power spectrum; transforms; unitary transform", treatment = "T Theoretical or Mathematical", } @Article{Voukalis:1984:FRM, author = "D. C. Voukalis", title = "Further remarks for the matrix type-$ {B} $ codes", journal = j-INT-J-COMPUT-INF-SCI, volume = "13", number = "4", pages = "309--326", month = aug, year = "1984", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "94B20 (94A40)", MRnumber = "86k:94033", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "B6120B (Codes)", keywords = "communication channel; correcting error patterns; efficient code; encoding-decoding algorithm; error correction codes; error detection codes; matrix algebra; matrix type-B codes", treatment = "P Practical", } @Article{Schwind:1984:EDC, author = "Camilla B. Schwind", title = "Embedding deductive capabilities in relational database systems", journal = j-INT-J-COMPUT-INF-SCI, volume = "13", number = "5", pages = "327--338", month = oct, year = "1984", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68P15 (68T30)", MRnumber = "86h:68030", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4250 (Database theory); C6160D (Relational databases)", corpsource = "CNRS, Marseille, France", keywords = "data manipulation; database theory; deductive capabilities; deductive database system; expert systems; extensional database; Horn clauses; relational algebra; relational database systems; relational databases; theorem proving; tuples", treatment = "P Practical", } @Article{Srini:1984:MDM, author = "V. P. Srini and B. D. Shrivr", title = "A methodology for designing and modeling reconfigurable systems", journal = j-INT-J-COMPUT-INF-SCI, volume = "13", number = "5", pages = "339--394", month = oct, year = "1984", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory); C6110 (Systems analysis and programming); C6150J (Operating systems)", corpsource = "Dept. of Comput. Sci., Alabama Univ., Birmingham, AL, USA", keywords = "automata theory; communicating systems; concurrent system; data driven model; dynamically reconfigurable systems; global information; knowledge-based expert systems; local information; operating system; operating systems (computers); reconfigurable systems; systems analysis", treatment = "P Practical", } @Article{Chang:1984:CHC, author = "S. K. Chang and J. C. Dorng", title = "Concatenated hash code selection", journal = j-INT-J-COMPUT-INF-SCI, volume = "13", number = "5", pages = "395--412", month = oct, year = "1984", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68P10", MRnumber = "86d:68017", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation)", corpsource = "Dept. of Electr. and Comput. Eng., Illinois Inst. of Technol., Chicago, IL, USA", keywords = "concatenated hash code; file organisation; hash code selection; hashing scheme; multiple-attribute retrieval; optimal code length; partial match retrieval; storage allocation", treatment = "P Practical", } @Article{Tanatsugu:1984:GIH, author = "Keisuke Tanatsugu", title = "A grammatical inference for harmonic linear languages", journal = j-INT-J-COMPUT-INF-SCI, volume = "13", number = "5", pages = "413--423", month = oct, year = "1984", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68T05 (68S05)", MRnumber = "86d:68061", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Math., Kitakyushu Univ., Japan", keywords = "finite sample sets; formal languages; grammars; grammatical inference; harmonic linear languages; regular languages; superclass", treatment = "T Theoretical or Mathematical", } @Article{Niemi:1984:SDR, author = "T. Niemi", title = "Specification of data restructuring software based on the attribute method", journal = j-INT-J-COMPUT-INF-SCI, volume = "13", number = "6", pages = "425--460", month = dec, year = "1984", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation); C6160 (Database management systems (DBMS))", corpsource = "Dept. of Math. and Comp. Sci., Tampere Univ., Finland", keywords = "abstract software specification; abstract syntax; attribute method; data restructuring; data structures; database theory; flat file; formal specification; grammars; hierarchical data models; hierarchical databases; programming theory", treatment = "T Theoretical or Mathematical", } @Article{Dasgupta:1984:UHL, author = "Subrata Dasgupta and Alan Wagner", title = "The use of {Hoare} logic in the verification of horizontal microprograms", journal = j-INT-J-COMPUT-INF-SCI, volume = "13", number = "6", pages = "461--490", month = dec, year = "1984", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68Q60 (03B70)", MRnumber = "87a:68118", MRreviewer = "W. Damm", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Center for Adv. Comput. Studies, Southwestern Louisiana Univ., Lafayette, LA, USA", keywords = "axiomatic definition; firmware verification; formal languages; formal verification; Hoare logic; horizontal microprograms; inductive assertion method; machine dependent microprogramming language; microprogramming; Nanodata QM-1; program verification; S*(QM-1)", treatment = "T Theoretical or Mathematical", } @Article{Hurson:1984:VDP, author = "A. R. Hurson", title = "A {VLSI} design for the parallel finite state automaton and its performance evaluation as a hardware scanner", journal = j-INT-J-COMPUT-INF-SCI, volume = "13", number = "6", pages = "491--508", month = dec, year = "1984", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68Q35", MRnumber = "792 724", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory); C5220 (Computer architecture)", corpsource = "Sch. of Electr. Eng. and Comptu. Sci., Oklahoma Univ., Norman, OK, USA", keywords = "computer architecture; computerised pattern recognition; finite automata; hardware architecture; hardware scanner; parallel finite state automaton; pattern matching; performance evaluation; text retrieval; VLSI; VLSI design", treatment = "T Theoretical or Mathematical", } @Article{Chang:1984:SC, author = "Lena Chang and Arthur T. Poe", title = "Surjections and coverings", journal = j-INT-J-COMPUT-INF-SCI, volume = "13", number = "6", pages = "509--520", month = dec, year = "1984", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68R05 (68Q05)", MRnumber = "86m:68115", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory)", corpsource = "Chang and Co., MA, USA", keywords = "automata theory; bijections; coverings; deleted distributive property; feedback; necessary conditions; partitions; sequence covers; series-parallel; series-parallel decompositions; sufficient condition; surjection", treatment = "T Theoretical or Mathematical", } @Article{Roussopoulos:1985:SMS, author = "N. Roussopoulos and L. Mark", title = "Schema manipulation in self-describing and self-documenting data models", journal = j-INT-J-COMPUT-INF-SCI, volume = "14", number = "1", pages = "1--28", month = feb, year = "1985", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4250 (Database theory); C6160 (Database management systems (DBMS))", corpsource = "Dept. of Comput. Sci., Maryland Univ., College Park., MD, USA", keywords = "data language; database management systems; database theory; meta-schema; schema manipulation; self describing data models; self-documenting data models; uniform model", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Dutta:1985:MMC, author = "A. Dutta", title = "Modeling of multiple copy update costs for file allocation in distributed databases", journal = j-INT-J-COMPUT-INF-SCI, volume = "14", number = "1", pages = "29--34", month = feb, year = "1985", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation); C6160B (Distributed databases)", corpsource = "Graduate Sch. of Manage., Rochester Univ., NY, USA", keywords = "database management systems; distributed databases; file allocation; file organisation; modeling; multiple copy update costs; protocols; query; storage; update communication costs", treatment = "P Practical; T Theoretical or Mathematical", } @Article{H:1985:SMC, author = "H. J{\"u}rgensen and A. Salomaa", title = "Syntactic monoids in the construction of systolic tree automata", journal = j-INT-J-COMPUT-INF-SCI, volume = "14", number = "1", pages = "35--49", year = "1985", MRclass = "68Q80 (68Q45)", MRnumber = "87i:68056", MRreviewer = "J. Gruska", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, } @Article{Jurgensen:1985:SMC, author = "H. Jurgensen and A. Salomaa", title = "Syntactic monoids in the construction of systolic tree automata", journal = j-INT-J-COMPUT-INF-SCI, volume = "14", number = "1", pages = "35--49", month = feb, year = "1985", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4220 (Automata theory)", corpsource = "Dept. of Comput. Sci., Univ. of Western Ontario, London, Ont., Canada", keywords = "automata theory; formal languages; language families; monoid product; regular language; syntactic monoids; systolic tree automata; trees (mathematics)", treatment = "T Theoretical or Mathematical", } @Article{Biswas:1985:ASV, author = "P. Biswas", title = "Architectural support for variable addressing in {Ada} --- a design approach", journal = j-INT-J-COMPUT-INF-SCI, volume = "14", number = "1", pages = "51--72", month = feb, year = "1985", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6140D (High level languages)", corpsource = "Dept. of Comput. Sci. and Eng., Southern Methodist Univ., Dallas, TX, USA", keywords = "Ada; architectural support; architecture description language; design approach; Dijkstra's mechanism; language-directed machine architecture; machine instructions; variable addressing", treatment = "P Practical", } @Article{Huang:1985:MEH, author = "S.-H. S. Huang", title = "Multidimensional extendible hashing for partial-match queries", journal = j-INT-J-COMPUT-INF-SCI, volume = "14", number = "2", pages = "73--82", month = apr, year = "1985", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation)", corpsource = "Dept. of Comput. Sci., Houston Univ., TX, USA", keywords = "buckets; data structures; direct access files; extendible hashing; file organisation; multi-attribute keys; multidimensional hashing; one-dimensional hashing; partial-match queries; storage utilization; tree files", treatment = "P Practical", } @Article{Hooper:1985:BSL, author = "J. W. Hooper", title = "{BPL}: a set-based language for distributed system prototyping", journal = j-INT-J-COMPUT-INF-SCI, volume = "14", number = "2", pages = "83--105", month = apr, year = "1985", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6140D (High level languages)", corpsource = "Dept. of Comput. Sci., Alabama Univ., Huntsville, AL, USA", keywords = "ADL/ADS; attributes; behavior objects; Behavior Prototyping Language; BPL; distributed data processing; distributed processing; distributed system prototyping; prototyping tools; relationships; set theory; set-based language; set-theoretical approaches; specification languages; syntax; system development; user interface tool; VAX 11/780", treatment = "P Practical", } @Article{Motteler:1985:CMD, author = "Howard E. Motteler and Carl H. Smith", title = "A complexity measure for data flow models", journal = j-INT-J-COMPUT-INF-SCI, volume = "14", number = "2", pages = "107--122", month = apr, year = "1985", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68Q15", MRnumber = "87a:68066", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6150C (Compilers, interpreters and other processors)", corpsource = "Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA", keywords = "abstract complexity theory; Blum complexity measure; compilers; complexity measure; computational complexity; copy measure; data flow models; program compilers; tokens", treatment = "T Theoretical or Mathematical", } @Article{Tou:1985:KER, author = "J. T. Tou", title = "Knowledge engineering revisited", journal = j-INT-J-COMPUT-INF-SCI, volume = "14", number = "3", pages = "123--134", month = jun, year = "1985", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C1230 (Artificial intelligence); C6170 (Expert systems)", corpsource = "Center for Inf. Res., Florida Univ., Gainesville, FL, USA", keywords = "expert systems; knowledge application; knowledge dissemination; knowledge engineering; knowledge preservation; knowledge proliferation; pattern-directed expert systems", treatment = "P Practical", } @Article{Dandamudi:1985:EPC, author = "S. P. Dandamudi and P. G. Sorenson", title = "An empirical performance comparison of some variations of the $k$-$d$ tree and {BD} tree", journal = j-INT-J-COMPUT-INF-SCI, volume = "14", number = "3", pages = "135--159", month = jun, year = "1985", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6160 (Database management systems (DBMS))", corpsource = "Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA", keywords = "B D tree; database applications; database management systems; dynamic characteristics; empirical performance; k-d tree; multidimensional data; multidimensional systems; multiple keys; one-dimensional binary search tree; one-dimensional data; performance evaluation; storage structures", treatment = "P Practical", } @Article{deMaine:1985:TPL, author = "P. A. D. {de Maine} and S. Leong and C. G. Davis", title = "A transportable programming language ({TPL}) system. {I} Overview", journal = j-INT-J-COMPUT-INF-SCI, volume = "14", number = "3", pages = "161--182", month = jun, year = "1985", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6100 (Software techniques and systems); C6140B (Machine-oriented languages); C6140D (High level languages)", corpsource = "Dept. of Comp. Sci. and Eng., Auburn Univ., AL, USA", keywords = "bifunctional FORTRAN-TPL compiler; FORTRAN; FORTRAN-TPL system; hardware; high level languages; High-Level Languages; HLL; HLL-TPL; HPFORTRAN; HPHLL; Hypothetical Parent; intermediate language; program compilers; software; software portability; Superset method; TPL; transportable programming language", treatment = "P Practical", } @Article{ORourke:1985:FME, author = "Joseph O'Rourke", title = "Finding minimal enclosing boxes", journal = j-INT-J-COMPUT-INF-SCI, volume = "14", number = "3", pages = "183--199", month = jun, year = "1985", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68U05", MRnumber = "824 371", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4190 (Other numerical methods)", corpsource = "Dept. of Elec. Eng. and Comp. Sci., Johns Hopkins Univ., Baltimore, MD, USA", keywords = "computational geometry; convex hull; minimal enclosing boxes; minimal volume boxes; naive search; three-dimensional points", treatment = "P Practical", } @Article{Mlodinow:1985:EPM, author = "L. D. Mlodinow and I. O. Stamatescu", title = "An evolutionary procedure for machine learning", journal = j-INT-J-COMPUT-INF-SCI, volume = "14", number = "4", pages = "201--219", month = aug, year = "1985", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C1230 (Artificial intelligence); C1240 (Adaptive system theory); C3390 (Robotics)", corpsource = "Max-Planck-Inst. fur Phys. und Astrophys., Munich, West Germany", keywords = "artificial intelligence; evolutionary procedure; learning systems; machine learning; position control; robots; TURTLE", treatment = "P Practical", } @Article{Chan:1985:NMP, author = "B. Chan and H. Meijer", title = "A note on the method of puzzles for key distribution", journal = j-INT-J-COMPUT-INF-SCI, volume = "14", number = "4", pages = "221--223", month = aug, year = "1985", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "B6120B (Codes); C1260 (Information theory)", corpsource = "Dept. of Comput. and Inf. Sci., Queens Univ., Kingston, Ont., Canada", keywords = "cryptography; error correction codes; key distribution; linear error correcting codes; public key cryptosystem; puzzles; security of data", treatment = "T Theoretical or Mathematical", } @Article{Chen:1985:GSG, author = "Jin Hua Chen", title = "{LL(1)} grammars and sub-{LL(1)} grammars", journal = j-INT-J-COMPUT-INF-SCI, volume = "14", number = "4", pages = "225--234", year = "1985", MRclass = "68Q50", MRnumber = "87e:68067", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, } @Article{Chen:1985:LGS, author = "Jinhua Chen", title = "{LL(1)} grammar and {Sub-LL(1)} grammars", journal = j-INT-J-COMPUT-INF-SCI, volume = "14", number = "4", pages = "225--234", month = aug, year = "1985", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C6150C (Compilers, interpreters and other processors)", corpsource = "Shenzhen Univ., China", keywords = "compilers; context free languages; context-free grammars; LL(1) grammar; program compilers; Sub-LL(1) grammars; top-down parsing", treatment = "T Theoretical or Mathematical", } @Article{Subramanian:1985:NRA, author = "K. G. Subramanian", title = "A note on regular-controlled apical-growth filamentous systems", journal = j-INT-J-COMPUT-INF-SCI, volume = "14", number = "4", pages = "235--242", month = aug, year = "1985", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Inst. Nat. de Recherche en Inf. et Autom., Rocquencourt, France", keywords = "apical-growth filamentous systems; context free languages; formal languages; L languages; linear languages; pure languages; regular control; regular languages", treatment = "T Theoretical or Mathematical", } @Article{Subramanian:1985:NRC, author = "K. G. Subramanian", title = "A note on regular-controlled apical-growth filamentous systems", journal = j-INT-J-COMPUT-INF-SCI, volume = "14", number = "4", pages = "235--242", year = "1985", MRclass = "68Q45", MRnumber = "87h:68101", MRreviewer = "Gheorghe P{\u{a}}un", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, } @Article{Ishida:1985:ASD, author = "Y. Ishida and N. Adachi and H. Tokumaru", title = "An analysis of self-diagnosis model by conditional fault set", journal = j-INT-J-COMPUT-INF-SCI, volume = "14", number = "5", pages = "243--259", year = "1985", MRclass = "68M15", MRnumber = "849 019", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, } @Article{Ishida:1985:ASM, author = "Y. Ishida and N. Adachi and H. Tokumaru", title = "An analysis of self-diagnosis model by conditional fault set", journal = j-INT-J-COMPUT-INF-SCI, volume = "14", number = "5", pages = "243--259", month = oct, year = "1985", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "B0170N (Reliability); C1210B (Reliability theory)", keywords = "automatic testing; conditional fault set; diagnosability; error-correcting codes; failure analysis; fault location; fault-free; faulty units; Hamming distance; mathematical programming; self-diagnosis model; syndrome decoding algorithm", treatment = "T Theoretical or Mathematical", } @Article{Hurson:1985:CSM, author = "A. R. Hurson and B. Shirazi", title = "A class of systolic multiplier units for {VLSI} technology", journal = j-INT-J-COMPUT-INF-SCI, volume = "14", number = "5", pages = "261--275", month = oct, year = "1985", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "B1265B (Logic circuits); B2570 (Semiconductor integrated circuits); C5220 (Computer architecture)", corpsource = "Dept. of Electr. Eng., Pennsylvania State Univ., University Park, PA, USA", keywords = "cellular arrays; pipeline architecture; pipeline processing; recursive structure; systolic multiplier units; VLSI; VLSI technology", treatment = "A Application; T Theoretical or Mathematical", } @Article{Agrawal:1985:TFS, author = "V. K. Agrawal and L. M. Patnaik and P. S. Goel", title = "Towards formal specification of a distributed computing system", journal = j-INT-J-COMPUT-INF-SCI, volume = "14", number = "5", pages = "277--306", month = oct, year = "1985", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68Q10", MRnumber = "849 020", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6110 (Systems analysis and programming); C7460 (Aerospace engineering computing)", corpsource = "Div. of Control Syst., ISRO Satellite Centre, Bangalore, India", keywords = "6-tuple model; aerospace computing; concurrency; deadlock; distributed computing system; distributed processing; exclusiveness; formal specification; functionally distributed system; onboard spacecraft computing system; reliable protocol; sequencing; systems analysis", treatment = "A Application", } @Article{Elmagarmid:1985:PDD, author = "A. K. Elmagarmid and A. P. Sheth", title = "A partially distributed deadlock detection algorithm", journal = j-INT-J-COMPUT-INF-SCI, volume = "14", number = "5", pages = "307--330", month = oct, year = "1985", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6150J (Operating systems); C6160B (Distributed databases)", corpsource = "Dept. of Electr. Eng., Pennsylvania State Univ., University Park, PA, USA", keywords = "central controller; congestion; database management systems; distributed database systems; distributed processing; local deadlocks; multisite deadlocks; operating systems (computers); partially distributed deadlock detection algorithm", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Young:1985:MCP, author = "Ming Huei Young and Saburo Muroga", title = "Minimal covering problem and {PLA} minimization", journal = j-INT-J-COMPUT-INF-SCI, volume = "14", number = "6", pages = "337--364", month = dec, year = "1985", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "90C09 (90C10)", MRnumber = "88k:90126", MRreviewer = "Anthony Vannelli", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "B1130B (Computer-aided circuit analysis and design); C4230 (Switching theory); C5210B (Computer-aided logic design)", corpsource = "Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA", keywords = "cellular arrays; heuristic algorithm; IBM FORTRAN programs; implicit enumeration method; integrated logic circuits; large-scale problems; logic CAD; logic minimisation; minimal covering problem; minimisation of switching nets; PLA minimization; programmable logic arrays; Quine-McCluskey method", treatment = "T Theoretical or Mathematical", } @Article{Brzakovic:1985:ACD, author = "D. Brzakovic and J. T. Tou", title = "An approach to computer-aided document examination", journal = j-INT-J-COMPUT-INF-SCI, volume = "14", number = "6", pages = "365--385", month = dec, year = "1985", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C6130 (Data handling techniques); C7106 (Word processing); C7890 (Other special applications)", corpsource = "Dept. of Electr. Eng., Tennessee Univ., Knoxville, TN, USA", keywords = "alignment analysis; computer-aided document examination; computerised pattern recognition; document authenticity; document falsification; expert systems; gray level intensity analysis; knowledge-based expert system; multiple typing sessions; symbol comparison; type font identification; typewritten document; word processing", treatment = "P Practical", } @Article{Brzozowski:1985:S, author = "J. A. Brzozowski and S. Muro", title = "On serializability", journal = j-INT-J-COMPUT-INF-SCI, volume = "14", number = "6", pages = "387--403", month = dec, year = "1985", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4250 (Database theory); C6160 (Database management systems (DBMS))", corpsource = "Dept. of Comput. Sci., Waterloo Univ., Ont., Canada", keywords = "concurrent execution of transactions; database management systems; database theory; database transactions; multiversion database model; serial schedule; serializability; transaction models", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Harnett:1985:OTR, author = "R. M. Harnett and G. C. Kiel", title = "Optimal taxiway repair: a set-covering approach", journal = j-INT-J-COMPUT-INF-SCI, volume = "14", number = "6", pages = "405--419", month = dec, year = "1985", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C1180 (Optimisation techniques); C1290Z (Other applications of systems theory); C4240 (Programming and algorithm theory); C7440 (Civil and mechanical engineering)", corpsource = "Louisiana Tech Univ., Ruston, LA, USA", keywords = "air base recovery after attack; airports; algebraic representation; computational efficiency; maintenance engineering; minimal cut set; optimisation; repair minimization; set theory; set-covering; taxiway intersections; taxiway repair", treatment = "T Theoretical or Mathematical", } @Article{Hong:1985:AEM, author = "Jia Rong Hong", title = "{AE1}: an extension matrix approximate method for the general covering problem", journal = j-INT-J-COMPUT-INF-SCI, volume = "14", number = "6", pages = "421--437", month = dec, year = "1985", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68Q25 (90C10)", MRnumber = "88a:68052", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C1110 (Algebra); C1160 (Combinatorial mathematics); C1180 (Optimisation techniques); C4140 (Linear algebra); C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA", keywords = "decidability; disjoint extension matrices; extension matrix approximate; general covering problem; matrix algebra; NP-hard; optimal covering algorithm; optimisation; optimization; set covering; set theory", treatment = "T Theoretical or Mathematical", } @Article{Chang:1985:TCG, author = "S. K. Chang and B. Luo and C. C. Yang and M. C. K. Yang", title = "Trace confirmation with given object position", journal = j-INT-J-COMPUT-INF-SCI, volume = "14", number = "6", pages = "439--453", month = dec, year = "1985", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "B0230 (Integral transforms); B6140C (Optical information and image processing); C1130 (Integral transforms); C1250 (Pattern recognition); C1260 (Information theory); C7410F (Communications)", corpsource = "Dept. of Electr. and Comput. Eng., Illinois Inst. of Technol., Chicago, IL, USA", keywords = "computerised pattern recognition; computerised picture processing; digitized image; Hough transform; line detection; SEASAT satellite pictures; ship detection; trace detection; tracking; transforms", treatment = "T Theoretical or Mathematical", } @Article{Tseng:1985:PSS, author = "S. S. Tseng and R. C. T. Lee", title = "A parallel sorting scheme whose basic operation sorts {$N$} elements", journal = j-INT-J-COMPUT-INF-SCI, volume = "14", number = "6", pages = "455--467", month = dec, year = "1985", CODEN = "IJCIAH", ISSN = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/intjcomputinfsci.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6130 (Data handling techniques)", corpsource = "Inst. of Comput. Eng., Nat. Chiao Tung Univ., Hsinchu, Taiwan", keywords = "algorithm theory; n-sorter merge sorting algorithm; parallel programming; parallel sorting scheme; sorting", treatment = "T Theoretical or Mathematical", }