%A B.K. Gairola
%A V. Rajaraman
%T A distributed index sequential access method
%J Information Processing Letters
%K ipl
%V 5
%N 1
%D May 1976
%P 1-5
%K ISAM MISAM

%A Glenn Manacher
%T An application of pattern matching to a problem in geometrical complexity
%J Information Processing Letters
%K ipl
%V 5
%N 1
%D May 1976
%P 6-7

%A Eshrat Arjomandi
%T On finding all unilaterally connected components of a digraph
%J Information Processing Letters
%K ipl
%V 5
%N 1
%D May 1976
%P 8-10

%A H.A. Maurer
%A Th. Ottman
%A H.-W. Six
%T Implementing dictionaries using binary trees of very small height
%J Information Processing Letters
%K ipl
%V 5
%N 1
%D May 1976
%P 11-14

%A Laurent Hyafil
%A Ronald L. Rivest
%T Constructing optimal binary decision trees is NP-complete
%J Information Processing Letters
%K ipl
%V 5
%N 1
%D May 1976
%P 15-17

%A Amnon B. Barak
%T On the parallel evaluation of division-free arithmetic expressions
with fan-in of three
%J Information Processing Letters
%K ipl
%V 5
%N 1
%D May 1976
%P 18-19

%A Leslie G. Valiant
%T Relative complexity of checking and evaluating
%J Information Processing Letters
%K ipl
%V 5
%N 1
%D May 1976
%P 20-23

%A Patrick Shen-Pei Wang
%T Recursiveness of monotonic array grammars and a hierarchy of array languages
%J Information Processing Letters
%K ipl
%V 5
%N 1
%D May 1976
%P 24-26

%A G. Marsaglia
%A K. Anathanarayanan
%A N.J. Paul
%T Improvements on fast methods for generating normal random variables
%J Information Processing Letters
%K ipl
%V 5
%N 2
%D June 1976
%P 27-30

%A Masataka Sassa
%A Eiichi Goto
%T A hashing method for fast set operations
%J Information Processing Letters
%K ipl
%V 5
%N 2
%D June 1976
%P 31-34

%A Carlos J. Lucena
%A Donald D. Cowan
%T Toward a system's environment for computer assisted programming
%J Information Processing Letters
%K ipl
%V 5
%N 2
%D June 1976
%P 35-40

%A Niel K. Madsen
%A Garry H. Rodrigue
%A Jack L. Karush
%T Matrix multiplication by diagonals on a vector/parallel processor
%J Information Processing Letters
%K ipl
%V 5
%N 2
%D June 1976
%P 41-45

%A Robert L. Probert
%T Commutativity, non-commutativity, and bilinearity
%J Information Processing Letters
%K ipl
%V 5
%N 2
%D June 1976
%P 46-49

%A Pierre Hansen
%T A cascade algorithm for the local closure of a set of binary relations
%J Information Processing Letters
%K ipl
%V 5
%N 2
%D June 1976
%P 50-54

%A Sukhamay Kundu
%T A linear algorithm for the Hamiltonian completion number of a tree
%J Information Processing Letters
%K ipl
%V 5
%N 2
%D June 1976
%P 55-57

%A D. Mandrioli
%T N-reconstructability of context-free grammars
%J Information Processing Letters
%K ipl
%V 5
%N 2
%D June 1976
%P 58-62

%A G. Yuval
%T Finding nearest neighbours
%J Information Processing Letters
%K ipl
%V 5
%N 3
%D August 1976
%P 63-65

%A E.L. Lawler
%T A note on the complexity of the chromatic number problem
%J Information Processing Letters
%K ipl
%V 5
%N 3
%D August 1976
%P 66-67

%A F. Luccio
%A F.P. Preparata
%T Storage for consecutive retrieval
%J Information Processing Letters
%K ipl
%V 5
%N 3
%D August 1976
%P 68-71

%A Nicola Santoro
%T Full table search by polynomial functions
%J Information Processing Letters
%K ipl
%V 5
%N 3
%D August 1976
%P 72-74

%A Derok A. Zave
%T A series expansion involving the harmonic numbers
%J Information Processing Letters
%K ipl
%V 5
%N 3
%D August 1976
%P 75-77

%A E.L. Lozinskii
%T On a problem in storage optimization
%J Information Processing Letters
%K ipl
%V 5
%N 3
%D August 1976
%P 78-80

%A R.K. Shyamasundar
%T A note on linear precedence functions
%J Information Processing Letters
%K ipl
%V 5
%N 3
%D August 1976
%P 81

%A Jon Louis Bentley
%A Andrew Chi-Chih Yao
%T An almost optimal algorithm for unbounded searching
%J Information Processing Letters
%K ipl
%V 5
%N 3
%D August 1976
%P 82-87

%A Kishor Shridharbhai Trivedi
%T On a semaphore anomaly
%J Information Processing Letters
%K ipl
%V 5
%N 3
%D August 1976
%P 88-89

%A Donald R. Innes
%A Shalom Tsur
%T Interval analysis, pagination and program locality
%J Information Processing Letters
%K ipl
%V 5
%N 4
%D October 1976
%P 91-96

%A Lambert Stevens
%T A space-saving technique for assigning Algol 68 multiple values
%J Information Processing Letters
%K ipl
%V 5
%N 4
%D October 1976
%P 97-99

%A C.T. Yu
%A D.T. Johnson
%T On the complexity of finding the set of candidate keys
for a given set of functional dependencies
%J Information Processing Letters
%K ipl
%V 5
%N 4
%D October 1976
%P 100-101

%A G. Rozenberg
%T More on ET0L systems versus random context grammars
%J Information Processing Letters
%K ipl
%V 5
%N 4
%D October 1976
%P 102-106

%A Behrokh Samadi
%T B-trees in a system with multiple users
%J Information Processing Letters
%K ipl
%V 5
%N 4
%D October 1976
%P 107-112

%A Harold N. Gabow
%T Some improved bounds on the number of 1-factors of n-connected graphs
%J Information Processing Letters
%K ipl
%V 5
%N 4
%D October 1976
%P 113-115

%A Gregor V. Bochmann
%T Comments on monitor definition and implementation
%J Information Processing Letters
%K ipl
%V 5
%N 4
%D October 1976
%P 116-117

%A M. Boari
%A A. Natali
%T Some properties of deadlock detection and recovery
in readers and writers problems
%J Information Processing Letters
%K ipl
%V 5
%N 4
%D October 1976
%P 118-123

%A K. Delcour
%A A.J.W. Duijvestein
%T Enclosures: an access control mechanism
with applications in parallel programming and other areas of system programming
%J Information Processing Letters
%K ipl
%V 5
%N 5
%D November 1976
%P 125-135

%A M.A. Hennell
%A M.R. Woodward
%A D. Hedley
%T On program analysis
%J Information Processing Letters
%K ipl
%V 5
%N 5
%D November 1976
%P 136-140

%A Giovanni Guida
%A Marco Somalvico
%T Semantics in problem representation and search
%J Information Processing Letters
%K ipl
%V 5
%N 5
%D November 1976
%P 141-145

%A Jon Doyle
%A Ronald L. Rivest
%T Linear expected time of a simple union-find algorithm
%J Information Processing Letters
%K ipl
%V 5
%N 5
%D November 1976
%P 146-148

%A M. Linna
%T The D0L-ness of context-free languages is decidable
%J Information Processing Letters
%K ipl
%V 5
%N 5
%D November 1976
%P 149-151

%A J. Diske
%A R. Parchmann
%A H. Schumacher
%T A pattern representation of indexed languages
%J Information Processing Letters
%K ipl
%V 5
%N 5
%D November 1976
%P 152-154

%A Daniel P. Friedman
%A David S. Wise
%T Output driven implementation of recursive programs,
or writing creates and destroys data structures
%J Information Processing Letters
%K ipl
%V 5
%N 6
%D December 1976
%P 155-160
%K lazy evaluation, demand-driven computation, reference counting

%A Daniel P. Friedman
%A David S. Wise
%T Garbage collecting a heap which includes a scatter table
%J Information Processing Letters
%K ipl
%V 5
%N 6
%D December 1976
%P 161-164
%K hash tables

%A Harold N. Gabow
%T A note on degree-constrained star subgraphs of bipartite graphs
%J Information Processing Letters
%K ipl
%V 5
%N 6
%D December 1976
%P 165-167

%A Kurt Mehlhorn
%T Bracket-languages are recognizable in logarithmic space
%J Information Processing Letters
%K ipl
%V 5
%N 6
%D December 1976
%P 168-170

%A Richard Kaye
%T A Gray code for set partitions
%J Information Processing Letters
%K ipl
%V 5
%N 6
%D December 1976
%P 171-173

%A Helmut Partsch
%A Peter Pepper
%T A family of rules for recusion removal
%J Information Processing Letters
%K ipl
%V 5
%N 6
%D December 1976
%P 174-177

%A Donald E. Knuth
%T A generalization of Dijkstra's algorithm
%J Information Processing Letters
%K ipl
%V 6
%N 1
%D February 1977
%P 1-5

%A G. Yuval
%T Theil's estimator
%J Information Processing Letters
%K ipl
%V 6
%N 1
%D February 1977
%P 6-7

%A Eiichi Goto
%A Tetsuo Ida
%A Takao Gunji
%T Parallel hashing algorithms
%J Information Processing Letters
%K ipl
%V 6
%N 1
%D February 1977
%P 8-13

%A Narsingh Deo
%A M.S. Krishnamoorthy
%A Ajit B. Pai
%T Generalizations of line graphs and applications
%J Information Processing Letters
%K ipl
%V 6
%N 1
%D February 1977
%P 14-17

%A Francis Chin
%A Kenneth Steiglitz
%T A fast error evaluation algorithm for polynomial approximation
%J Information Processing Letters
%K ipl
%V 6
%N 1
%D February 1977
%P 18-21

%A S.S. Reddi
%T Alternative solutions to the cigarette smokers' problem without conditionals
%J Information Processing Letters
%K ipl
%V 6
%N 1
%D February 1977
%P 22-24

%A Andrzej Rowicki
%T A note on optimal preemptive scheduling for two-processor systems
%J Information Processing Letters
%K ipl
%V 6
%N 1
%D February 1977
%P 25-28

%A T.H. Merrett
%T Relations as programming language elements
%J Information Processing Letters
%K ipl
%V 6
%N 1
%D February 1977
%P 29-33

%A C.P. Schnorr
%A H. Klupp
%T A universally hard set of formulae
with respect to non-deterministic Turing acceptors
%J Information Processing Letters
%K ipl
%V 6
%N 2
%D April 1977
%P 35-37

%A A.P. Ershow
%T On the partial computation principle
%J Information Processing Letters
%K ipl
%V 6
%N 2
%D April 1977
%P 38-41

%A R. Zuczek
%T The universal space for parallel computation
%J Information Processing Letters
%K ipl
%V 6
%N 2
%D April 1977
%P 42-45

%A Arno Endres
%A Hans-Georg Stork
%T FIFO-optimal placement on pages of independently referenced sectors
%J Information Processing Letters
%K ipl
%V 6
%N 2
%D April 1977
%P 46-49

%A Masataka Sassa
%A Eiichi Goto
%T "V-tape", a virtual memory oriented data type, and its resource requirements
%J Information Processing Letters
%K ipl
%V 6
%N 2
%D April 1977
%P 50-55

%A J.P. Bramante
%T Producing optimised code for coercions
%J Information Processing Letters
%K ipl
%V 6
%N 2
%D April 1977
%P 56-59

%A M.H. Williams
%T Complete operatior precedence conditions
%J Information Processing Letters
%K ipl
%V 6
%N 2
%D April 1977
%P 60-62

%A V. Rajaraman
%A Om Vikas
%T A first-in-^first-out buffered cyclic memory
%J Information Processing Letters
%K ipl
%V 6
%N 2
%D April 1977
%P 63-68

%A Teruo Hikita
%A Eiichi Goto
%T An O(N) algorithm for finding periodicity of a sequence using hash coding
%J Information Processing Letters
%K ipl
%V 6
%N 2
%D April 1977
%P 69-71

%A E.A. Dinic
%A A.K. Kelmans
%A M.A. Zaitsev
%T Nonisomorphic trees with the same T-polynomial
%J Information Processing Letters
%K ipl
%V 6
%N 3
%D June 1977
%P 73-76

%A Josef Kittler
%T A method for determining class subspaces
%J Information Processing Letters
%K ipl
%V 6
%N 3
%D June 1977
%P 77-79

%A P. van\ Emde\ Boas
%T Preserving order in a forest in less than logarithmic time and linear space
%J Information Processing Letters
%K ipl
%V 6
%N 3
%D June 1977
%P 80-82

%A A. Javor
%T An adaptive time advancement algorithm for discrete simulation
%J Information Processing Letters
%K ipl
%V 6
%N 3
%D June 1977
%P 83-86

%A Harald Wurges
%T Comments on 'Error resynchronisation in producer consumer systems'
%J Information Processing Letters
%K ipl
%V 6
%N 3
%D June 1977
%P 87-90

%A W. Lipski,\ Jr.
%T One more polynomial complete consecutive retrieval problem
%J Information Processing Letters
%K ipl
%V 6
%N 3
%D June 1977
%P 91-93

%A Sukhamay Kundu
%T Sorting tree, nestling tree and inverse permutation
%J Information Processing Letters
%K ipl
%V 6
%N 3
%D June 1977
%P 94-96

%A Kari-Jouko Raiha
%A Mikko Saarinen
%T An optimization of the alternating semantic evaluator
%J Information Processing Letters
%K ipl
%V 6
%N 3
%D June 1977
%P 97-100

%A Jacques Cohen
%A Joal Katcoff
%T Automatic solution of a certain class of combinatorial problems
%J Information Processing Letters
%K ipl
%V 6
%N 4
%D August 1977
%P 101-104

%A Jozef Winkowski
%T An algebraic characterization of the behavior of non-sequential systems
%J Information Processing Letters
%K ipl
%V 6
%N 4
%D August 1977
%P 105-109

%A Neil D. Jones
%T A note on linar time simulation of deterministic two-way pushdown automata
%J Information Processing Letters
%K ipl
%V 6
%N 4
%D August 1977
%P 110-112

%A D.A. Turner
%T Error diagnosis and recovery in one pass compilers
%J Information Processing Letters
%K ipl
%V 6
%N 4
%D August 1977
%P 113-115

%A S.H. Talbert
%T One the formal specification of the semantics of processed information
%J Information Processing Letters
%K ipl
%V 6
%N 4
%D August 1977
%P 116-119

%A Youichi Kobuchi
%T Two characterization theorems of locally catenative developmental systems
%J Information Processing Letters
%K ipl
%V 6
%N 4
%D August 1977
%P 120-124

%A A. Brandwajn
%A B. Mouneix
%T A study of a page-on-demand system
%J Information Processing Letters
%K ipl
%V 6
%N 4
%D August 1977
%P 125-132

%A Vijay V. Raghavan
%A C.T. Yu
%T A note on a multidimensional searching problem
%J Information Processing Letters
%K ipl
%V 6
%N 4
%D August 1977
%P 133-135

%A Gaston H. Gonnet
%T The interpolation-sequential search algorithm
%J Information Processing Letters
%K ipl
%V 6
%N 4
%D August 1977
%P 136-139

%A Mary Shaw
%A J.F. Traub
%T Selection of good algorithms from a family of algorithms
for polynomial derivative evaluation
%J Information Processing Letters
%K ipl
%V 6
%N 5
%D October 1977
%P 141-145

%A Leon Lukasziewicz
%T Functional grammars
%J Information Processing Letters
%K ipl
%V 6
%N 5
%D October 1977
%P 146-150

%A George E. Collins
%A David R. Musser
%T Analysis of the Pope-Stein division algorithm
%J Information Processing Letters
%K ipl
%V 6
%N 5
%D October 1977
%P 151-155

%A John Grant
%T Null values in a relational data base
%J Information Processing Letters
%K ipl
%V 6
%N 5
%D October 1977
%P 156-157

%A T.D. Bui
%T On an L-stable method for stiff differential equations
%J Information Processing Letters
%K ipl
%V 6
%N 5
%D October 1977
%P 158-161

%A Jacek Blazewicz
%T Simple algorithms for multiprocessor scheduling to meet deadlines
%J Information Processing Letters
%K ipl
%V 6
%N 5
%D October 1977
%P 162-164

%A S. Matwin
%T On the completeness of a set of transformations optimizing linear program
%J Information Processing Letters
%K ipl
%V 6
%N 5
%D October 1977
%P 165-167

%A R.S. Bird
%T Two dimensional pattern matching
%J Information Processing Letters
%K ipl
%V 6
%N 5
%D October 1977
%P 168-170

%A L. Cahit
%T Realization of graceful permutation by a shuffle-exchange network
%J Information Processing Letters
%K ipl
%V 6
%N 5
%D October 1977
%P 171-173

%A Philip W. Grant
%T Recognition of EOL languages in less than quartic time
%J Information Processing Letters
%K ipl
%V 6
%N 5
%D October 1977
%P 174-175

%A S. Matwin
%T An experimental investigation of Geschke's method
of global program optimization
%J Information Processing Letters
%K ipl
%V 6
%N 6
%D December 1977
%P 177-179

%A James M. Steckelberg
%A Sharad C. Seth
%T On a relation between algebraic programs and Turing machines
%J Information Processing Letters
%K ipl
%V 6
%N 6
%D December 1977
%P 180-183

%A Stanbley M. Selkow
%T The tree-to-tree editing problem
%J Information Processing Letters
%K ipl
%V 6
%N 6
%D December 1977
%P 184-186

%A Johs Madsen
%T An experiment in formal definition of operating system facilities
%J Information Processing Letters
%K ipl
%V 6
%N 6
%D December 1977
%P 187-189

%A J. Albert
%A H.A. Maurer
%T The class of context-free languages is not an EOL family
%J Information Processing Letters
%K ipl
%V 6
%N 6
%D December 1977
%P 190-195

%A Nissim Francez
%T A case for a forward predicate trensformer
%J Information Processing Letters
%K ipl
%V 6
%N 6
%D December 1977
%P 196-198

%A Fanica Gavril
%T Testing for equality between maximum matching and minimum node covering
%J Information Processing Letters
%K ipl
%V 6
%N 6
%D December 1977
%P 199-202

%A I.S. Hirschberg
%A J.C.A. Boekhorst
%T Concurrent file access under unpredictability
%J Information Processing Letters
%K ipl
%V 6
%N 6
%D December 1977
%P 203-208

%A Jon L. Bentley
%A Donald F. Stanat
%A E. Hollins Williams,\ Jr.
%T The complexity of finding fixed-radius near neighbors
%J Information Processing Letters
%K ipl
%V 6
%N 6
%D December 1977
%P 209-212

%A I.H. Sudborough
%T A note on weak operator precedence grammars
%J Information Processing Letters
%K ipl
%V 6
%N 6
%D December 1977
%P 213-218

%A Yehoshua Pearl
%A Edward M. Reingold
%T Understanding the complexity of interpolation search
%J Information Processing Letters
%K ipl
%V 6
%N 6
%D December 1977
%P 219-222

%A Lyle Ramshaw
%T Binomial coefficients with non-integral lower index
%J Information Processing Letters
%K ipl
%V 6
%N 6
%D December 1977
%P 223-226

%A Wlodzimierz Dobosiewicz
%T Sorting by distributive partitioning
%J Information Processing Letters
%K ipl
%V 7
%N 1
%D January 1978
%P 1-6

%A Danny Dolev
%A Eliahu Shamir
%T Commutation relations of slices characterize some synchronization primitives
%J Information Processing Letters
%K ipl
%V 7
%N 1
%D January 1978
%P 7-9

%A P.M. Camerini
%T The min-max spanning tree problem and some extensions
%J Information Processing Letters
%K ipl
%V 7
%N 1
%D January 1978
%P 10-14

%A Andreas Karayiannis
%A Georghios Loizou
%T Cycle detection in critical path networks
%J Information Processing Letters
%K ipl
%V 7
%N 1
%D January 1978
%P 15-19

%A Shalom Tsur
%T Analysis of queuing networks
in which processes exhibit locality-transition behaviour
%J Information Processing Letters
%K ipl
%V 7
%N 1
%D January 1978
%P 20-23

%A Stefano Crespi-Reghizzi
%A Dino Mandrioli
%T A class of grammar generating non-counting languages
%J Information Processing Letters
%K ipl
%V 7
%N 1
%D January 1978
%P 24-26

%A Motoaki Terashima
%A Eiichi Goto
%T Genetic order abd compactifying garbage collectors
%J Information Processing Letters
%K ipl
%V 7
%N 1
%D January 1978
%P 27-32

%A Karel Culik,\ II
%T The decidability of nu-local catenativity
and of other properties of DOL systems
%J Information Processing Letters
%K ipl
%V 7
%N 1
%D January 1978
%P 33-35

%A W.E. Howden
%T Lindenmayer grammars and symbolic testing
%J Information Processing Letters
%K ipl
%V 7
%N 1
%D January 1978
%P 36-39

%A D.S. Hirschberg
%T An information-theoretic lower bound
for the longest common subsequence problem
%J Information Processing Letters
%K ipl
%V 7
%N 1
%D January 1978
%P 40-41

%A Jan Bergstra
%T What is an abstract datatype ?
%J Information Processing Letters
%K ipl
%V 7
%N 1
%D January 1978
%P 42-43

%A F. James Rohlf
%T A probabilistic minimum spanning tree algorithm
%J Information Processing Letters
%K ipl
%V 7
%N 1
%D January 1978
%P 44-48

%A Katsushi Inoue
%A Itsuo Takanami
%A Akira Nakamura
%T A note on two-dimensional finite automata
%J Information Processing Letters
%K ipl
%V 7
%N 1
%D January 1978
%P 49-52

%A Kenneth R. Anderson
%T A reevaluation of an efficient algorithm
for determining the convex hull of a finite planar set
%J Information Processing Letters
%K ipl
%V 7
%N 1
%D January 1978
%P 53-55

%A J. Koplowitz
%A D. Jouppi
%T A more efficient convex hull algorithm
%J Information Processing Letters
%K ipl
%V 7
%N 1
%D January 1978
%P 56-57

%A Dennis de\ Champeaux
%T Substad: for fast substitution in Lisp, with an application on unification
%J Information Processing Letters
%K ipl
%V 7
%N 1
%D January 1978
%P 58-62

%A William F. McColl
%T The maximum depth of monotone formulae
%J Information Processing Letters
%K ipl
%V 7
%N 2
%D February 1978
%P 65

%A Yahiko Kambayashi
%A Takaki Hayashi
%A Yoshikazu Tanaka
%A Shuzo Yajima
%T A linear storage space algorithm for a reference structure index
%J Information Processing Letters
%K ipl
%V 7
%N 2
%D February 1978
%P 66-71

%A A.S. Sethi
%A V. Rajaraman
%A P.S. Kenjale
%T An error-correcting coding scheme for alphanumeric data
%J Information Processing Letters
%K ipl
%V 7
%N 2
%D February 1978
%P 72-77

%A A. Brandwajn
%A Ph. Kruchten
%A J.A. Hernandez
%T Arcade - a system for research and education in computer architecture
%J Information Processing Letters
%K ipl
%V 7
%N 2
%D February 1978
%P 78-85

%A Selim G. Akl
%T Comments on: G. Manacher,
An application of pattern matching to a problem in geometrical complexity
%J Information Processing Letters
%K ipl
%V 7
%N 2
%D February 1978
%P 86

%A Jon Louis Bentley
%A Michael Ian Shamos
%T Divide and conquer for linear expected time
%J Information Processing Letters
%K ipl
%V 7
%N 2
%D February 1978
%P 87-91

%A Eero Peltola
%A Hannu Erkio
%T Insertion merge sorting
%J Information Processing Letters
%K ipl
%V 7
%N 2
%D February 1978
%P 92-99

%A Gheorghe Paun
%T On the generative capacity of simple matrix grammars of finite index
%J Information Processing Letters
%K ipl
%V 7
%N 2
%D February 1978
%P 100-102

%A Hanan Samet
%T A canonical form algorithm for proving equivalence of conditional forms
%J Information Processing Letters
%K ipl
%V 7
%N 2
%D February 1978
%P 103-106

%A J. Paredaens
%T On the expressive power of the relational algebra
%J Information Processing Letters
%K ipl
%V 7
%N 2
%D February 1978
%P 107-111

%A M. Boari
%A A. Natali
%T Multiple access to a tree in the context of readers and writers problem
%J Information Processing Letters
%K ipl
%V 7
%N 2
%D February 1978
%P 112-121

%A B.F. Caviness
%A H.I. Epstein
%T A note on the complexity of algebraic differentiation
%J Information Processing Letters
%K ipl
%V 7
%N 2
%D February 1978
%P 122-124

%A Grant A. Cheston
%T A correction to a unilaterally connected components algorithm
%J Information Processing Letters
%K ipl
%V 7
%N 2
%D February 1978
%P 125

%A Selim G. Akl
%A Godfried T. Toussaint
%T An improved algorithm to check for polygon similarity
%J Information Processing Letters
%K ipl
%V 7
%N 3
%D April 1978
%P 127-128

%A Sorin Istrail
%T Tag systems generating Thue irreducible sequences
%J Information Processing Letters
%K ipl
%V 7
%N 3
%D April 1978
%P 129-131

%A Radha Krishnan Arora
%A R.K. Subramanian
%T An optimal demand prepaging algorithm
%J Information Processing Letters
%K ipl
%V 7
%N 3
%D April 1978
%P 132-136

%A Wilfred J. Hansen
%T A predecessor algorithm for ordered lists
%J Information Processing Letters
%K ipl
%V 7
%N 3
%D April 1978
%P 137-138

%A Lloyd Allison
%T Phrase structures, non-determinism and backtracking
%J Information Processing Letters
%K ipl
%V 7
%N 3
%D April 1978
%P 139-143

%A Gerard Huet
%T An algorithm to generate the basis
of solutions to homogeneous linear Diophantine equations
%J Information Processing Letters
%K ipl
%V 7
%N 3
%D April 1978
%P 144-147

%A F.P. Preparata
%A D.V. Sarwate
%T An improved parallel processor bound in fast matrix inversion
%J Information Processing Letters
%K ipl
%V 7
%N 3
%D April 1978
%P 148-150

%A Stefan Sokolowski
%T A method for proving programming languages non context-free
%J Information Processing Letters
%K ipl
%V 7
%N 3
%D April 1978
%P 151-153

%A Norbert Illies
%T A counterexample to the generalized Aanderaa-Rosenberg conjecture
%J Information Processing Letters
%K ipl
%V 7
%N 3
%D April 1978
%P 154-155

%A R.E. Devillers
%A P.E. Lauer
%T A general mechanism for avoiding starvation with distributed control
%J Information Processing Letters
%K ipl
%V 7
%N 3
%D April 1978
%P 156-158

%A Angelika Reiser
%T A linear selection algorithm for sets of elements with weights
%J Information Processing Letters
%K ipl
%V 7
%N 3
%D April 1978
%P 159-162

%A Gaston H. Gonnet
%T Notes on the derivation of symptotic expressions from summations
%J Information Processing Letters
%K ipl
%V 7
%N 4
%D June 1978
%P 165-169

%A Joost Engelfriet
%T On tree transducers for partial functions
%J Information Processing Letters
%K ipl
%V 7
%N 4
%D June 1978
%P 170-172

%A Stanley M. Selkow
%T New bounds for the clique number of a graph
%J Information Processing Letters
%K ipl
%V 7
%N 4
%D June 1978
%P 173-174

%A Michael R. Garey
%A David S. Johnson
%A Franco P. Preparata
%A Robert E. Tarjan
%T Triangulating a simple polygon
%J Information Processing Letters
%K ipl
%V 7
%N 4
%D June 1978
%P 175-179

%A G. Schachtel
%T A nonocommutative algorithm for multipliying 5*5 matrices
using 103 multiplications
%J Information Processing Letters
%K ipl
%V 7
%N 4
%D June 1978
%P 180-182

%A G. Bongiovanni
%A F. Luccio
%T On Cahit's result on graceful permutations
%J Information Processing Letters
%K ipl
%V 7
%N 4
%D June 1978
%P 183-184

%A Richard J. Lipton
%A Raymond E. Miller
%T A batching method for coloring planar graphs
%J Information Processing Letters
%K ipl
%V 7
%N 4
%D June 1978
%P 185-188

%A D.T. Lee
%A F.P. Preparata
%T The all nearest neighbor problem for convex polygons
%J Information Processing Letters
%K ipl
%V 7
%N 4
%D June 1978
%P 189-192

%A Richard A. Demillo
%A Richard J. Lipton
%T A probabilistic remark on algebraic program testing
%J Information Processing Letters
%K ipl
%V 7
%N 4
%D June 1978
%P 193-195

%A Jeffrey Jaffe
%T Counting productions in context-free derivations
%J Information Processing Letters
%K ipl
%V 7
%N 4
%D June 1978
%P 196-200

%A Charles E. Hughes
%T The equivalence of vector addition systems
to a subclass of Post canonical systems
%J Information Processing Letters
%K ipl
%V 7
%N 4
%D June 1978
%P 201-204

%A Warren Burton
%T Comments on: "Sorting by distributive partitioning"
%J Information Processing Letters
%K ipl
%V 7
%N 4
%D June 1978
%P 205

%A Wlodomierz Dobosiewicz
%T Author's reply to Warren Burton's comments on
"Sorting by distributive partitioning"
%J Information Processing Letters
%K ipl
%V 7
%N 4
%D June 1978
%P 206

%A Keijo Ruohonen
%T A note on language equations involving morphisms
%J Information Processing Letters
%K ipl
%V 7
%N 5
%D August 1978
%P 209-212

%A I.J. Sudborough
%T A note on weak operator precedence grammars
%J Information Processing Letters
%K ipl
%V 7
%N 5
%D August 1978
%P 213-218

%A Selim G. Akl
%A Godfried T. Toissaint
%T A fast convex hull algorithm
%J Information Processing Letters
%K ipl
%V 7
%N 5
%D August 1978
%P 219-222

%A Ivan Bratko
%T Proving correctness of strategies in the AL1 assertional language
%J Information Processing Letters
%K ipl
%V 7
%N 5
%D August 1978
%P 223-230

%A Mark R. Brown
%T A storage scheme for height-balanced trees
%J Information Processing Letters
%K ipl
%V 7
%N 5
%D August 1978
%P 231-232

%A Radha Krishnan Arora
%A R.K. Subramanian
%T Exploiting the optimal paging algorithms
%J Information Processing Letters
%K ipl
%V 7
%N 5
%D August 1978
%P 233-236

%A Kohei Noshita
%A Etsuo Masuda
%A Hajime Machida
%T On the expected behaviors of the Dijkstra's shortest path algorithm
for complete graphs
%J Information Processing Letters
%K ipl
%V 7
%N 5
%D August 1978
%P 237-243

%A Ludwik Czaja
%T Implementation approach to parallel systems
%J Information Processing Letters
%K ipl
%V 7
%N 5
%D August 1978
%P 244-249

%A T.H. Merrett
%T QT logic: simpler and more expressive than predicate calculus
%J Information Processing Letters
%K ipl
%V 7
%N 6
%D October 1978
%P 251-255

%A V.M. Glushkov
%A G.E. Tseytlin
%A E.L. Yushchenko
%T Certain problems of the theory of structured programs schemes
%J Information Processing Letters
%K ipl
%V 7
%N 6
%D October 1978
%P 256-260

%A K.S. Natarajan
%A Lee J. White
%T Optimum domination in weighted trees
%J Information Processing Letters
%K ipl
%V 7
%N 6
%D October 1978
%P 261-265

%A Janos Demetrovics
%T On the number of candidate keys
%J Information Processing Letters
%K ipl
%V 7
%N 6
%D October 1978
%P 266-269

%A Miklos Ajtai
%A Janos Komlos
%A Endre Szemeredi
%T There is no fast single hashing algorithm
%J Information Processing Letters
%K ipl
%V 7
%N 6
%D October 1978
%P 270-273

%A Michael R. Garey
%A Robert E. Tarjan
%T A linear-time algorithm for finding all feedback vertices
%J Information Processing Letters
%K ipl
%V 7
%N 6
%D October 1978
%P 274-276

%A V.M. Malhotra
%A M. Pramodh Kumar
%A S.N. Maheshwari
%T An O(|V|^3) algorithm for finding maximum flows in networks
%J Information Processing Letters
%K ipl
%V 7
%N 6
%D October 1978
%P 277-278

%A Robert Giegerich
%A Reinhard Wilhelm
%T Counter-one-pass features in one-pass compilation:
a formalization using attribute grammars
%J Information Processing Letters
%K ipl
%V 7
%N 6
%D October 1978
%P 279-284

%A Gideon Yuval
%T A simple proof of Strassen's result
%J Information Processing Letters
%K ipl
%V 7
%N 6
%D October 1978
%P 285-286

%A E.P. Friedman
%A S.A. Greibach
%T On equivalence and subclass containment problems
for deterministic context-free languages
%J Information Processing Letters
%K ipl
%V 7
%N 6
%D October 1978
%P 287-290

%A Ludwik Czaja
%T Parallel implementation of path executions
%J Information Processing Letters
%K ipl
%V 7
%N 6
%D October 1978
%P 291-295

%A A. Bykat
%T Convex hull of a finite set of points in two dimensions
%J Information Processing Letters
%K ipl
%V 7
%N 6
%D October 1978
%P 296-298

%A Joseph Shortt
%T An iterative program to calculate Fibonacci numbers
in O(log n) arithmetic operations
%J Information Processing Letters
%K ipl
%V 7
%N 6
%D October 1978
%P 299-303

%A M. Jakobsson
%T Huffman coding in bit-vector compression
%J Information Processing Letters
%K ipl
%V 7
%N 6
%D October 1978
%P 304-307

%A Jukka Teuhola
%T A compression method for clustered bit-vectors
%J Information Processing Letters
%K ipl
%V 7
%N 6
%D October 1978
%P 308-311

%A Douglas W. Clark
%A C. Cordell Green
%T A note on shared list structure in Lisp
%J Information Processing Letters
%K ipl
%V 7
%N 6
%D October 1978
%P 312-314
%K garbage collection

%A Christos H. Papadimitriou
%T Efficient search for rationals
%J Information Processing Letters
%K ipl
%V 8
%N 1
%D January 1979
%P 1-4

%A K. Culik,\ II
%T Some decidability results about regular and pushdown translations
%J Information Processing Letters
%K ipl
%V 8
%N 1
%D January 1979
%P 5-8

%A Aviezri S. Fraenkel
%T Paired sequential lists in a memory interval
%J Information Processing Letters
%K ipl
%V 8
%N 1
%D January 1979
%P 9-10

%A Sylvia L. Osborn
%T Testing for existence of a covering Boyce-Codd normal form
%J Information Processing Letters
%K ipl
%V 8
%N 1
%D January 1979
%P 11-14

%A Katsushi Inoue
%A Itsuo Takanami
%T A note on cyclic closure operations
%J Information Processing Letters
%K ipl
%V 8
%N 1
%D January 1979
%P 15-16

%A Dana Angluin
%T A note on a construction of Margulis
%J Information Processing Letters
%K ipl
%V 8
%N 1
%D January 1979
%P 17-19

%A Steve Fortune
%A John Hopcroft
%T A note on Rabin's nearest neighbor algorithm
%J Information Processing Letters
%K ipl
%V 8
%N 1
%D January 1979
%P 20-23

%A Yossi Shiloach
%T Edge-disjoint branching in directed multigraphs
%J Information Processing Letters
%K ipl
%V 8
%N 1
%D January 1979
%P 24-27

%A Adi Shamir
%T Factoring numbers in O(log n) arithmetic steps
%J Information Processing Letters
%K ipl
%V 8
%N 1
%D January 1979
%P 28-31

%A M. Jantzen
%T A note on vector grammars
%J Information Processing Letters
%K ipl
%V 8
%N 1
%D January 1979
%P 32-33

%A Katsushi Inoue
%A Itsuo Takanami
%T A note on bottom-up pyramid acceptors
%J Information Processing Letters
%K ipl
%V 8
%N 1
%D January 1979
%P 34-37

%A A. Buda
%T Generalized sequential machine maps
%J Information Processing Letters
%K ipl
%V 8
%N 1
%D January 1979
%P 38-40

%A Daniel P. Friedman
%A David S. Wise
%T Reference counting can manage the circular environments of mutual recursion
%J Information Processing Letters
%K ipl
%V 8
%N 1
%D January 1979
%P 41-45

%A O.M. Makarov
%T Using duality to compute the pair of matrix products QY and Y^TQ
over a commutative ring
%J Information Processing Letters
%K ipl
%V 8
%N 1
%D January 1979
%P 46-49

%A Alberto Bertoni
%A Giancarlo Mauri
%A Mauro Torelli
%T Three efficient algorithms for counting problems
%J Information Processing Letters
%K ipl
%V 8
%N 1
%D January 1979
%P 50-53

%A Gordon Lyon
%T Batch scheduling from short lists
%J Information Processing Letters
%K ipl
%V 8
%N 2
%D February 1979
%P 57-59

%A Jacek Blazewicz
%T Deadline scheduling of tasks with readu timesd and resource constraints
%J Information Processing Letters
%K ipl
%V 8
%N 2
%D February 1979
%P 60-63

%A Dan A. Simovici
%A Gh. Grigoras
%T Even initial feedback vertex set problem is NP-complete
%J Information Processing Letters
%K ipl
%V 8
%N 2
%D February 1979
%P 64-66

%A J.L.W. Kessels
%A A.J. Martin
%T Two implementations of the conditional critical region
using a split binary semaphore
%J Information Processing Letters
%K ipl
%V 8
%N 2
%D February 1979
%P 67-71

%A M. van\ der\ Nat
%T Binary merging by partitioning
%J Information Processing Letters
%K ipl
%V 8
%N 2
%D February 1979
%P 72-75

%A Joseph M. Morris
%T A starvation-free solution to the mutual exclusion problem
%J Information Processing Letters
%K ipl
%V 8
%N 2
%D February 1979
%P 76-80

%A Jayadev Misra
%T Space-time trade off in implementing certain set operations
%J Information Processing Letters
%K ipl
%V 8
%N 2
%D February 1979
%P 81-85

%A H.W. Lenstra,\ Jr.
%T Miller's primality test
%J Information Processing Letters
%K ipl
%V 8
%N 2
%D February 1979
%P 86-88

%A Steven P. Reiss
%T Rational search
%J Information Processing Letters
%K ipl
%V 8
%N 2
%D February 1979
%P 89-90

%A H.S.M. Kruijer
%T Self-stabilization (in spite of distributed control)
in tree-structured systems
%J Information Processing Letters
%K ipl
%V 8
%N 2
%D February 1979
%P 91-95

%A David Dobkin
%A Richard J. Lipton
%A Steven Reiss
%T Linear programming is log-space hard for P
%J Information Processing Letters
%K ipl
%V 8
%N 2
%D February 1979
%P 96-97

%A T.H. Pequeno
%A C.J. Lucena
%T An approach for data type specification and its use in program verification
%J Information Processing Letters
%K ipl
%V 8
%N 2
%D February 1979
%P 98-103

%A Gheorghe Paun
%T On Szilard's languages associated to a matrix grammar
%J Information Processing Letters
%K ipl
%V 8
%N 2
%D February 1979
%P 104-105

%A John C. Cherniavsky
%T On finding test data sets for loop free programs
%J Information Processing Letters
%K ipl
%V 8
%N 2
%D February 1979
%P 106-107

%A Selim G. Akl
%T Two remarks on a convex hull algorithm
%J Information Processing Letters
%K ipl
%V 8
%N 2
%D February 1979
%P 108-109

%A Yu.G. Stoyan
%A V.Z. Socolovsky
%T The minimization method for some permutation functionals
%J Information Processing Letters
%K ipl
%V 8
%N 2
%D February 1979
%P 110-111

%A C.C. Rick
%A D.J. Evans
%T An improved bisection algorithm
%J Information Processing Letters
%K ipl
%V 8
%N 2
%D February 1979
%P 112-113

%A Wojciech Cellary
%T A new safety test for deadlock avoidance
%J Information Processing Letters
%K ipl
%V 8
%N 3
%D March 1979
%P 115-120

%A Bengt Aspvall
%A Michael F. Plass
%A Robert Endre Tarjan
%T A linear-time algorithm for testing the truth
of certain quantified boolean formulas
%J Information Processing Letters
%K ipl
%V 8
%N 3
%D March 1979
%P 121-123

%A Om Vikas
%T Analysis of a periodically inspected buffer
%J Information Processing Letters
%K ipl
%V 8
%N 3
%D March 1979
%P 124-130

%A Rudolf Mathon
%T A note on the graph isomorphism counting problem
%J Information Processing Letters
%K ipl
%V 8
%N 3
%D March 1979
%P 131-132

%A Jon Louis Bentley
%A Hermann A. Maurer
%T A note on Euclidean near neighbor searching in the plane
%J Information Processing Letters
%K ipl
%V 8
%N 3
%D March 1979
%P 133-136

%A Gerard J.M. Sang Ajang
%A Frank Teer
%T An efficient algorithm for detection of combined occurrences
%J Information Processing Letters
%K ipl
%V 8
%N 3
%D March 1979
%P 137-140

%A Sukhamay Kundu
%T An intermadiate-value theorem for optimum tree valuation
%J Information Processing Letters
%K ipl
%V 8
%N 3
%D March 1979
%P 141-145

%A Yossi Shiloach
%T Strong linear orderings of a directed network
%J Information Processing Letters
%K ipl
%V 8
%N 3
%D March 1979
%P 146-148

%A Jan van\ Leeuwen
%T On compromising statistical data-bases with a few known elements
%J Information Processing Letters
%K ipl
%V 8
%N 3
%D March 1979
%P 149-153

%A Mark R. Brown
%T Addendum to "A storage scheme for height-balanced trees"
%J Information Processing Letters
%K ipl
%V 8
%N 3
%D March 1979
%P 154-156

%A Selim G. Akl
%A Godfried T. Toussaint
%T Addendum to "An improved algorithm to check for polygon similarity"
%J Information Processing Letters
%K ipl
%V 8
%N 3
%D March 1979
%P 157-158

%A M.A. Bonuccelli
%A D.P. Bovet
%T Minimum node disjoint path covering for circular-arc graphs
%J Information Processing Letters
%K ipl
%V 8
%N 4
%D April 1979
%P 159-161

%A Ludwik Czaja
%T A specification of parallel problems
%J Information Processing Letters
%K ipl
%V 8
%N 4
%D April 1979
%P 162-167

%A Martin Huits
%A Vipin Kumar
%T The practical significance of distributive partitioning sort
%J Information Processing Letters
%K ipl
%V 8
%N 4
%D April 1979
%P 168-169

%A Wlodzimierz Dobosiewicz
%T The practical significance of D.P. sort revisited
%J Information Processing Letters
%K ipl
%V 8
%N 4
%D April 1979
%P 170-172

%A Alain Fournier
%T Comments on convex hull of a finite set of points in two dimensions
%J Information Processing Letters
%K ipl
%V 8
%N 4
%D April 1979
%P 173

%A Hirosi Hitotumatu
%A Kohei Noshita
%T A technique for implementing backtrack algorithms and its application
%J Information Processing Letters
%K ipl
%V 8
%N 4
%D April 1979
%P 174-175

%A J. Henno
%T The depth of monotone functions in multivalued logic
%J Information Processing Letters
%K ipl
%V 8
%N 4
%D April 1979
%P 176-177

%A Ronald L. Rivest
%A Jean-Paul van\ de\ Wiele
%T An Omega((n/lg n)^1/2) lower bound on the number of additions
necessary to compute 0-1 polynomials over the ring of integer polynomials
%J Information Processing Letters
%K ipl
%V 8
%N 4
%D April 1979
%P 178-180

%A K. Culik,\ II
%A H.A. Maurer
%T Secure information storage and retrieval using new results in cryptography
%J Information Processing Letters
%K ipl
%V 8
%N 4
%D April 1979
%P 181-186

%A Esko Ukkonen
%T The nonexistence of some covering context-free grammars
%J Information Processing Letters
%K ipl
%V 8
%N 4
%D April 1979
%P 187-192

%A C.C. Yang
%A D.T. Lee
%T A note on the nearest-neighbor problem for convex polygons
%J Information Processing Letters
%K ipl
%V 8
%N 4
%D April 1979
%P 193-194

%A David Harel
%T Two results on process logic
%J Information Processing Letters
%K ipl
%V 8
%N 4
%D April 1979
%P 195-198

%A J. Plesnik
%T The NP-completeness of the Hamiltonian cycle problem
in planar digraphs with degree bound two
%J Information Processing Letters
%K ipl
%V 8
%N 4
%D April 1979
%P 199-201

%A P.S. Pankov
%A S.L. Dolmatov
%T Substantiable evaluations by electronic computers
and their application to one problem in combinatorial geometry
%J Information Processing Letters
%K ipl
%V 8
%N 4
%D April 1979
%P 202-203

%A Felix J. Fridman
%A Glenn H. Holloway
%A Naftaly H. Minsky
%A Josef Stein
%T Abstract for-loops over several aggregates
%J Information Processing Letters
%K ipl
%V 8
%N 4
%D April 1979
%P 204-206

%A Jorg Muhlbacher
%T F-factors of graphs: a generalized matching problem
%J Information Processing Letters
%K ipl
%V 8
%N 4
%D April 1979
%P 207-214

%A Harld Abelson
%T A note on time-space tradeoffs for computing continuous functions
%J Information Processing Letters
%K ipl
%V 8
%N 4
%D April 1979
%P 215-217

%A Y.V. Silva-Filho
%T Average case analysis of region search in balanced k-d trees
%J Information Processing Letters
%K ipl
%V 8
%N 5
%D June 1979
%P 219-223

%A M. Broy
%A M. Wirsing
%A J.P. Finance
%A A. Quere
%A J.L. Remy
%T Methodical solution of the problem of
ascending subsequences of maximum length a given sequence
%J Information Processing Letters
%K ipl
%V 8
%N 5
%D June 1979
%P 224-229

%A Timo Leipala
%T On a generalization of binary search
%J Information Processing Letters
%K ipl
%V 8
%N 5
%D June 1979
%P 230-233

%A Dario Bini
%A Milvio Capovani
%A Francesco Romani
%A Grazia Lotti
%T O(n^2.7799) complexity for n*n approximate matrix multiplication
%J Information Processing Letters
%K ipl
%V 8
%N 5
%D June 1979
%P 234-235

%A Yossi Shiloach
%T A fast equivalence-checking algorithm for circular lists
%J Information Processing Letters
%K ipl
%V 8
%N 5
%D June 1979
%P 236-238

%A Wolfgang Reisig
%T A note on the representation of finite tree automata
%J Information Processing Letters
%K ipl
%V 8
%N 5
%D June 1979
%P 239-240

%A D. van\ der\ Knijff
%A J.-L. Lassez
%T A clarification of the comparison between some measures of software science
%J Information Processing Letters
%K ipl
%V 8
%N 5
%D June 1979
%P 241-243

%A Jon Louis Bentley
%T Decomposable search problems
%J Information Processing Letters
%K ipl
%V 8
%N 5
%D June 1979
%P 244-251

%A Georghios Loizou
%T Mathematical solution for a data processing system
%J Information Processing Letters
%K ipl
%V 8
%N 5
%D June 1979
%P 252-256

%A Keijo Ruohonen
%T The decidability of the F0L-D0L equivalence problem
%J Information Processing Letters
%K ipl
%V 8
%N 5
%D June 1979
%P 257-260

%A C.N. Fischer
%A K.C. Tai
%A D.R. Milton
%T Immediate error detection in strong LL(1) parsers
%J Information Processing Letters
%K ipl
%V 8
%N 5
%D June 1979
%P 261-266

%A Eitan M. Gurari
%A Oscar H. Ibarra
%T On the space complexity of recursive algorithms
%J Information Processing Letters
%K ipl
%V 8
%N 5
%D June 1979
%P 267-271

%A Arnold L. Rosenberg
%T A note on paths embedded in trees
%J Information Processing Letters
%K ipl
%V 8
%N 5
%D June 1979
%P 272-273

%A N. Soundararajan
%T Axiomatic proofs of total correctness of programs
%J Information Processing Letters
%K ipl
%V 8
%N 5
%D June 1979
%P 274-277

%A Hamish I.E. Gunn
%A Ronald Morrison
%T On the implementation of constants
%J Information Processing Letters
%K ipl
%V 9
%N 1
%D July 1979
%P 1-4

%A P.A.S. Veolos
%T Characterizing the regular prefix codes and right power-bounded languages
%J Information Processing Letters
%K ipl
%V 9
%N 1
%D July 1979
%P 5-7

%A John C. Cherniavsky
%A John Keohane
%A Peter B. Henderson
%T A note concerning top down program development
and restricted exit control structures
%J Information Processing Letters
%K ipl
%V 9
%N 1
%D July 1979
%P 8-12

%A David M. Berry
%A Richard L. Schwartz
%T United and discriminated record types in strongly typed languages
%J Information Processing Letters
%K ipl
%V 9
%N 1
%D July 1979
%P 13-18

%A P.J. Eberlein
%T A note on median selection and spider production
%J Information Processing Letters
%K ipl
%V 9
%N 1
%D July 1979
%P 19-22

%A A. Bykat
%T On polygon similarity
%J Information Processing Letters
%K ipl
%V 9
%N 1
%D July 1979
%P 23-25

%A H.B.M. Jonkers
%T A fast garbage compaction algorithm
%J Information Processing Letters
%K ipl
%V 9
%N 1
%D July 1979
%P 26-30

%A Glenn K. Manacher
%A Albert L. Zobrist
%T Neither the greedy nor the Delaunay triangulation of a planar point set
approximates the optimal triangulation
%J Information Processing Letters
%K ipl
%V 9
%N 1
%D July 1979
%P 31-34

%A Richard A. De\ Millo
%A Raymond E. Miller
%T Implicit computation of synchronization primitives
%J Information Processing Letters
%K ipl
%V 9
%N 1
%D July 1979
%P 35-38

%A Marek J. Lao
%T A new data structure for the union-find problem
%J Information Processing Letters
%K ipl
%V 9
%N 1
%D July 1979
%P 39-45

%A Dario Bini
%A Milvio Capovani
%T Lower bounds of the complexity of linear algebras
%J Information Processing Letters
%K ipl
%V 9
%N 1
%D July 1979
%P 46-47

%A Andrew C. Yao
%T A note on a conjecture of Kam and Ullman concerning statistical databases
%J Information Processing Letters
%K ipl
%V 9
%N 1
%D July 1979
%P 48-50

%A A. Nijholt
%T From left-regular to Greibach normal form grammars
%J Information Processing Letters
%K ipl
%V 9
%N 1
%D July 1979
%P 51-55

%A Mark R. Brown
%T Some observations on random 2-3 trees
%J Information Processing Letters
%K ipl
%V 9
%N 2
%D August 1979
%P 57-59

%A Jan Grabowski
%T The unsolvability of some Petri net language problems
%J Information Processing Letters
%K ipl
%V 9
%N 2
%D August 1979
%P 60-63

%A F.N. Teskey
%T Document retrieval using associative processors
%J Information Processing Letters
%K ipl
%V 9
%N 2
%D August 1979
%P 64-67

%A F. Frances Yao
%T Graph 2-isomorphism is NP-complete
%J Information Processing Letters
%K ipl
%V 9
%N 2
%D August 1979
%P 68-72

%A Akihiro Nozaki
%T A note on the complexity of approximative evaluation of polynomials
%J Information Processing Letters
%K ipl
%V 9
%N 2
%D August 1979
%P 73-75

%A Richard L. Schwartz
%T Aliasing among pointers in Euclid
%J Information Processing Letters
%K ipl
%V 9
%N 2
%D August 1979
%P 76-79

%A W.S. Luk
%T "Possible" membership of a multivalued dependency in a relational database
%J Information Processing Letters
%K ipl
%V 9
%N 2
%D August 1979
%P 80-83

%A Andrzej Ehrenfeucht
%A Grzegorz Rozenberg
%T An observation on scattered grammars
%J Information Processing Letters
%K ipl
%V 9
%N 2
%D August 1979
%P 84-85

%A Andrzej Ehrenfeucht
%A Grzegorz Rozenberg
%T Finding a homomorphism between two words in NP-complete
%J Information Processing Letters
%K ipl
%V 9
%N 2
%D August 1979
%P 86-88

%A B. Srinivasan
%A V. Rajaraman
%T On the normalization of relational databases
%J Information Processing Letters
%K ipl
%V 9
%N 2
%D August 1979
%P 89-92

%A Abhijit Sengupta
%A Subir Bandtopadhyay
%A Pradip K. Srimani
%T On identification of CR property in file organisation
%J Information Processing Letters
%K ipl
%V 9
%N 2
%D August 1979
%P 93-96
%K consecutive retrieval

%A John Grant
%T Partial values in a tabular database model
%J Information Processing Letters
%K ipl
%V 9
%N 2
%D August 1979
%P 97-99

%A Boguslaw L. Jackowski
%A Ryszard Kubiak
%A Stefan Sokolowski
%T Complexity of sorting by distributive partitioning
%J Information Processing Letters
%K ipl
%V 9
%N 2
%D August 1979
%P 100

%A E. Best
%T A note on the proof of a concurrent program
%J Information Processing Letters
%K ipl
%V 9
%N 3
%D October 1979
%P 103-104

%A Alain Fournier
%A Zvi Kedem
%T Comments on the all nearest-neighbor problem for convex polygons
%J Information Processing Letters
%K ipl
%V 9
%N 3
%D October 1979
%P 105-107

%A Charles J. Colbourn
%T The complexity of symmetrizing matrices
%J Information Processing Letters
%K ipl
%V 9
%N 3
%D October 1979
%P 108-109

%A Sandra Mitchell
%A Stephen Hedetniemi
%T Linear algorithms for edge coloring trees and unicyclic graphs
%J Information Processing Letters
%K ipl
%V 9
%N 3
%D October 1979
%P 110-112

%A R.K. Arora
%A S.P. Rana
%T On module assignment in two-processor distributed systems
%J Information Processing Letters
%K ipl
%V 9
%N 3
%D October 1979
%P 113-117

%A Alon Itai
%T A randomized algorithm for checking equivalence of circular lists
%J Information Processing Letters
%K ipl
%V 9
%N 3
%D October 1979
%P 118-121

%A M.H. Williams
%A A.R. Bulmer
%T A transportable code generator generator system
%J Information Processing Letters
%K ipl
%V 9
%N 3
%D October 1979
%P 122-125

%A Marco Ferrari
%A Giovanni Guida
%T DB: a Lisp-type data base system
%J Information Processing Letters
%K ipl
%V 9
%N 3
%D October 1979
%P 126-134

%A Amiram Yehudai
%T A note on the pumping lemma for regular languages
%J Information Processing Letters
%K ipl
%V 9
%N 3
%D October 1979
%P 135-136

%A Kozo Itano
%T Reduction of page swaps on the dimensional transforms in a paging environment
%J Information Processing Letters
%K ipl
%V 9
%N 3
%D October 1979
%P 137-140

%A Ferenc Devai
%A Tibor Szendrenyi
%T Comments on convex hull of a finite set of points in two dimensions
%J Information Processing Letters
%K ipl
%V 9
%N 3
%D October 1979
%P 141-142

%A Gianfranco Prini
%T Stack implementation of shallow binding in languages with mixed scoping
%J Information Processing Letters
%K ipl
%V 9
%N 3
%D October 1979
%P 143-154
%K funarg funval

%A Hans Langmaack
%A Wolfram Lippe
%A Franz Wagner
%T The formal termination problem for programs with finite Algol 68-modes
%J Information Processing Letters
%K ipl
%V 9
%N 3
%D October 1979
%P 155-159

%A W. Randolph Franklin
%T Padded lists: set operations in expexted theta(log log n) time
%J Information Processing Letters
%K ipl
%V 9
%N 4
%D November 1979
%P 161-166

%A Joseph Y-T. Leung
%T Bounds on list scheduling of UET tasks with restricted resource constraints
%J Information Processing Letters
%K ipl
%V 9
%N 4
%D November 1979
%P 167-170

%A E.J. Cockayne
%A F. Ruskey
%A A.G. Thomason
%T An algorithm for the most economic link addition
in a tree communications network
%J Information Processing Letters
%K ipl
%V 9
%N 4
%D November 1979
%P 171-175

%A J. Strother Moore
%T A mechanical proof of the termination of Takeuchi's function
%J Information Processing Letters
%K ipl
%V 9
%N 4
%D November 1979
%P 176-181
%K TAK

%A Alkiviadis G. Akritas
%T On the solution of polynomial equations using continued fractions
%J Information Processing Letters
%K ipl
%V 9
%N 4
%D November 1979
%P 182-184

%A K.M. Chandy
%A J. Misra
%T Deadlock absence proofs for networks of communicating processes
%J Information Processing Letters
%K ipl
%V 9
%N 4
%D November 1979
%P 185-189

%A D.T. Lee
%A C.C. Yang
%T Location of multiple points in a planar subdivision
%J Information Processing Letters
%K ipl
%V 9
%N 4
%D November 1979
%P 190-193

%A Jayme Luiz Szwarcfiter
%T Systems of distinct representatives for k families of sets
%J Information Processing Letters
%K ipl
%V 9
%N 5
%D December 1979
%P 195-196

%A Joseph M. Morris
%T Traversing binary trees simply and cheaply
%J Information Processing Letters
%K ipl
%V 9
%N 5
%D December 1979
%P 197-200

%A Duncan McCallum
%A David Avis
%T A linear algorithm for finding the convex hull of a simple polygon
%J Information Processing Letters
%K ipl
%V 9
%N 5
%D December 1979
%P 201-206

%A G. Oulsnam
%T Cyclomatic numbers do not measure complexity of unstructured programs
%J Information Processing Letters
%K ipl
%V 9
%N 5
%D December 1979
%P 207-211

%A Nachum Dershowitz
%T A note on simplification orderings
%J Information Processing Letters
%K ipl
%V 9
%N 5
%D December 1979
%P 212-215

%A A.M. Andrew
%T Another efficient algorithm for convex hulls in two dimensions
%J Information Processing Letters
%K ipl
%V 9
%N 5
%D December 1979
%P 216-219

%A J.M. Robson
%T The emptiness of complement problem
for semi extended regular expressions requires c^n space
%J Information Processing Letters
%K ipl
%V 9
%N 5
%D December 1979
%P 220-222

%A Kevin Q. Brown
%T Voronoi diagrams from convex hulls
%J Information Processing Letters
%K ipl
%V 9
%N 5
%D December 1979
%P 223-228

%A Sandra L. Mitchell
%T Linear algorithms to recognize outerplanar and maximal outerplanar graphs
%J Information Processing Letters
%K ipl
%V 9
%N 5
%D December 1979
%P 229-232

%A Roman Slowinski
%T Cost-minimal preemptive scheduling of independent jobs
with release and due dates n open shop under resource constraints
%J Information Processing Letters
%K ipl
%V 9
%N 5
%D December 1979
%P 233-237

%A Michael J.C. GOrdon
%T The denotational semantics of sequential machines
%J Information Processing Letters
%K ipl
%V 10
%N 1
%D February 1980
%P 1-3

%A H. Olive
%T On the relationship between son-trees and symmetric binary B-trees
%J Information Processing Letters
%K ipl
%V 10
%N 1
%D February 1980
%P 4-8

%A V.J. Rayward-Smith
%A R.N. Rolph
%T Finding linear and circular sequences of minimal and maximal total adjacency
%J Information Processing Letters
%K ipl
%V 10
%N 1
%D February 1980
%P 9-13

%A Peter Honeyman
%A Richard E. Ladner
%A Mihalis Yannakakis
%T Testing the universal instance assumption
%J Information Processing Letters
%K ipl
%V 10
%N 1
%D February 1980
%P 14-19

%A Ashoko Deb
%T Conflict-free access of arrays - a counter example
%J Information Processing Letters
%K ipl
%V 10
%N 1
%D February 1980
%P 20

%A Miroslaw Truszczynski
%T Once more on storage for consecutive retrieval
%J Information Processing Letters
%K ipl
%V 10
%N 1
%D February 1980
%P 21-24

%A Leslie M. Goldschlager
%T A space efficient algorithm for the monotone planar circuit value problem
%J Information Processing Letters
%K ipl
%V 10
%N 1
%D February 1980
%P 25-27

%A Errol L. Lloyd
%T List scheduling bounds for UET systems with resources
%J Information Processing Letters
%K ipl
%V 10
%N 1
%D February 1980
%P 28-31

%A Carlo Zaniolo
%T Mixed transitivity for functional and multivalued dependencies
in database relations
%J Information Processing Letters
%K ipl
%V 10
%N 1
%D February 1980
%P 32-34

%A T. Bui
%T A note on an improved bisection algorithm
%J Information Processing Letters
%K ipl
%V 10
%N 1
%D February 1980
%P 35-36

%A Daniel D.K.D.B. Sleator
%T A 2.5 times optimal algorithm for packing in two dimensions
%J Information Processing Letters
%K ipl
%V 10
%N 1
%D February 1980
%P 37-40

%A Dilip V. Sarwate
%T A note on universal classes of hash functions
%J Information Processing Letters
%K ipl
%V 10
%N 1
%D February 1980
%P 41-45

%A Bruce Anderson
%T Encoded pointers - an interesting data-structure for modern SIL's
%J Information Processing Letters
%K ipl
%V 10
%N 2
%D March 1980
%P 47-50
%K XOR

%A Jan Van\ Leeuwen
%A Derick Wood
%T Dynamization of decomposable searching problems
%J Information Processing Letters
%K ipl
%V 10
%N 2
%D March 1980
%P 51-56

%A V.K. Sabelfeld
%T The logic-termal equivalence is polynomial-time decidable
%J Information Processing Letters
%K ipl
%V 10
%N 2
%D March 1980
%P 57-62

%A Solomon Passy
%T Structured programs for Turing machines
%J Information Processing Letters
%K ipl
%V 10
%N 2
%D March 1980
%P 63-67

%A Thomas C. Wilson
%T An O(log n) algorithm for computing general order-k Fibonacci numbers
%J Information Processing Letters
%K ipl
%V 10
%N 2
%D March 1980
%P 68-75

%A Frank M. Liang
%T A lower bound for on-line bin packing
%J Information Processing Letters
%K ipl
%V 10
%N 2
%D March 1980
%P 76-79

%A Manuel Blum
%A Ashok K. Chandra
%A Mark N. Wegman
%T Equivalence of free boolean graphs
can be decided probabilistically in polynomial time
%J Information Processing Letters
%K ipl
%V 10
%N 2
%D March 1980
%P 80-82

%A Paul M.B. Vitanyi
%T Achievable high scores of epsilon-moves
and running times in DPDA computations
%J Information Processing Letters
%K ipl
%V 10
%N 2
%D March 1980
%P 83-86

%A Nicola Santoro
%T Extending the four Russians' bound to general matrix multiplication
%J Information Processing Letters
%K ipl
%V 10
%N 2
%D March 1980
%P 87-88

%A Hanan Samet
%A Leo Marcus
%T Purging in an equality data base
%J Information Processing Letters
%K ipl
%V 10
%N 2
%D March 1980
%P 89-95

%A Mordechai Ben-Ari
%T A simplified proof that regular resolution is exponential
%J Information Processing Letters
%K ipl
%V 10
%N 2
%D March 1980
%P 96-98

%A Alexandre Brandwajn
%A Rene Joly
%T A scheme for a fault-tolerant virtual memory
%J Information Processing Letters
%K ipl
%V 10
%N 2
%D March 1980
%P 99-103

%A Frank G. Pagan
%T On the generation of compilers fro language definitions
%J Information Processing Letters
%K ipl
%V 10
%N 2
%D March 1980
%P 104-107

%A Mehdi jazayeri
%T An improvement in the iterative data flow analysis algorithm
%J Information Processing Letters
%K ipl
%V 10
%N 2
%D March 1980
%P 108-110

%A R.K. Arora
%A S.P. Rana
%T Analysis of the module assignment problem
in distributed computing systems with limited storage
%J Information Processing Letters
%K ipl
%V 10
%N 3
%D April 1980
%P 111-115

%A Osamu Watanabe
%T Another application of recursion introduction
%J Information Processing Letters
%K ipl
%V 10
%N 3
%D April 1980
%P 116-119

%A Peter J.L. Walis
%A Bernard W. Silverman
%T Efficient implementation of the Ada overloading rules
%J Information Processing Letters
%K ipl
%V 10
%N 3
%D April 1980
%P 120-123

%A G. Hemerik
%T Formal derivation of a list processing program
%J Information Processing Letters
%K ipl
%V 10
%N 3
%D April 1980
%P 124-126

%A David G. Kirkpatrick
%T A note on Delaunay and optimal triangulations
%J Information Processing Letters
%K ipl
%V 10
%N 3
%D April 1980
%P 127-128

%A Patrick Shen-Pei Wang
%T Some new results on isotonic array grammars
%J Information Processing Letters
%K ipl
%V 10
%N 3
%D April 1980
%P 129-131

%A Peter van\ Emde\ Boas
%T On the Omega(n log n) lower bound
for convex hull and maximal vector determination
%J Information Processing Letters
%K ipl
%V 10
%N 3
%D April 1980
%P 132-136

%A Wojciech Cellary
%A Daniel Mayer
%T A simple model of query scheduling in distributed data base systems
%J Information Processing Letters
%K ipl
%V 10
%N 3
%D April 1980
%P 137-147

%A J.A. Barnden
%T A characterization of systems derived from terminating concurrent histories
%J Information Processing Letters
%K ipl
%V 10
%N 3
%D April 1980
%P 148-152

%A Ludwik Czaja
%T Parallel system schemas and their relation to automata
%J Information Processing Letters
%K ipl
%V 10
%N 3
%D April 1980
%P 153-158

%A J.L.W. Kessels
%T The readers and writers problem avoided
%J Information Processing Letters
%K ipl
%V 10
%N 3
%D April 1980
%P 159-162

%A M. van\ der\ Nat
%T A fast sorting algorithm, a hybrid of distributive and merge sorting
%J Information Processing Letters
%K ipl
%V 10
%N 3
%D April 1980
%P 163-167

%A Robert Melville
%A David Gries
%T Controlled density sorting
%J Information Processing Letters
%K ipl
%V 10
%N 4,5
%D July 1980
%P 169-172

%A Alan A. Bertossi
%T On the complexity of scheduling jobs on dedicated resources
to minimize set-up costs
%J Information Processing Letters
%K ipl
%V 10
%N 4,5
%D July 1980
%P 173-177

%A Aviezri S. Fraenkel
%A Yaacov Yesha
%T Complexity of solving algebraic equations
%J Information Processing Letters
%K ipl
%V 10
%N 4,5
%D July 1980
%P 178-179

%A F. Luccio
%A S. Mazzone
%T A cryptosystem for multiple communication
%J Information Processing Letters
%K ipl
%V 10
%N 4,5
%D July 1980
%P 180-183

%A Thomas Lengauer
%A Robert E. Tarjan
%T The space complexity of pebble games on trees
%J Information Processing Letters
%K ipl
%V 10
%N 4,5
%D July 1980
%P 184-188

%A Arthur M. Farley
%T Levelling terrain trees: a transshipment problem
%J Information Processing Letters
%K ipl
%V 10
%N 4,5
%D July 1980
%P 189-192

%A M. Broy
%A M. Wirsing
%T Program development: from enumeration to backtracking
%J Information Processing Letters
%K ipl
%V 10
%N 4,5
%D July 1980
%P 193-197

%A F. Warren Burton
%T A robust variation of interpolation search
%J Information Processing Letters
%K ipl
%V 10
%N 4,5
%D July 1980
%P 198-201

%A Carla Savage
%T Maximum matchings and trees
%J Information Processing Letters
%K ipl
%V 10
%N 4,5
%D July 1980
%P 202-205

%A R.W. Doran
%A L.K. Thomas
%T Variants of the software solution to mutual exclusion
%J Information Processing Letters
%K ipl
%V 10
%N 4,5
%D July 1980
%P 206-208
%K Dekker Holt Dijkstra

%A Mark H. Overmars
%A Jan van\ Leeuwen
%T Further comments on Bykat's convex hull algorithm
%J Information Processing Letters
%K ipl
%V 10
%N 4,5
%D July 1980
%P 209-212

%A Henk Meijer
%A Selim G. Akl
%T The design and analysis of a new hybrid sorting algorithm
%J Information Processing Letters
%K ipl
%V 10
%N 4,5
%D July 1980
%P 213-218

%A Akira Nakamura
%A Katsushi Inoue
%T A remark on two-dimensional finite automata
%J Information Processing Letters
%K ipl
%V 10
%N 4,5
%D July 1980
%P 219-222

%A A. Ehrenfeucht
%A G. Rozenberg
%T On the emptiness problem of the intersection of two D0S languages problem
%J Information Processing Letters
%K ipl
%V 10
%N 4,5
%D July 1980
%P 223-225

%A K.M. Chung
%A F. Luccio
%A C.K. Wong
%T A new permutation algorithm for bubble memories
%J Information Processing Letters
%K ipl
%V 10
%N 4,5
%D July 1980
%P 226-230

%A Corrado Bohm
%A Antonio Machi
%A Giovanni Sontacchi
%T Complexity bounds for equivalence and isomorphism of latin squares
%J Information Processing Letters
%K ipl
%V 10
%N 4,5
%D July 1980
%P 231-233

%A Ludwik Czaja
%T Deadlock and fairness in parallel schemas:
a set-theoretic characterization and decision problems
%J Information Processing Letters
%K ipl
%V 10
%N 4,5
%D July 1980
%P 234-239

%A Kellogg S. Booth
%T Lexicographically least circular substrings
%J Information Processing Letters
%K ipl
%V 10
%N 4,5
%D July 1980
%P 240-242

%A Peter Buneman
%A Leon Levy
%T The towers of Hanoi problem
%J Information Processing Letters
%K ipl
%V 10
%N 4,5
%D July 1980
%P 243-244

%A Katsushi Inoue
%A Itsuo Takanami
%T A note on decision problems for three-way two-dimensional finite automata
%J Information Processing Letters
%K ipl
%V 10
%N 4,5
%D July 1980
%P 245-248

%A Edsger W. Dijkstra
%A C.S. Scholten
%T Termination detection for diffusing computations
%J Information Processing Letters
%K ipl
%V 11
%N 1
%D August 1980
%P 1-4

%A Wlodzimierz Dobosiewitz
%T An efficient variation of bubble sort
%J Information Processing Letters
%K ipl
%V 11
%N 1
%D August 1980
%P 5-6

%A D.C.S. Allison
%A M.T. Noga
%T Selection by distributive partitioning
%J Information Processing Letters
%K ipl
%V 11
%N 1
%D August 1980
%P 7-8

%A Tomasz Krawczyk
%T Error correction by mutational grammars
%J Information Processing Letters
%K ipl
%V 11
%N 1
%D August 1980
%P 9-15

%A Kabekode V.S. Bhat
%T On the complexity testing a graph for n-cube
%J Information Processing Letters
%K ipl
%V 11
%N 1
%D August 1980
%P 16-19

%A Jan Grabowski
%T The decidability of persistence for vector addition systems
%J Information Processing Letters
%K ipl
%V 11
%N 1
%D August 1980
%P 20-23

%A Michael C. Loui
%T A note on the pebble game
%J Information Processing Letters
%K ipl
%V 11
%N 1
%D August 1980
%P 24-26

%A J.D. Day
%T On the internal S-stability of Rosenbrock methods
%J Information Processing Letters
%K ipl
%V 11
%N 1
%D August 1980
%P 27-30

%A J.D. Day
%T Comments on: T.D. Bui,
"On an L-stable method for stiff differential equations"
%J Information Processing Letters
%K ipl
%V 11
%N 1
%D August 1980
%P 31-32

%A Georghois Loizou
%T On a cycle finding algorithm
%J Information Processing Letters
%K ipl
%V 11
%N 1
%D August 1980
%P 33-36

%A Donna J. Brown
%T An improved BL lower bound
%J Information Processing Letters
%K ipl
%V 11
%N 1
%D August 1980
%P 37-39

%A James L. Peterson
%T A note on colored Petri nets
%J Information Processing Letters
%K ipl
%V 11
%N 1
%D August 1980
%P 40-43

%A L.G. Valiant
%T Computing multivariate polynomials in parallel
%J Information Processing Letters
%K ipl
%V 11
%N 1
%D August 1980
%P 44-45

%A R.P. Brent
%A H.T. Kung
%T On the area of binary tree layouts
%J Information Processing Letters
%K ipl
%V 11
%N 1
%D August 1980
%P 46-48

%A Charles R. Dyer
%T A fast parallel algorithm for the closest pair problem
%J Information Processing Letters
%K ipl
%V 11
%N 1
%D August 1980
%P 49-52

%A Luc Devroye
%T A note on finding convex hulls via maximal vectors
%J Information Processing Letters
%K ipl
%V 11
%N 1
%D August 1980
%P 53-56

%A Lech Banachowski
%T A complement to Tarjan's result
about the lower bound on the complexity of the set union problem
%J Information Processing Letters
%K ipl
%V 11
%N 2
%D October 1980
%P 59-65

%A Friedrich J. Urbanek
%T An O(log n) algorithm for computing the nth element of the solution
of a difference equation
%J Information Processing Letters
%K ipl
%V 11
%N 2
%D October 1980
%P 66-67

%A David Gries
%A Gary Levin
%T Computing Fibonacci numbers (and similarly defined functions) in log time
%J Information Processing Letters
%K ipl
%V 11
%N 2
%D October 1980
%P 68-72

%A Lishingh Liu
%A Alan Demers
%T An algorithm for testing lossless join property in relational databases
%J Information Processing Letters
%K ipl
%V 11
%N 2
%D October 1980
%P 73-76

%A Franco P. Preparata
%A Jean E. Vuillemin
%T Area-time optimal VLSI networks for multiplying matrices
%J Information Processing Letters
%K ipl
%V 11
%N 2
%D October 1980
%P 77-80

%A K.M. Chung
%A F. Luccio
%A C.K. Wong
%T Minimum number of steps for permutation in a bubble memory
%J Information Processing Letters
%K ipl
%V 11
%N 2
%D October 1980
%P 81-83

%A Andrew C. Yao
%T A note on the analysis of extendible hashing
%J Information Processing Letters
%K ipl
%V 11
%N 2
%D October 1980
%P 84-86

%A M. Broy
%T Transformational semantics for concurrent programs
%J Information Processing Letters
%K ipl
%V 11
%N 2
%D October 1980
%P 87-91

%A Robert B. Johnson,\ Jr.
%T The complexity of a VLSI adder
%J Information Processing Letters
%K ipl
%V 11
%N 2
%D October 1980
%P 92-93

%A Jacques Calmet
%A Rudiger Loos
%T An improvement of Rabin's probabilistic algorithm
for generating irreducible polynomials over GF(p)
%J Information Processing Letters
%K ipl
%V 11
%N 2
%D October 1980
%P 94-95

%A Charles J. Colbourn
%A Brendan D. McKay
%T A correction to Colbourn's paper on the complexity of matrix symmetrizability
%J Information Processing Letters
%K ipl
%V 11
%N 2
%D October 1980
%P 96-97

%A Paris C. Kanellakis
%T On the computational complexity of cardinality constraints
in relational databases
%J Information Processing Letters
%K ipl
%V 11
%N 2
%D October 1980
%P 98-101

%A E. Luque
%A A. Ripoli
%T Tuning architecture via microprogramming
%J Information Processing Letters
%K ipl
%V 11
%N 2
%D October 1980
%P 102-109

%A Ernst Leiss
%T A note on a signature system based on probabilistic logic
%J Information Processing Letters
%K ipl
%V 11
%N 2
%D October 1980
%P 110-113

%A Joseph Y-T. Leung
%A M.L. Merrill
%T A note on preemptive scheduling of periodic, real-time tasks
%J Information Processing Letters
%K ipl
%V 11
%N 3
%D November 1980
%P 115-118

%A J.M. Robson
%T Storage allocation is NP-hard
%J Information Processing Letters
%K ipl
%V 11
%N 3
%D November 1980
%P 119-125

%A David Avis
%T Comments on a lower bound for convex hull determination
%J Information Processing Letters
%K ipl
%V 11
%N 3
%D November 1980
%P 126

%A Arnaldo Moura
%T A note on grammatical covers
%J Information Processing Letters
%K ipl
%V 11
%N 3
%D November 1980
%P 127-129

%A Thomas A. Bailey
%A R. Geoff Dromey
%T Fast string searching by finding subkeys in subtext
%J Information Processing Letters
%K ipl
%V 11
%N 3
%D November 1980
%P 130-133

%A Francesco Romani
%T Shortest-path problem is not harder than matrix multiplication
%J Information Processing Letters
%K ipl
%V 11
%N 3
%D November 1980
%P 134-136

%A Hannu Erkio
%T Internal merge sorting with delayed selection
%J Information Processing Letters
%K ipl
%V 11
%N 3
%D November 1980
%P 137-140

%A Nachum Dershowitz
%T The Schorr-Waite marking algorithm revisited
%J Information Processing Letters
%K ipl
%V 11
%N 3
%D November 1980
%P 141-143

%A E.B. Kinber
%T On inclusion problem for deterministic multitape automata
%J Information Processing Letters
%K ipl
%V 11
%N 3
%D November 1980
%P 144-146

%A Alfred Laut
%T Safe procedural implementations of algebraic types
%J Information Processing Letters
%K ipl
%V 11
%N 4,5
%D December 1980
%P 147-151

%A J. Paredaens
%A F. Ponsaert
%T Grant levels in an authorization mechanism
%J Information Processing Letters
%K ipl
%V 11
%N 4,5
%D December 1980
%P 152-155

%A Greg N. Frederickson
%T Probabilistic analysis for simple
one- and two-dimensional bin packing algorithms
%J Information Processing Letters
%K ipl
%V 11
%N 4,5
%D December 1980
%P 156-161

%A Oscar H. Ibarra
%A Shlomo Moran
%A Louis E. Rosier
%T A note on the parallel complexity of computing the rank of order n matrices
%J Information Processing Letters
%K ipl
%V 11
%N 4,5
%D December 1980
%P 162

%A David R. Hanson
%T Code improvement via lazy evaluation
%J Information Processing Letters
%K ipl
%V 11
%N 4,5
%D December 1980
%P 163-167

%A J.H. ter\ Bekke
%T Convertibility in databases
%J Information Processing Letters
%K ipl
%V 11
%N 4,5
%D December 1980
%P 168-171

%A Alberto Pettorossi
%T Derivatives of an O(k^2 log n) algorithm for computing
order-k Fibonacci numbers from the O(k^2 log n) matrix multiplication method
%J Information Processing Letters
%K ipl
%V 11
%N 4,5
%D December 1980
%P 172-179

%A M.H. Williams
%T Cubic map configurations
%J Information Processing Letters
%K ipl
%V 11
%N 4,5
%D December 1980
%P 180-185

%A M.H. Williams
%T Batch sizes for the batching method of colouring planar maps
%J Information Processing Letters
%K ipl
%V 11
%N 4,5
%D December 1980
%P 186-189

%A Mila E. Majster-Cederbaum
%T A simple relation between relational and predicate transformer semantics
for nondeterministic programs
%J Information Processing Letters
%K ipl
%V 11
%N 4,5
%D December 1980
%P 190-192

%A Rossella Petreschi
%A Bruno Simeone
%T A switching algorithm for the solution of quadratic boolean equations
%J Information Processing Letters
%K ipl
%V 11
%N 4,5
%D December 1980
%P 193-198

%A R.K. Arora
%A S.P. Rana
%T Heuristic algorithms for process assignment in distributed computing systems
%J Information Processing Letters
%K ipl
%V 11
%N 4,5
%D December 1980
%P 199-203

%A Hiroya Kawai
%T A formal system for parallel programs in discrete time and space
%J Information Processing Letters
%K ipl
%V 11
%N 4,5
%D December 1980
%P 204-210

%A J. ten\ Hoopen
%T Consecutive retrieval with redundancy:
an optimal linear and an optimal cyclic arrangement
and their storage space requirements
%J Information Processing Letters
%K ipl
%V 11
%N 4,5
%D December 1980
%P 211-217

%A Peter Kandzia
%A Margret Mangelmann
%T On covering Boyce-Codd normal forms
%J Information Processing Letters
%K ipl
%V 11
%N 4,5
%D December 1980
%P 218-223

%A Seppo Pajunen
%T On two theorems of Lenstra
%J Information Processing Letters
%K ipl
%V 11
%N 4,5
%D December 1980
%P 224-228

%A Alfons J. Jammel
%A Helmut G. Stiegler
%T On expected costs of deadlock detection
%J Information Processing Letters
%K ipl
%V 11
%N 4,5
%D December 1980
%P 229-231

%A S. Mauceri
%A A. Restivo
%T A family of code commutatively equivalent to prefix codes
%J Information Processing Letters
%K ipl
%V 12
%N 1
%D February 1981
%P 1-4

%A Krzysztof Dudzinski
%A Andrzej Dydek
%T On a stable minimum storage merging algorithm
%J Information Processing Letters
%K ipl
%V 12
%N 1
%D February 1981
%P 5-8

%A Eugene L. Lawler
%A Charles U. Martel
%T Scheduling periodically occurring tasks on multiple processors
%J Information Processing Letters
%K ipl
%V 12
%N 1
%D February 1981
%P 9-12

%A C. Choffrut
%T A closure property of deterministic context-free languages
%J Information Processing Letters
%K ipl
%V 12
%N 1
%D February 1981
%P 13-16

%A Nai-Kuan Tsao
%T The numerical instability of Bini's algorithm
%J Information Processing Letters
%K ipl
%V 12
%N 1
%D February 1981
%P 17-19

%A Harold N. Gabow
%T A linear-type recognition algorithm for interval DAGs
%J Information Processing Letters
%K ipl
%V 12
%N 1
%D February 1981
%P 20-22

%A Dorothy E. Denning
%A Fred B. Schneider
%T Master keys for group sharing
%J Information Processing Letters
%K ipl
%V 12
%N 1
%D February 1981
%P 23-25

%A Eric C.R. Hehner
%T Bunch theory: a simple set theory for computer science
%J Information Processing Letters
%K ipl
%V 12
%N 1
%D February 1981
%P 26-30

%A S.H. Whitesides
%T An algorithm for finding clique sets
%J Information Processing Letters
%K ipl
%V 12
%N 1
%D February 1981
%P 31-32

%A P. Hell
%A D.G. Kirkpatrick
%T On generalized matching problems
%J Information Processing Letters
%K ipl
%V 12
%N 1
%D February 1981
%P 33-35

%A Maurice Bruynooghe
%T Solving combinatorial search problems by intelligent backtracking
%J Information Processing Letters
%K ipl
%V 12
%N 1
%D February 1981
%P 36-39

%A Erroll L. Lloyd
%T Coffman-Graham scheduling of UET task systems with 0-1 resources
%J Information Processing Letters
%K ipl
%V 12
%N 1
%D February 1981
%P 40-45

%A S. Ceri
%A G. Pelagatti
%T An upper bound on the number of execution nodes for a distributed join
%J Information Processing Letters
%K ipl
%V 12
%N 1
%D February 1981
%P 46-48

%A Mark H. Overmars
%A Jan van\ Leeuwen
%T Some principles for dynamizing decomposable searching problems
%J Information Processing Letters
%K ipl
%V 12
%N 1
%D February 1981
%P 49-53

%A M. Hatzopoulos
%A J.G. Kollias
%T Optimal policy for database backup and recovery
%J Information Processing Letters
%K ipl
%V 12
%N 2
%D April 1981
%P 55-58

%A David M. Harland
%T Concurrency in a language employing messages
%J Information Processing Letters
%K ipl
%V 12
%N 2
%D April 1981
%P 59-62

%A Ingemar Ingermarsson
%A C.K. Wong
%T A user authentication scheme for shared data
based on a trap-door one-way function
%J Information Processing Letters
%K ipl
%V 12
%N 2
%D April 1981
%P 63-67

%A J.J. Pansiot
%T The Morse sequence and iterated morphisms
%J Information Processing Letters
%K ipl
%V 12
%N 2
%D April 1981
%P 68-70

%A A. Borodin
%A L.J. Guibas
%A N.A. Lynch
%A A.C. Yao
%T Efficient searching using partial ordering
%J Information Processing Letters
%K ipl
%V 12
%N 2
%D April 1981
%P 71-75

%A C.P. Schnorr
%T How many polynomials can be approximated faster than they can be evaluated ?
%J Information Processing Letters
%K ipl
%V 12
%N 2
%D April 1981
%P 76-78

%A Joxan Jaffar
%T Presburger arithmetic with array segments
%J Information Processing Letters
%K ipl
%V 12
%N 2
%D April 1981
%P 79-82

%A David Steinberg
%A Michael Rodeh
%T A layout for the shuffle-exchange network with Theta(N^2/log N) area
%J Information Processing Letters
%K ipl
%V 12
%N 2
%D April 1981
%P 83-88

%A Yossi Shiloach
%T Another look at the degree constrained subgraph problem
%J Information Processing Letters
%K ipl
%V 12
%N 2
%D April 1981
%P 89-92

%A Kurt Mehlhorn
%A Mark H. Overmars
%T Optimal dynamization of decomposable searching problems
%J Information Processing Letters
%K ipl
%V 12
%N 2
%D April 1981
%P 93-98

%A Mark H. Overmars
%T General methods for "all elements" and "all pairs" problems
%J Information Processing Letters
%K ipl
%V 12
%N 2
%D April 1981
%P 99-102

%A Silvio Micali
%T Two-way deterministic finite automata
are exponentially more succinct than sweeping automata
%J Information Processing Letters
%K ipl
%V 12
%N 2
%D April 1981
%P 103-105

%A Martin Tompa
%T An extension of Savitch's theorem to small space bounds
%J Information Processing Letters
%K ipl
%V 12
%N 2
%D April 1981
%P 106-110

%A Bruno Courcelle
%T The simultaneous accessibility of two configurations of two equivalent DPDA's
%J Information Processing Letters
%K ipl
%V 12
%N 3
%D June 1981
%P 111-114

%A G.L. Peterson
%T Myths about the mutual exclusion problem
%J Information Processing Letters
%K ipl
%V 12
%N 3
%D June 1981
%P 115-116

%A Will Leland
%A Raphael Finkel
%A Li Qiao
%A Marvin Solomon
%A Leonard Uhr
%T High density graphs for processor interconnection
%J Information Processing Letters
%K ipl
%V 12
%N 3
%D June 1981
%P 117-120

%A Ronald V. Book
%T The undecidability of a word problem:
on a conjecture of STring, Maggiolo-Schettini and Rosen
%J Information Processing Letters
%K ipl
%V 12
%N 3
%D June 1981
%P 121-122

%A Gerhard Lischke
%T Two types of properties for complexity measures
%J Information Processing Letters
%K ipl
%V 12
%N 3
%D June 1981
%P 123-126

%A Reinhard Wilhelm
%T A modified tree-to-tree correction problem
%J Information Processing Letters
%K ipl
%V 12
%N 3
%D June 1981
%P 127-132

%A Robert J. Fowler
%A Michael S. Paterson
%A Steven L. Tanimoto
%T Optimal packing and covering in the plane are NP-complete
%J Information Processing Letters
%K ipl
%V 12
%N 3
%D June 1981
%P 133-137

%A Jerry W. Jaromczyk
%T Linear decision trees are too weak for convex hull problem
%J Information Processing Letters
%K ipl
%V 12
%N 3
%D June 1981
%P 138-141

%A Alberto Bertoni
%A Giancarlo Mauri
%T On efficient computation of the coefficients of some polynomials
with applications to some enumeration problems
%J Information Processing Letters
%K ipl
%V 12
%N 3
%D June 1981
%P 142-145

%A W. Erni
%A R. Lapsien
%T On the time and tape complexity of weak unification
%J Information Processing Letters
%K ipl
%V 12
%N 3
%D June 1981
%P 146-150

%A P. Ancilotti
%A M. Boari
%T Information streams sharing a finite buffer: protection problems
%J Information Processing Letters
%K ipl
%V 12
%N 3
%D June 1981
%P 151-159

%A Franco P. Preparata
%A Kenneth J. Supowit
%T Testing a simple polygon for monotonicity
%J Information Processing Letters
%K ipl
%V 12
%N 4
%D August 1981
%P 161-164

%A C.M. Eastman
%T Optimal bucket size for nearest neighbor searching in k-d trees
%J Information Processing Letters
%K ipl
%V 12
%N 4
%D August 1981
%P 165-167

%A Mark H. Overmars
%A Jan van\ Leeuwen
%T Worst-case optimal insertion and deletion methods
for decomposable searching problems
%J Information Processing Letters
%K ipl
%V 12
%N 4
%D August 1981
%P 168-173

%A Ch. Frougny
%T Simple deterministic NTS languages
%J Information Processing Letters
%K ipl
%V 12
%N 4
%D August 1981
%P 174-178

%A Henk Meijer
%T A note on "A cryptosystem for multiple communication"
%J Information Processing Letters
%K ipl
%V 12
%N 4
%D August 1981
%P 179-181

%A Martin E. Hellman
%T Another cryptanalytic attack on "A cryptosystem for multiple communication"
%J Information Processing Letters
%K ipl
%V 12
%N 4
%D August 1981
%P 182-183

%A Th. Ottman
%A A. Salomaa
%A D. Wood
%T Sub-regular grammar forms
%J Information Processing Letters
%K ipl
%V 12
%N 4
%D August 1981
%P 184-187

%A Ichiro Semba
%T Generation of all the balanced parenthesis strings in lexicographical order
%J Information Processing Letters
%K ipl
%V 12
%N 4
%D August 1981
%P 188-192

%A Aldo de\ Luca
%T A combinatorial property of the Fibonacci words
%J Information Processing Letters
%K ipl
%V 12
%N 4
%D August 1981
%P 193-195

%A Eric C.R. Hehner
%A R.K. Shyamasundar
%T An implementation of P and V
%J Information Processing Letters
%K ipl
%V 12
%N 4
%D August 1981
%P 196-198

%A David Maier
%A C. Salveter
%T Hysterical B-trees
%J Information Processing Letters
%K ipl
%V 12
%N 4
%D August 1981
%P 199-202

%A Christos H. Papadimitriou
%A Mihalis Yannakakis
%T On minimal Eulerian graphs
%J Information Processing Letters
%K ipl
%V 12
%N 4
%D August 1981
%P 203-205

%A Masao Iri
%A Kazuro Murota
%A Shouichi Matsui
%T Linear-time approximation algorithms
for finding the minimum-weight perfect matching on a plane
%J Information Processing Letters
%K ipl
%V 12
%N 4
%D August 1981
%P 206-209

%A J. Mauney
%A C.N. Fischer
%T An improvement to immediate error detection in strong LL(1) parsers
%J Information Processing Letters
%K ipl
%V 12
%N 5
%D October 1981
%P 211-212

%A Lloyd K. Konneker
%A Yaakov L. Varol
%T A note on heuristics for dynamic organization of data structures
%J Information Processing Letters
%K ipl
%V 12
%N 5
%D October 1981
%P 213-216

%A M. Snir
%T On the complexity of simplifying quadratic forms
%J Information Processing Letters
%K ipl
%V 12
%N 5
%D October 1981
%P 217-220

%A David M. Harland
%T On facilities for interprocess communication
%J Information Processing Letters
%K ipl
%V 12
%N 5
%D October 1981
%P 221-226

%A Oscar H. Ibarra
%A Shlomo Moran
%A Louis E. Rosier
%T Probabilistic algorithms and straight-line programs
for some rank decision problems
%J Information Processing Letters
%K ipl
%V 12
%N 5
%D October 1981
%P 227-232

%A J.J. Pansiot
%T A note on Post's correspondence problem
%J Information Processing Letters
%K ipl
%V 12
%N 5
%D October 1981
%P 233

%A Wojciech Rytter
%T An effective simulation of deterministic pushdown automata
with many two-way and one-way heads
%J Information Processing Letters
%K ipl
%V 12
%N 5
%D October 1981
%P 234-236

%A Bing-Chao Huang
%T An algorithm for inverting a permutation
%J Information Processing Letters
%K ipl
%V 12
%N 5
%D October 1981
%P 237-238

%A Jozej Winkowski
%T Protocols of accessing overlapping sets of resources
%J Information Processing Letters
%K ipl
%V 12
%N 5
%D October 1981
%P 239-243

%A Max Crochemore
%T An optimal algorithm for computing the repetitions in a word
%J Information Processing Letters
%K ipl
%V 12
%N 5
%D October 1981
%P 244-250

%A M.Y. Vardi
%T The decision problem for database dependencies
%J Information Processing Letters
%K ipl
%V 12
%N 5
%D October 1981
%P 251-254

%A Jurgen Ebert
%T A sensitive transitive closure algorithm
%J Information Processing Letters
%K ipl
%V 12
%N 5
%D October 1981
%P 255-258

%A Osamu Watanabe
%T A fast algorithm for finding all shortest paths
%J Information Processing Letters
%K ipl
%V 13
%N 1
%D October 1981
%P 1-3

%A Gilbert N. Lewis
%A Nancy J. Boynton
%A F. Warren Burton
%T Expected complexity of fast search with uniformly distributed data
%J Information Processing Letters
%K ipl
%V 13
%N 1
%D October 1981
%P 4-7

%A James A. Storer
%T Constructing full spanning trees for cubic graphs
%J Information Processing Letters
%K ipl
%V 13
%N 1
%D October 1981
%P 8-11

%A Oscar H. Ibarra
%A Shlomo Moran
%T Deterministic and probabilistic algorithms
for maximum bipartite matching via fast matrix multiplication
%J Information Processing Letters
%K ipl
%V 13
%N 1
%D October 1981
%P 12-15

%A James F. Korsh
%T Greedy binary search trees are nearly optimal
%J Information Processing Letters
%K ipl
%V 13
%N 1
%D October 1981
%P 16-19

%A Ashok K. Agrawala
%A Satish K. Tripathi
%T On the optimality of semidynamic routing schemes
%J Information Processing Letters
%K ipl
%V 13
%N 1
%D October 1981
%P 20-22

%A K. Ramamohanarao
%A R. Sacks-Davis
%T Hardware address translation for machines with a large virtual memory
%J Information Processing Letters
%K ipl
%V 13
%N 1
%D October 1981
%P 23-29

%A G. Senizergues
%T A new class of CFL for which the equivalence is decidable
%J Information Processing Letters
%K ipl
%V 13
%N 1
%D October 1981
%P 30-34

%A Hamish I.E. Guin
%A David M. Harland
%T Degrees of constancy in programming languages
%J Information Processing Letters
%K ipl
%V 13
%N 1
%D October 1981
%P 35-38

%A Yu.G. Stoyan
%A S.V. Smelyakov
%T An approach to the problems of routing optimization
in the regions of intricate shape
%J Information Processing Letters
%K ipl
%V 13
%N 1
%D October 1981
%P 39-43

%A Mireille Clerbout
%A Michel Latteux
%T The inclusion of D0L in multi-reset
%J Information Processing Letters
%K ipl
%V 13
%N 2
%D November 1981
%P 45-49

%A Robert Hood
%A Robert Melville
%T Real-time queue operations in pure Lisp
%J Information Processing Letters
%K ipl
%V 13
%N 2
%D November 1981
%P 50-54

%A Mikhail J. Atallah
%A S. Rao Kosaraju
%T An adversary-based lower bound for sorting
%J Information Processing Letters
%K ipl
%V 13
%N 2
%D November 1981
%P 55-57

%A Wojciech Rytter
%T The dynamic simulation of recursive and stack manipulating programs
%J Information Processing Letters
%K ipl
%V 13
%N 2
%D November 1981
%P 58-63

%A Mireille Regnier
%T On the average height of trees in digital search and dynamic hashing
%J Information Processing Letters
%K ipl
%V 13
%N 2
%D November 1981
%P 64-66

%A Ysmar V. Silva\ Filho
%T Optimal choice of discriminators in a balanced k-d binary search tree
%J Information Processing Letters
%K ipl
%V 13
%N 2
%D November 1981
%P 67-70

%A V.Ya. Pan
%T The lower bounds on the adaptive complexity of bilinear problems
in terms of some algebraic quantities
%J Information Processing Letters
%K ipl
%V 13
%N 2
%D November 1981
%P 71-72

%A Ronald V. Book
%T NTS grammars and Church-Rosser systems
%J Information Processing Letters
%K ipl
%V 13
%N 2
%D November 1981
%P 73-76

%A Jeffrey Scott Vitter
%T A shared-memory scheme for coalesced hashing
%J Information Processing Letters
%K ipl
%V 13
%N 2
%D November 1981
%P 77-79

%A Akira Nakamura
%T Some remarks on one-pebble rectangular array acceptors
%J Information Processing Letters
%K ipl
%V 13
%N 2
%D November 1981
%P 80-84

%A Shlomo Moran
%T A note on "Is shortest path problem not harder than matrix multiplication ?"
%J Information Processing Letters
%K ipl
%V 13
%N 2
%D November 1981
%P 85-86

%A Francesco Romani
%T Author's reply to S. Moran's note on the shortest path problem
%J Information Processing Letters
%K ipl
%V 13
%N 2
%D November 1981
%P 87

%A Oscar H. Ibarra
%A Louis E. Rosier
%T On the decidability of equivalence for deterministic pushdown transducers
%J Information Processing Letters
%K ipl
%V 13
%N 3
%D December 1981
%P 89-93

%A Hideki Yamasaki
%T On weak persistency of Petri nets
%J Information Processing Letters
%K ipl
%V 13
%N 3
%D December 1981
%P 94-97

%A Tat-hung Chan
%T Deciding freeness for program schemes with a single unary function
%J Information Processing Letters
%K ipl
%V 13
%N 3
%D December 1981
%P 98-102

%A R.H. Barlow
%A D.J. Evans
%A J. Shanehchi
%T A parallel merging algorithm
%J Information Processing Letters
%K ipl
%V 13
%N 3
%D December 1981
%P 103-106

%A Refael Hassin
%T Maximum flow in (s, t) planar networks
%J Information Processing Letters
%K ipl
%V 13
%N 3
%D December 1981
%P 107-113

%A R.S. Bird
%T The jogger's problem
%J Information Processing Letters
%K ipl
%V 13
%N 3
%D December 1981
%P 114-117

%A M.D. Atkinson
%T The cyclic towers of Hanoi
%J Information Processing Letters
%K ipl
%V 13
%N 3
%D December 1981
%P 118-119

%A Donald MacDavid Tolle
%A William E. Siddall
%T On the complexity of vector computations in binary tree machines
%J Information Processing Letters
%K ipl
%V 13
%N 3
%D December 1981
%P 120-124

%A Dorothy E. Denning
%A Henk Meijer
%A Fred B. Schneider
%T More on master keys for group sharing
%J Information Processing Letters
%K ipl
%V 13
%N 3
%D December 1981
%P 125-126

%A J.L.A. van\ de\ Snepscheut
%T Synchronous communication between asynchronous components
%J Information Processing Letters
%K ipl
%V 13
%N 3
%D December 1981
%P 127-130

%A Christos H. Papadimitriou
%A Mihalis Yannakakis
%T The clique problem for planar graphs
%J Information Processing Letters
%K ipl
%V 13
%N 4,5
%D December 1981
%P 131-133

%A Gerhard Barth
%T An alternative for the implementation of the Knuth-Morris-Pratt algorithm
%J Information Processing Letters
%K ipl
%V 13
%N 4,5
%D December 1981
%P 134-137
%K string matching

%A R.H. Davis
%A C. Rinaldi
%A C.J. Trebilcock
%T Data compression in limited capacity microcomputer systems
%J Information Processing Letters
%K ipl
%V 13
%N 4,5
%D December 1981
%P 138-141

%A Wojciech Rytter
%T Time complexity of languages recognized
by one-way multihead pushdown automata
%J Information Processing Letters
%K ipl
%V 13
%N 4,5
%D December 1981
%P 142-144

%A Wojciech Rytter
%T A hardest language recognized by two-way nondeterministic pushdown automata
%J Information Processing Letters
%K ipl
%V 13
%N 4,5
%D December 1981
%P 145-146

%A V.K. Sabelfeld
%T Tree equivalence of linear recursive schemata is polynomial-time decidable
%J Information Processing Letters
%K ipl
%V 13
%N 4,5
%D December 1981
%P 147-153

%A Nathan Goodman
%A Oded Shmueli
%T Limitations of the chase
%J Information Processing Letters
%K ipl
%V 13
%N 4,5
%D December 1981
%P 154-156
%K semijoin

%A Alan A. Bertossi
%T The edge Hamiltonian path problem in NP-complete
%J Information Processing Letters
%K ipl
%V 13
%N 4,5
%D December 1981
%P 157-159

%A L. Siklossy
%T Efficient query evaluation in relational data bases with missing values
%J Information Processing Letters
%K ipl
%V 13
%N 4,5
%D December 1981
%P 160-163

%A M. Blum
%A R.M. Karp
%A O. Vornberger
%A C.H. Papadimitriou
%A M. Yannakakis
%T The complexity of testing whether a graph is a superconcentrator
%J Information Processing Letters
%K ipl
%V 13
%N 4,5
%D December 1981
%P 164-167

%A Jacob T. Schwartz
%T Finding the minimum distance between two convex polygons
%J Information Processing Letters
%K ipl
%V 13
%N 4,5
%D December 1981
%P 168-170

%A M. Ancona
%A V. Gianuzzi
%T A new method for implementing LR(k) tables
%J Information Processing Letters
%K ipl
%V 13
%N 4,5
%D December 1981
%P 171-176

%A H. Edelsbrunner
%A H.A. Maurer
%T On the intersection of orthogonal objects
%J Information Processing Letters
%K ipl
%V 13
%N 4,5
%D December 1981
%P 177-181

%A Akira Nakamura
%A Kunio Aizawa
%T Acceptors for isometric parallel ocntext-free array languages
%J Information Processing Letters
%K ipl
%V 13
%N 4,5
%D December 1981
%P 182-186

%A M.H. Williams
%T A systematic test for extended operator precedence
%J Information Processing Letters
%K ipl
%V 13
%N 4,5
%D December 1981
%P 187-190

%A Hiroto Yasuura
%T Width and depth of combinational logic circuits
%J Information Processing Letters
%K ipl
%V 13
%N 4,5
%D December 1981
%P 191-194

%A Rusins Freivalds
%T Projections of languages recognizable
by probabilistic and alternating finite multitape automata
%J Information Processing Letters
%K ipl
%V 13
%N 4,5
%D December 1981
%P 195-198

%A R.K. Arora
%A N.K. Sharma
%T Guarded procedure: a distributed programming concept
%J Information Processing Letters
%K ipl
%V 13
%N 4,5
%D December 1981
%P 199-203

%A Giovanni Guida
%A Marco Somalvico
%T Multi-problem-solving: knowledge representation and system architecture
%J Information Processing Letters
%K ipl
%V 13
%N 4,5
%D December 1981
%P 204-214

%A Henry S. Warren,\ Jr.
%A A. Shawhan Fox
%A Peter W. Markstein
%T Modulus division on a two's complement machine
%J Information Processing Letters
%K ipl
%V 13
%N 4,5
%D December 1981
%P 215-218

%A J.M. Troya
%A A. Vaquero
%T An approximation algorithm for reducing expected head movement
in linear storage devices
%J Information Processing Letters
%K ipl
%V 13
%N 4,5
%D December 1981
%P 219-220

%A Alfred Schmitt
%T On the computational power of the floor function
%J Information Processing Letters
%K ipl
%V 14
%N 1
%D March 1982
%P 1-3

%A Ben-Zion Chor
%T Arithmetic of finite fields
%J Information Processing Letters
%K ipl
%V 14
%N 1
%D March 1982
%P 4-6

%A Dhruva Nath
%A S.N. Maheshwari
%T Parallel algorithms for the
connected components and minimal spanning tree problems
%J Information Processing Letters
%K ipl
%V 14
%N 1
%D March 1982
%P 7-11

%A Andries E. Brouwer
%A Peter van\ Emde\ Boas
%T A note on "Master keys for group sharing"
%J Information Processing Letters
%K ipl
%V 14
%N 1
%D March 1982
%P 12-14

%A Ronald Backhouse
%T Writing a number as the sum of two squares: a new solution
%J Information Processing Letters
%K ipl
%V 14
%N 1
%D March 1982
%P 15-17

%A Erol Gelenbe
%A Daniele Gardy
%T On the size of projections: I
%J Information Processing Letters
%K ipl
%V 14
%N 1
%D March 1982
%P 18-21

%A Hamish I.E. Gunn
%T Compile time type checking of structure field accessing
%J Information Processing Letters
%K ipl
%V 14
%N 1
%D March 1982
%P 22-25

%A R. Endre Tarjan
%T A hierarchical clustering algorithm using strong components
%J Information Processing Letters
%K ipl
%V 14
%N 1
%D March 1982
%P 26-29

%A Robert Endre Tarjan
%T Sensitivity analysis of minimum spanning trees and shortest path trees
%J Information Processing Letters
%K ipl
%V 14
%N 1
%D March 1982
%P 30-33

%A Jan van\ Leeuwen
%A Maurice Nivat
%T Efficient recognition of rational relations
%J Information Processing Letters
%K ipl
%V 14
%N 1
%D March 1982
%P 34-38

%A Ker-I Ko
%T Some observations on the probabilistic algorithms and NP-hard problems
%J Information Processing Letters
%K ipl
%V 14
%N 1
%D March 1982
%P 39-43

%A Shmuel Zaks
%T Generation and ranking of k-ary trees
%J Information Processing Letters
%K ipl
%V 14
%N 1
%D March 1982
%P 44-48

%A Luis Farinas\ del\ Cerro
%T A simple deduction method for modal logic
%J Information Processing Letters
%K ipl
%V 14
%N 2
%D April 1982
%P 49-51

%A A.O. Slisenko
%T Context-free grammars as a tool
for describing polynomial-time subclasses of hard problems
%J Information Processing Letters
%K ipl
%V 14
%N 2
%D April 1982
%P 52-56

%A Marc H. Graham
%A Alberto O. Mendelzon
%T Strong EVQ of relational expressions under dependencies
%J Information Processing Letters
%K ipl
%V 14
%N 2
%D April 1982
%P 57-62

%A J.C. Lagarias
%A D.E. Swartout
%T Minimal storage representations for binary relations
%J Information Processing Letters
%K ipl
%V 14
%N 2
%D April 1982
%P 63-66

%A Guiseppina Gini
%T The automatic synthesis of iterative programs
%J Information Processing Letters
%K ipl
%V 14
%N 2
%D April 1982
%P 67-73

%A H. Edelsbrunner
%A H.A. Maurer
%A D.G. Kirkpatrick
%T Polygonal intersection searching
%J Information Processing Letters
%K ipl
%V 14
%N 2
%D April 1982
%P 74-79

%A J.A. Bergstra
%A J.-J.Ch. Meyer
%T A simple transfer lemma for algebraic specifications
%J Information Processing Letters
%K ipl
%V 14
%N 2
%D April 1982
%P 80-85

%A Elezer Upfal
%T Formal correctness proofs of a nondeterministic program
%J Information Processing Letters
%K ipl
%V 14
%N 2
%D April 1982
%P 86-92

%A Ludek Kucera
%T Parallel computation and conflicts in memory access
%J Information Processing Letters
%K ipl
%V 14
%N 2
%D April 1982
%P 93-96

%A Takashi Yokomori
%A Derick Wood
%A Klaus-Jorn Lange
%T A three-restricted normal form theorem for ETOL languages
%J Information Processing Letters
%K ipl
%V 14
%N 3
%D May 1982
%P 97-100

%A Jorma Tarhio
%T LR parsing of some ambiguous grammars
%J Information Processing Letters
%K ipl
%V 14
%N 3
%D May 1982
%P 101-103

%A Dietmar Watjen
%A Werner Struckmann
%T An algorithm for verifying equations of morphisms in a category
%J Information Processing Letters
%K ipl
%V 14
%N 3
%D May 1982
%P 104-108

%A K.N. King
%A Barbara Smith-Thomas
%T An optimal algorithm for sink-finding
%J Information Processing Letters
%K ipl
%V 14
%N 3
%D May 1982
%P 109-111

%A J-L. Lassez
%A V.L. Nguyen
%A E.A. Sonenberg
%T Fixed-point theorems and semantics: a folk tale
%J Information Processing Letters
%K ipl
%V 14
%N 3
%D May 1982
%P 112-116

%A R.H. Barlow
%A D.J. Evans
%A J. Shanehchi
%T Parallel multisection for the determination of the eigenvalues
of symmetric quindiagonal matrices
%J Information Processing Letters
%K ipl
%V 14
%N 3
%D May 1982
%P 117-118

%A Johannes Rohrich
%T A hybrid of quicksort with O(n log n) worst case complexity
%J Information Processing Letters
%K ipl
%V 14
%N 3
%D May 1982
%P 119-123

%A Herbert Edelsbrunner
%A Mark H. Overmars
%T On the equivalence of some rectangle problems
%J Information Processing Letters
%K ipl
%V 14
%N 3
%D May 1982
%P 124-127

%A Calvin C. Elgot
%A Alan J. Perlis
%A Lawrence Snyder
%T A syntax-free semantics for the APL operators
%J Information Processing Letters
%K ipl
%V 14
%N 3
%D May 1982
%P 128-131

%A Dzenan Ridjanovic
%A Michael L. Brodie
%T Defining database dynamics with attribute grammars
%J Information Processing Letters
%K ipl
%V 14
%N 3
%D May 1982
%P 132-138

%A James F. Korsh
%T Growing nearly optimal binary search trees
%J Information Processing Letters
%K ipl
%V 14
%N 3
%D May 1982
%P 139-143

%A Durio Bini
%T Reply to the paper "The numerical instability of Bini's algorithm"
%J Information Processing Letters
%K ipl
%V 14
%N 3
%D May 1982
%P 144-145

%A M. Jakobsson
%T Evaluation of a hierarchical bit-vector compression technique
%J Information Processing Letters
%K ipl
%V 14
%N 4
%D June 1982
%P 147-149

%A Jack A. Orenstein
%T Multidimensional tries used for associative searching
%J Information Processing Letters
%K ipl
%V 14
%N 4
%D June 1982
%P 150-157

%A Hiroshi Umeo
%T Nondeterministic one-way simulation
of two-way real-time cellular automata and its related problems
%J Information Processing Letters
%K ipl
%V 14
%N 4
%D June 1982
%P 158-161

%A Giordano Beretta
%T Monte Carlo estimation of numerical stability
in fast algorithms for systems of bilinear forms
%J Information Processing Letters
%K ipl
%V 14
%N 4
%D June 1982
%P 162-167

%A Paul Franchi-Zannettacci
%T An extension to trees of the Sardinas and Patterson algorithm
%J Information Processing Letters
%K ipl
%V 14
%N 4
%D June 1982
%P 168-173

%A R. Demolombe
%T Generalized division for relational algebraic language
%J Information Processing Letters
%K ipl
%V 14
%N 4
%D June 1982
%P 174-178

%A Ernst E. Doberkat
%T Asymptotic estimates for the higher moments
of the expected behaviour of straight insertion sort
%J Information Processing Letters
%K ipl
%V 14
%N 4
%D June 1982
%P 179-182

%A Michael J. Fischer
%A Nancy A. Lynch
%T A lower bounds for the time to assure interactive consistency
%J Information Processing Letters
%K ipl
%V 14
%N 4
%D June 1982
%P 183-186

%A Jiann H. Jou
%A Patrick C. Fischer
%T The complexity of recognizing 3NF relation schemes
%J Information Processing Letters
%K ipl
%V 14
%N 4
%D June 1982
%P 187-190

%A Jack Minker
%A Guy Zanon
%T An extension to linear resolution with selection function
%J Information Processing Letters
%K ipl
%V 14
%N 4
%D June 1982
%P 191-194

%A Clelia de\ Felice
%T On the triangle conjecture
%J Information Processing Letters
%K ipl
%V 14
%N 5
%D July 1982
%P 197-200

%A F. Warren Burton
%T A linear space translation of functional programs to Turner combinators
%J Information Processing Letters
%K ipl
%V 14
%N 5
%D July 1982
%P 201-204

%A F. Warren Burton
%T An efficient functional implementation of FIFO queues
%J Information Processing Letters
%K ipl
%V 14
%N 5
%D July 1982
%P 205-206

%A Anton Nijholt
%T A note on the sufficiency of Sokolowski's criterion
for context-free languages
%J Information Processing Letters
%K ipl
%V 14
%N 5
%D July 1982
%P 207

%A P.G. Reddy
%A Subhash Bhalla
%A B.E. Prasad
%T A model for concurrency control in distributed database systems
%J Information Processing Letters
%K ipl
%V 14
%N 5
%D July 1982
%P 208-213

%A J.G. Shanthikumar
%T A recursive algorithm to generate joint probability distribution of arrivals
from exponential sources during a random time interval
%J Information Processing Letters
%K ipl
%V 14
%N 5
%D July 1982
%P 214-217

%A Johnson M. Hart
%T Permutation inversions and multidimensional cumulative distribution functions
%J Information Processing Letters
%K ipl
%V 14
%N 5
%D July 1982
%P 218-222

%A David A. Carlson
%A John E. Savage
%T Extreme time-space tradeoffs for graphs with small space requirements
%J Information Processing Letters
%K ipl
%V 14
%N 5
%D July 1982
%P 223-227
%K pebble

%A Reuven Bar-Yehuda
%A Uzi Vishkin
%T Complexity of finding k-path-free dominating sets in graphs
%J Information Processing Letters
%K ipl
%V 14
%N 5
%D July 1982
%P 228-232

%A Carla Savage
%T Depth-first search and the vertex cover problem
%J Information Processing Letters
%K ipl
%V 14
%N 5
%D July 1982
%P 233-235

%A F. Luccio
%A L. Pagli
%T A linear algorithm to determine minimal spanning forests in chain graphs
%J Information Processing Letters
%K ipl
%V 15
%N 1
%D August 1982
%P 1-4

%A Wojciech Rytter
%T A note on two-way nondeterministic pushdown automata
%J Information Processing Letters
%K ipl
%V 15
%N 1
%D August 1982
%P 5-9

%A J.-C. Bermond
%A C. Delorme
%A J.-J. Quisquater
%T Tables of large graphs with given degree and diameter
%J Information Processing Letters
%K ipl
%V 15
%N 1
%D August 1982
%P 10-13

%A Larry J. Stockmeyer
%A Vijay V. Vazirani
%T NP-completeness of some generalizations of the maximum matching problem
%J Information Processing Letters
%K ipl
%V 15
%N 1
%D August 1982
%P 14-19

%A C. Bron
%A E.J. Dijkstra
%A S.D. Swierstra
%T A memory-management unit
for the optimal exploitation of a small address space
%J Information Processing Letters
%K ipl
%V 15
%N 1
%D August 1982
%P 20-22

%A C.H.C. Leung
%T Optimal database reorganization: some practical difficulties
%J Information Processing Letters
%K ipl
%V 15
%N 1
%D August 1982
%P 23-27

%A Maciej M. Syslo
%T A labeling algorithm to recognize a line digraph and output its root graph
%J Information Processing Letters
%K ipl
%V 15
%N 1
%D August 1982
%P 28-30

%A Albert C. Greenberg
%A Richard E. Ladner
%A Michael S. Paterson
%A Zvi Galil
%T Efficient parallel algorithms for linear recurrence computation
%J Information Processing Letters
%K ipl
%V 15
%N 1
%D August 1982
%P 31-35

%A Peter M. Winkler
%T On computability of the mean deviation
%J Information Processing Letters
%K ipl
%V 15
%N 1
%D August 1982
%P 36-38

%A Karel Culik,\ II
%A Derick Wood
%T A note on some tree similarity measures
%J Information Processing Letters
%K ipl
%V 15
%N 1
%D August 1982
%P 39-42

%A Leon S. Levy
%T An improved list-searching algorithm
%J Information Processing Letters
%K ipl
%V 15
%N 1
%D August 1982
%P 43-45

%A Glenn K. Manacher
%T Steady-paced-output and fractional-on-line algorithms on a RAM
%J Information Processing Letters
%K ipl
%V 15
%N 2
%D September 1982
%P 47-52

%A C.M. Eastman
%A M. Zemankova
%T Partially specified nearest neighbor searches using k-d trees
%J Information Processing Letters
%K ipl
%V 15
%N 2
%D September 1982
%P 53-56

%A Jean-Pierre Jouannaud
%A Pierre Lescanne
%T On multiset orderings
%J Information Processing Letters
%K ipl
%V 15
%N 2
%D September 1982
%P 57-63

%A T.R. Walsh
%T The towers of Hanoi revisited: moving the rings by counting the moves
%J Information Processing Letters
%K ipl
%V 15
%N 2
%D September 1982
%P 64-67

%A Michael G. Main
%T Permutations are not context-free: an application of the interchange lemma
%J Information Processing Letters
%K ipl
%V 15
%N 2
%D September 1982
%P 68-71

%A Allen Goldberg
%A Paul Purdom
%A Cynthia Brown
%T Average time analyses of simplified David-Putnam procedures
%J Information Processing Letters
%K ipl
%V 15
%N 2
%D September 1982
%P 72-75

%A Leon Lukaszewicz
%T Universal grammars
%J Information Processing Letters
%K ipl
%V 15
%N 2
%D September 1982
%P 76-80

%A Ingo Wegener
%T Best possible asymptotic bounds
on the depth of monotone functions in multivalued logic
%J Information Processing Letters
%K ipl
%V 15
%N 2
%D September 1982
%P 81-83

%A J.L. Balcazar
%A J. Diaz
%T A note on a theorem by Ladner
%J Information Processing Letters
%K ipl
%V 15
%N 2
%D September 1982
%P 84-86

%A Amir Schoor
%T Fast algorithm for sparse linear matrix multiplication
%J Information Processing Letters
%K ipl
%V 15
%N 2
%D September 1982
%P 87-89

%A Michael Spyratos
%T A homomorphism theorem for data base mappings
%J Information Processing Letters
%K ipl
%V 15
%N 3
%D October 1982
%P 91-96

%A Anton Nijholt
%T On the relationship between the LL(k) and LR(k) grammars
%J Information Processing Letters
%K ipl
%V 15
%N 3
%D October 1982
%P 97-101

%A Wojciech Rytter
%T Time complexity of unambiguous path systems
%J Information Processing Letters
%K ipl
%V 15
%N 3
%D October 1982
%P 102-104

%A P.G. Reddy
%A S. Bhalla
%A B.E. Prasad
%T Robust, centralized certifier based concurrency control
for distributed databases
%J Information Processing Letters
%K ipl
%V 15
%N 3
%D October 1982
%P 105-110

%A Waldemar Korczynski
%A Jozef Winkowski
%T A communication concept for distributed systems
%J Information Processing Letters
%K ipl
%V 15
%N 3
%D October 1982
%P 111-114

%A To-Yat Cheung
%T A statistical model for estimating the number of records
in a relational database
%J Information Processing Letters
%K ipl
%V 15
%N 3
%D October 1982
%P 115-118

%A Teofilo F. Gonzalez
%A Donald B. Johnson
%T Sorting numbers in linear expected time and optimal extra space
%J Information Processing Letters
%K ipl
%V 15
%N 3
%D October 1982
%P 119-124

%A Hiroshi Imai
%T Finding connected components of an intersection graph of squares
in the Euclidean plane
%J Information Processing Letters
%K ipl
%V 15
%N 3
%D October 1982
%P 125-128

%A Edgser W. Dijkstra
%A A.J.M. van\ Gasteren
%T An introduction to three algorithms for sorting in situ
%J Information Processing Letters
%K ipl
%V 15
%N 3
%D October 1982
%P 129-134

%A M. Becker
%A W. Degenhardt
%A J. Doenhardt
%A S. Hartel
%A G. Kaninke
%A W. Keber
%A K. Mehlhorn
%A S. Naher
%A H. Rohnert
%A T. Winter
%T A probabilistic algorithm for vertex connectivity of graphs
%J Information Processing Letters
%K ipl
%V 15
%N 3
%D October 1982
%P 135-136

%A F. Lockwood Morris
%T Another compacting garbage collector
%J Information Processing Letters
%K ipl
%V 15
%N 4
%D October 1982
%P 139-142

%A J.A. Bergstra
%A J.V. Tucker
%T Two theorems about the completeness of Hoare's logic
%J Information Processing Letters
%K ipl
%V 15
%N 4
%D October 1982
%P 143-149

%A Jan Maluszynski
%A Jorgen Fischer Nilsson
%T Grammatical unification
%J Information Processing Letters
%K ipl
%V 15
%N 4
%D October 1982
%P 150-158

%A A. Wlodzimierz Mostowski
%T Determinacy of sinking automata on infinite trees
and inequalities between various Rabin's pair indices
%J Information Processing Letters
%K ipl
%V 15
%N 4
%D October 1982
%P 159-163

%A Katsushi Inoue
%A Itsuo Takanami
%A Hiroshi Taniguchi
%T A note on alternating on-line Turing machines
%J Information Processing Letters
%K ipl
%V 15
%N 4
%D October 1982
%P 164-168

%A Mamoru Hoshi
%A Toshitsugu Yuba
%T A counter example to a monotonicity property of k-d trees
%J Information Processing Letters
%K ipl
%V 15
%N 4
%D October 1982
%P 169-173

%A S. Ceri
%A G. Pelagatti
%T A solution method for the non-additive resource allocation problem
in distributed system design
%J Information Processing Letters
%K ipl
%V 15
%N 4
%D October 1982
%P 174-178

%A L. Goh
%A D. Rotem
%T Recognition of perfect elimination bipartite graphs
%J Information Processing Letters
%K ipl
%V 15
%N 4
%D October 1982
%P 179-182

%A Micha Sharir
%T Fast composition of sparse maps
%J Information Processing Letters
%K ipl
%V 15
%N 4
%D October 1982
%P 183-185

%A Peter J. Slater
%T A linear algorithm for the number of degree constrained subforests of a tree
%J Information Processing Letters
%K ipl
%V 15
%N 4
%D October 1982
%P 186-188

%A Timo Leipala
%T On optimal multilevel indexed sequential files
%J Information Processing Letters
%K ipl
%V 15
%N 5
%D December 1982
%P 191-195

%A P.T. Highnam
%T The ears of a polygon
%J Information Processing Letters
%K ipl
%V 15
%N 5
%D December 1982
%P 196-198

%A Andrzej Szepietowski
%T A finite 5-pebble-automaton can search every maze
%J Information Processing Letters
%K ipl
%V 15
%N 5
%D December 1982
%P 199-204

%A Lutz M. Wegner
%T Sorting a linked list with equal keys
%J Information Processing Letters
%K ipl
%V 15
%N 5
%D December 1982
%P 205-208

%A George S. Lueker
%A Dan E. Willard
%T A data structure for dynamic range queries
%J Information Processing Letters
%K ipl
%V 15
%N 5
%D December 1982
%P 209-213

%A Tatsuya Motoki
%T A note on upper bounds for the selection problem
%J Information Processing Letters
%K ipl
%V 15
%N 5
%D December 1982
%P 214-219

%A Harry R. Lewis
%A Richard Statman
%T Unifiability is complete for co-NlogSpace
%J Information Processing Letters
%K ipl
%V 15
%N 5
%D December 1982
%P 220-222

%A Patrick Shen-pei Wang
%T A new hierarchy of two-dimensional array languages
%J Information Processing Letters
%K ipl
%V 15
%N 5
%D December 1982
%P 223-226

%A Markku Tamminen
%T Extendible hashing with overflow
%J Information Processing Letters
%K ipl
%V 15
%N 5
%D December 1982
%P 227-232

%A Quentin E. Stout
%T Drawing straight lines with a pyramid cellular automaton
%J Information Processing Letters
%K ipl
%V 15
%N 5
%D December 1982
%P 233-237

%A Arthur M. Farley
%A Andrzej Proskurowski
%T Directed maximal-cut problems
%J Information Processing Letters
%K ipl
%V 15
%N 5
%D December 1982
%P 238-242

%A Friedhelm Meyer\ auf\ der\ Heide
%T Infinite cube-connected cycles
%J Information Processing Letters
%K ipl
%V 16
%N 1
%D January 1983
%P 1-2

%A Alan A. Bertossi
%A Maurizio A. Bonuccelli
%T Preemptive scheduling of periodic jobs in uniform multiprocessor systems
%J Information Processing Letters
%K ipl
%V 16
%N 1
%D January 1983
%P 3-6

%A A. Ehrenfeucht
%A G. Rozenberg
%T On the subword complexity of locally catenative DOL languages
%J Information Processing Letters
%K ipl
%V 16
%N 1
%D January 1983
%P 7-9

%A Vitit Kantabutra
%T Traveling salesman cycles are not always subgraphs of Voronoi duals
%J Information Processing Letters
%K ipl
%V 16
%N 1
%D January 1983
%P 11-12

%A Ronald Fagin
%A Moshe Y. Vardi
%T Armstrong databases for functional and inclusion dependencies
%J Information Processing Letters
%K ipl
%V 16
%N 1
%D January 1983
%P 13-19

%A Aarni Perko
%T A representation of disjoint sets with fast initialization
%J Information Processing Letters
%K ipl
%V 16
%N 1
%D January 1983
%P 21

%A Kenneth L. Clarkson
%T A modification of the greedy algorithm for vertex cover
%J Information Processing Letters
%K ipl
%V 16
%N 1
%D January 1983
%P 23-25

%A Michel Latteuz
%T On a language without star
%J Information Processing Letters
%K ipl
%V 16
%N 1
%D January 1983
%P 27-30

%A Yves Metivier
%T About rewriting systems produced by the Knuth-Bendix completion algorithm
%J Information Processing Letters
%K ipl
%V 16
%N 1
%D January 1983
%P 31-34

%A Ralf Hartmut Guting
%T Stabbing C-oriented polygons
%J Information Processing Letters
%K ipl
%V 16
%N 1
%D January 1983
%P 35-40

%A Ingo Wegener
%T Relating monotone formula size and monotone depth of boolean functions
%J Information Processing Letters
%K ipl
%V 16
%N 1
%D January 1983
%P 41-42

%A Lewis Neale Lester
%T Accuracy of approximating queueing network departure processes
with independent renewal processes
%J Information Processing Letters
%K ipl
%V 16
%N 1
%D January 1983
%P 43-48

%A Joanna Jedrzejowicz
%T On the enlargement of the class of regular languages
by the shuffle closure
%J Information Processing Letters
%K ipl
%V 16
%N 2
%D February 1983
%P 51-54

%A Juris Hartmanis
%T On sparse sets in NP-P
%J Information Processing Letters
%K ipl
%V 16
%N 2
%D February 1983
%P 55-60

%A Lloyd Allison
%T Stable marriages by coroutines
%J Information Processing Letters
%K ipl
%V 16
%N 2
%D February 1983
%P 61-65

%A Christopher W. Fraser
%T A generalization of two code ordering optimizations
%J Information Processing Letters
%K ipl
%V 16
%N 2
%D February 1983
%P 67-70

%A Stefan Eichholz
%T Optimal networks for distributing nonsequential programs
%J Information Processing Letters
%K ipl
%V 16
%N 2
%D February 1983
%P 71-74

%A Bernard Chazelle
%T A decision procedure for optimal polyhedron partitioning
%J Information Processing Letters
%K ipl
%V 16
%N 2
%D February 1983
%P 75-78

%A Bowen Alpern
%A Fred B. Schneider
%T Key exchange using keyless cryptography
%J Information Processing Letters
%K ipl
%V 16
%N 2
%D February 1983
%P 79-81

%A Micha Hofri
%T Should the two-headed disk be greedy ? - yes, it should
%J Information Processing Letters
%K ipl
%V 16
%N 2
%D February 1983
%P 83-85

%A Dan Gusfield
%T Connectivity and edge disjoint spanning trees
%J Information Processing Letters
%K ipl
%V 16
%N 2
%D February 1983
%P 87-89

%A T.R. Walsh
%T Iteration strikes back - at the cyclic towers of Hanoi
%J Information Processing Letters
%K ipl
%V 16
%N 2
%D February 1983
%P 91-93

%A T. Ibaraki
%A N. Katoh
%T On-line computation of iterative closures of graphs
%J Information Processing Letters
%K ipl
%V 16
%N 2
%D February 1983
%P 95-97

%A Christopher Wood
%A Eduardo B. Fernandez
%A Tomas Lang
%T Minimization of demand paging for the LRU stack model of program behavior
%J Information Processing Letters
%K ipl
%V 16
%N 2
%D February 1983
%P 99-104

%A Robert L. Constable
%T Programs as proofs: a synopsis
%J Information Processing Letters
%K ipl
%V 16
%N 3
%D April 1983
%P 105-112

%A Robert J. McGlinn
%T Is SSS* better than alpha-beta ?
%J Information Processing Letters
%K ipl
%V 16
%N 3
%D April 1983
%P 113-120

%A Eljas Soisalon-Soininen
%T On computing approximate convex hulls
%J Information Processing Letters
%K ipl
%V 16
%N 3
%D April 1983
%P 121-126

%A Wojciech Rytter
%T Time complexity of loop-free two-way pushdown automata
%J Information Processing Letters
%K ipl
%V 16
%N 3
%D April 1983
%P 127-129

%A Markku Tamminen
%T Analysis of N-trees
%J Information Processing Letters
%K ipl
%V 16
%N 3
%D April 1983
%P 131-137

%A Toshitsugu Yuba
%A Yoshinori Yamaguchi
%A Toshio Shimada
%T A control mechanism of a Lisp-based data-driven machine
%J Information Processing Letters
%K ipl
%V 16
%N 3
%D April 1983
%P 139-143

%A Rakesh Agrawal
%A David J. Dewitt
%T Updating hypothetical data bases
%J Information Processing Letters
%K ipl
%V 16
%N 3
%D April 1983
%P 145-146

%A I.K. Rystsov
%T Polynomial complete problems in automata theory
%J Information Processing Letters
%K ipl
%V 16
%N 3
%D April 1983
%P 147-151

%A Marco A. Casanova
%T The theory of functional and subset dependencies over relational expressions
%J Information Processing Letters
%K ipl
%V 16
%N 3
%D April 1983
%P 153-160

%A J.L. Deleage
%T An application of a transfer lemma
%J Information Processing Letters
%K ipl
%V 16
%N 4
%D May 1983
%P 161-163

%A Stefan Hertel
%T Smoothsort's behavior on presorted sequences
%J Information Processing Letters
%K ipl
%V 16
%N 4
%D May 1983
%P 165-170

%A Greg B. Frederickson
%T Scheduling unit-time tasks with integer release time and deadlines
%J Information Processing Letters
%K ipl
%V 16
%N 4
%D May 1983
%P 171-173

%A Errol L. Lloyd
%T On a simple deadlock recovery problem
%J Information Processing Letters
%K ipl
%V 16
%N 4
%D May 1983
%P 175-178

%A Max Crochemore
%A Michel Le\ Rest
%A Philippe Wendler
%T An optimal test on finite unavoidable sets of words
%J Information Processing Letters
%K ipl
%V 16
%N 4
%D May 1983
%P 179-180

%A Chee K. Yap
%T A hybrid algorithm for the shortest path between two nodes
in the presence of few negative arcs
%J Information Processing Letters
%K ipl
%V 16
%N 4
%D May 1983
%P 181-182

%A Takaso Tsuda
%A Takashi Sato
%A Takaaki Tatsumi
%T Generalization of Floyd's model
on permuting information in idealized two-level storage
%J Information Processing Letters
%K ipl
%V 16
%N 4
%D May 1983
%P 183-188

%A Masanori Fushimi
%T Increasing the orders of equidistribution
of the leading bits of the Tausworthe sequence
%J Information Processing Letters
%K ipl
%V 16
%N 4
%D May 1983
%P 189-192

%A Bernard Chazelle
%T An improved algorithm for the fixed-radius neighbor problem
%J Information Processing Letters
%K ipl
%V 16
%N 4
%D May 1983
%P 193-198

%A Wojciech Rytter
%T A simulation result for two-way pushdown automata
%J Information Processing Letters
%K ipl
%V 16
%N 4
%D May 1983
%P 199-202

%A A. Bossi
%A N. Cocco
%A L. Colussi
%T A divide-and-conquer approach to general context-free parsing
%J Information Processing Letters
%K ipl
%V 16
%N 4
%D May 1983
%P 203-208

%A Uwe Schoning
%T On the structure of Delta(P,2)
%J Information Processing Letters
%K ipl
%V 16
%N 4
%D May 1983
%P 209-211

%A Edsger W. Dijkstra
%A W.H.J. Feijen
%A A.J.M. van\ Gasteren
%T Derivation of a termination detection algorithm for distributed computations
%J Information Processing Letters
%K ipl
%V 16
%N 5
%D June 1983
%P 217-219

%A Andrzej Duda
%T The effects of checkpointing on program execution time
%J Information Processing Letters
%K ipl
%V 16
%N 5
%D June 1983
%P 221-229

%A Arturo Carpi
%T On the size of a square-free morphism on a three letter alphabet
%J Information Processing Letters
%K ipl
%V 16
%N 5
%D June 1983
%P 231-235

%A F. Murtagh
%T Expected-time complexity results for hierarchic clustering algorithms
which use cluster centres
%J Information Processing Letters
%K ipl
%V 16
%N 5
%D June 1983
%P 237-241

%A Kazumasa Ozawa
%T Considerations on the similarity measures between index terms
%J Information Processing Letters
%K ipl
%V 16
%N 5
%D June 1983
%P 243-246

%A Jacques Cohen
%T A note on a fast algorithm for sparse matrix multiplication
%J Information Processing Letters
%K ipl
%V 16
%N 5
%D June 1983
%P 247-248

%A John Zahorjan
%A Barbara J. Bell
%A Kenneth C. Sevcik
%T Estimating block transfers when record access probabilities are non-uniform
%J Information Processing Letters
%K ipl
%V 16
%N 5
%D June 1983
%P 249-252

%A Robert Endre Tarjan
%T Updating a balanced search tree in O(1) rotations
%J Information Processing Letters
%K ipl
%V 16
%N 5
%D June 1983
%P 253-257

%A H.P. Kriegel
%A Y.S. Kwong
%T Insertion-safeness in balanced trees
%J Information Processing Letters
%K ipl
%V 16
%N 5
%D June 1983
%P 259-264

%A Rudolf Freund
%T Init and Anf operating on omega-languages
%J Information Processing Letters
%K ipl
%V 16
%N 5
%D June 1983
%P 265-269

%A M.C. Er
%T Computing sums of order-k Fibonacci numbers in log time
%J Information Processing Letters
%K ipl
%V 17
%N 1
%D July 1983
%P 1-5

%A Michael Willett
%T Trapdoor knapsack without super-increasing structure
%J Information Processing Letters
%K ipl
%V 17
%N 1
%D July 1983
%P 7-11

%A F. Cesarini
%A G. Soda
%T An algorithm to construct a compact B-tree in case of ordered keys
%J Information Processing Letters
%K ipl
%V 17
%N 1
%D July 1983
%P 13-16

%A Ronald C. Richards
%T Shape distribution of height-balanced trees
%J Information Processing Letters
%K ipl
%V 17
%N 1
%D July 1983
%P 17-20

%A Henry R. Tirri
%T Simulation, reduction and preservation
of correctness properties of parallel systems
%J Information Processing Letters
%K ipl
%V 17
%N 1
%D July 1983
%P 21-27

%A Manfred Broy
%T Denotational semantics of communicating processes
based on a language for applicative multiprogramming
%J Information Processing Letters
%K ipl
%V 17
%N 1
%D July 1983
%P 29-35

%A Robert E. Tarjan
%T An improved algorithm for hierarchical clustering using strong components
%J Information Processing Letters
%K ipl
%V 17
%N 1
%D July 1983
%P 37-41

%A S.P. Rana
%T A distributed solution of the distributed termination problem
%J Information Processing Letters
%K ipl
%V 17
%N 1
%D July 1983
%P 43-46

%A M.H. Williams
%T Is an exit statement sufficient ?
%J Information Processing Letters
%K ipl
%V 17
%N 1
%D July 1983
%P 47-51

%A Cornelius Croitoru
%A Emilian Suditu
%T Perfect stables in graphs
%J Information Processing Letters
%K ipl
%V 17
%N 1
%D July 1983
%P 53-56

%A Jerzy R. Nawrocki
%T Contiguous segmentation with limited compacting
%J Information Processing Letters
%K ipl
%V 17
%N 2
%D August 1983
%P 57-62

%A Michael J. Magazine
%T Optimality of intuitive checkpointing problems
%J Information Processing Letters
%K ipl
%V 17
%N 2
%D August 1983
%P 63-66

%A Man-tak Shing
%T Optimum ordered bi-weighted binary trees
%J Information Processing Letters
%K ipl
%V 17
%N 2
%D August 1983
%P 67-70

%A Jozef Vyskoc
%T A note on the power of integer division
%J Information Processing Letters
%K ipl
%V 17
%N 2
%D August 1983
%P 71-72

%A Po Tong
%A E.L. Lawler
%T A faster algorithm for finding edge-disjoint branches
%J Information Processing Letters
%K ipl
%V 17
%N 2
%D August 1983
%P 73-76

%A Adi Shamir
%T Embedding cryprographic trapdoors in arbitrary knapsack systems
%J Information Processing Letters
%K ipl
%V 17
%N 2
%D August 1983
%P 77-79

%A Dan E. Willard
%T Log-logarithmic worst-case queries are possible in space PSI(N)
%J Information Processing Letters
%K ipl
%V 17
%N 2
%D August 1983
%P 81-84

%A Youichi Kobuchi
%T Stability of desynchronized 0L systems
%J Information Processing Letters
%K ipl
%V 17
%N 2
%D August 1983
%P 85-90

%A Paul De\ Bra
%A Jan Paredaens
%T An algorithm for horizontal decompositions
%J Information Processing Letters
%K ipl
%V 17
%N 2
%D August 1983
%P 91-95

%A Alan A. Bertossi
%T Finding Hamiltonian circuits in proper interval groups
%J Information Processing Letters
%K ipl
%V 17
%N 2
%D August 1983
%P 97-101

%A Amir Schorr
%T Physical parallel devices are not much faster than sequential ones
%J Information Processing Letters
%K ipl
%V 17
%N 2
%D August 1983
%P 103-106

%A Johannes J. Martin
%T Precise typing and filters
%J Information Processing Letters
%K ipl
%V 17
%N 3
%D October 1983
%P 109-112

%A Luis Farinas
%T Space as time
%J Information Processing Letters
%K ipl
%V 17
%N 3
%D October 1983
%P 113-115

%A Vladimir Lifschitz
%A Leon Pesotchinsky
%T A note on the complexity of a partition algorithm
%J Information Processing Letters
%K ipl
%V 17
%N 3
%D October 1983
%P 117-120

%A A. Ehrenfeucht
%A G. Rozenberg
%T On the subword complexity of m-free D0L languages
%J Information Processing Letters
%K ipl
%V 17
%N 3
%D October 1983
%P 121-124

%A Sven Skyum
%T A measure in which boolean negation is exponentially powerful
%J Information Processing Letters
%K ipl
%V 17
%N 3
%D October 1983
%P 125-128

%A Mark Weiser
%T Reconstructing sequential behavior from parallel behavior projections
%J Information Processing Letters
%K ipl
%V 17
%N 3
%D October 1983
%P 129-135

%A Takashi Yokomori
%A Aravind K. Joshi
%T Semi-linearity, Parikh-boundedness and tree adjunct languages
%J Information Processing Letters
%K ipl
%V 17
%N 3
%D October 1983
%P 137-143

%A Gadiel Seroussi
%A Fai Ma
%T On the arithmetic complexity of matrix Kronecker powers
%J Information Processing Letters
%K ipl
%V 17
%N 3
%D October 1983
%P 145-148

%A C. Choffrut
%A K. Culik,\ II
%T Folding of the plane and the design of systolic arrays
%J Information Processing Letters
%K ipl
%V 17
%N 3
%D October 1983
%P 149-153

%A Ali Mili
%T Verifying programs by induction on their data structure:
general format and applications
%J Information Processing Letters
%K ipl
%V 17
%N 3
%D October 1983
%P 155-160

%A Piotr Wyrostek
%T On the "correct prefix property" in precedence parsers
%J Information Processing Letters
%K ipl
%V 17
%N 3
%D October 1983
%P 161-165

%A Zhi-Jie Zheng
%T The Duodirun merging algorithm: a new fast algorithm for parallel merging
%J Information Processing Letters
%K ipl
%V 17
%N 3
%D October 1983
%P 167-168

%A M.H. Williams
%T The problem of absolute privacy
%J Information Processing Letters
%K ipl
%V 17
%N 3
%D October 1983
%P 169-171

%A W.F. Clocksin
%T Real-time functional queue operations using the logical variable
%J Information Processing Letters
%K ipl
%V 17
%N 4
%D November 1983
%P 173-175

%A John J. Bartholdi,\ III
%A Loren K. Platzman
%T A fast heuristic based on spacefilling curves
for minimum-weight matching in the plane
%J Information Processing Letters
%K ipl
%V 17
%N 4
%D November 1983
%P 177-180

%A Erkki Makinen
%T Boundedness testing for unambiguous context-free grammars
%J Information Processing Letters
%K ipl
%V 17
%N 4
%D November 1983
%P 181-183

%A Oded Shmueli
%T Dynamic cycle detection
%J Information Processing Letters
%K ipl
%V 17
%N 4
%D November 1983
%P 185-188

%A S. Ramesh
%A S.L. Mehndiratta
%T The liveness property of on-the-fly garbage collector - a proof
%J Information Processing Letters
%K ipl
%V 17
%N 4
%D November 1983
%P 189-195

%A Anil R. Gangoli
%A Steven L. Tanimoto
%T Two pyramid machine algorithms for edge detection in noisy binary images
%J Information Processing Letters
%K ipl
%V 17
%N 4
%D November 1983
%P 197-202

%A Norbert Blum
%T A note on the "parallel computation thesis"
%J Information Processing Letters
%K ipl
%V 17
%N 4
%D November 1983
%P 203-205

%A Mikhail J. Atallah
%T A linear time algorithm for the Hausdorff distance between convex polygons
%J Information Processing Letters
%K ipl
%V 17
%N 4
%D November 1983
%P 207-209

%A Brian H. Mayoh
%T Models of programs and processes
%J Information Processing Letters
%K ipl
%V 17
%N 4
%D November 1983
%P 211-214

%A Clemes Lautemann
%T BPP and the polynomial hierarchy
%J Information Processing Letters
%K ipl
%V 17
%N 4
%D November 1983
%P 215-217

%A Leo J. Guibas
%A Jorge Stolfi
%T On computing all north-east nearest neighbors in the L1 metric
%J Information Processing Letters
%K ipl
%V 17
%N 4
%D November 1983
%P 219-223

%A Teruo Hikita
%T Listing and counting subtrees of equal size of a binary tree
%J Information Processing Letters
%K ipl
%V 17
%N 4
%D November 1983
%P 225-229

%A J.S. Rohl
%T A faster lexicographical N queens algorithm
%J Information Processing Letters
%K ipl
%V 17
%N 5
%D December 1983
%P 231-233

%A Yao-Tin Yu
%A Mohamed G. Gouda
%T Unboundedness detection for a class of communicating finite-state machines
%J Information Processing Letters
%K ipl
%V 17
%N 5
%D December 1983
%P 235-240

%A Eugene W. Myers
%T An applicative random-access stack
%J Information Processing Letters
%K ipl
%V 17
%N 5
%D December 1983
%P 241-248

%A Michael J. Fisher
%A Michael S. Paterson
%T Storage requirements for fair scheduling
%J Information Processing Letters
%K ipl
%V 17
%N 5
%D December 1983
%P 249-250

%A Seiichi Nishihara
%A Katsuo Ikeda
%T Address calculation algorithms for ordered sets of combinations
%J Information Processing Letters
%K ipl
%V 17
%N 5
%D December 1983
%P 251-253

%A David T. Barnard
%T Recursive descent parsing
using implementation languages requiring definition before use
%J Information Processing Letters
%K ipl
%V 17
%N 5
%D December 1983
%P 255-258

%A Tetsuo Ida
%T Some FP algebra with currying operation
%J Information Processing Letters
%K ipl
%V 17
%N 5
%D December 1983
%P 259-261

%A Reiner Kolla
%T Where-oblivious is not sufficient
%J Information Processing Letters
%K ipl
%V 17
%N 5
%D December 1983
%P 263-268

%A Yung H. Tsin
%A Francis Y. Chin
%T A general program scheme for finding bridges
%J Information Processing Letters
%K ipl
%V 17
%N 5
%D December 1983
%P 269-272

%A Hitohisa Asai
%T A consideration of a practical implementation for a new convergence division
%J Information Processing Letters
%K ipl
%V 17
%N 5
%D December 1983
%P 273-281

%A V.N. Kasyanov
%T Loop cleaning
%J Information Processing Letters
%K ipl
%V 18
%N 1
%D January 1984
%P 1-6

%A Jan Magott
%T Performance evaluation of concurrent systems using Petri nets
%J Information Processing Letters
%K ipl
%V 18
%N 1
%D January 1984
%P 7-13

%A A. Saoudi
%T Infinitary tree languages recognized by omega-automata
%J Information Processing Letters
%K ipl
%V 18
%N 1
%D January 1984
%P 15-19

%A Hans-Jorg Kreowski
%A Grzegorz Rozenberg
%T Note on node-rewriting graph grammars
%J Information Processing Letters
%K ipl
%V 18
%N 1
%D January 1984
%P 21-24

%A Neil C. Rowe
%T Diophantine inference on a statistical database
%J Information Processing Letters
%K ipl
%V 18
%N 1
%D January 1984
%P 25-31

%A Rodney W. Topor
%T Termination detection for distributed computations
%J Information Processing Letters
%K ipl
%V 18
%N 1
%D January 1984
%P 33-36

%A Mikhail J. Atallah
%T Parallel strong orientation of an undirected graph
%J Information Processing Letters
%K ipl
%V 18
%N 1
%D January 1984
%P 37-39

%A Francis Chin
%A Cao An Wang
%T Minimum vertex distance between separable convex polygons
%J Information Processing Letters
%K ipl
%V 18
%N 1
%D January 1984
%P 41-45

%A Xiaolong Jin
%T Large processors are good in VLSI chips
%J Information Processing Letters
%K ipl
%V 18
%N 1
%D January 1984
%P 47-49

%A Eiji Yodogawa
%T A note on array grammars
%J Information Processing Letters
%K ipl
%V 18
%N 1
%D January 1984
%P 51-54

%A Robert Geist
%T Perception-based configuration design of computer systems
%J Information Processing Letters
%K ipl
%V 18
%N 1
%D January 1984
%P 55-57

%A M.E. Dyer
%A A.M. Freeze
%T A partitioning algorithm for minimum weighted Euclidean matching
%J Information Processing Letters
%K ipl
%V 18
%N 2
%D February 1984
%P 59-62

%A M. Elizabeth C. Hull
%T A parallel view of stable marriages
%J Information Processing Letters
%K ipl
%V 18
%N 2
%D February 1984
%P 63-66

%A Jan Schlorer
%T Insecurity of set controls for statistical databases
%J Information Processing Letters
%K ipl
%V 18
%N 2
%D February 1984
%P 67-71

%A Russell Turpin
%A Brian A. Coan
%T Extending binary Byzantine agreement to multivalued Byzantine agreement
%J Information Processing Letters
%K ipl
%V 18
%N 2
%D February 1984
%P 73-76

%A Leszek Holenderski
%T A note on specifying and verifying concurrent processes
%J Information Processing Letters
%K ipl
%V 18
%N 2
%D February 1984
%P 77-85

%A Hirofumi Katsuno
%T When do non-conflict-free multivalued dependency sets appear
%J Information Processing Letters
%K ipl
%V 18
%N 2
%D February 1984
%P 87-92

%A Heung-Seon Ihm
%A Simeon C. Ntafos
%T On legal path problems in digraphs
%J Information Processing Letters
%K ipl
%V 18
%N 2
%D February 1984
%P 93-98

%A F. Scarioni
%A H.G. Speranza
%T A probabilistic analysis of an error-correcting algorithm
for the towers of Hanoi puzzle
%J Information Processing Letters
%K ipl
%V 18
%N 2
%D February 1984
%P 99-103

%A Satoru Miyano
%T Remarks on two-way automata with weak-counters
%J Information Processing Letters
%K ipl
%V 18
%N 2
%D February 1984
%P 105-107

%A C.C. Lee
%A D.T. Lee
%T On a circle-cover minimization problem
%J Information Processing Letters
%K ipl
%V 18
%N 2
%D February 1984
%P 109-115

%A Herbert S. Wilf
%T Backtrack: an O(1) expected time algorithm for the graph coloring problem
%J Information Processing Letters
%K ipl
%V 18
%N 3
%D March 1984
%P 119-121

%A Eitan Zemel
%T An O(n) algorithm for the linear multiple choice knapsack problem
and related problems
%J Information Processing Letters
%K ipl
%V 18
%N 3
%D March 1984
%P 123-128

%A Peter Moller-Nielsen
%A Jorgen Staunstrup
%T Experiments with a fast string searching algorithm
%J Information Processing Letters
%K ipl
%V 18
%N 3
%D March 1984
%P 129-135

%A John H. Remmers
%T A technique for developing loop invariants
%J Information Processing Letters
%K ipl
%V 18
%N 3
%D March 1984
%P 137-139

%A G. Alia
%A F. Barsi
%A E. Martinelli
%T A fast VLSI conversion between binary and residue systems
%J Information Processing Letters
%K ipl
%V 18
%N 3
%D March 1984
%P 141-145

%A Stuart J. Berkowitz
%T On computing the determinant in small parallel time
using a small number of processors
%J Information Processing Letters
%K ipl
%V 18
%N 3
%D March 1984
%P 147-150

%A Gyorgy Turan
%T The critical complexity of graph properties
%J Information Processing Letters
%K ipl
%V 18
%N 3
%D March 1984
%P 151-153

%A A. Apostolico
%A R. Giancarlo
%T Pattern matching machine implementation
of a fast test for unique decipherability
%J Information Processing Letters
%K ipl
%V 18
%N 3
%D March 1984
%P 155-158

%A Gordon V. Cormack
%A R. Nigel Horspool
%T Algorithms for adaptive Huffman codes
%J Information Processing Letters
%K ipl
%V 18
%N 3
%D March 1984
%P 159-165

%A Alfonso Miola
%T Algebraic approach to p-adic conversion of rational numbers
%J Information Processing Letters
%K ipl
%V 18
%N 3
%D March 1984
%P 167-171

%A Thomas Lickteig
%T A note on border rank
%J Information Processing Letters
%K ipl
%V 18
%N 3
%D March 1984
%P 173-178

%A Gianna Cioni
%A Antoni Kreczmar
%T Programmed deallocation without dangling reference
%J Information Processing Letters
%K ipl
%V 18
%N 4
%D May 1984
%P 179-187

%A Alistair Moffat
%A Tadao Takaoka
%T A priority queue for the all pairs shortest path problem
%J Information Processing Letters
%K ipl
%V 18
%N 4
%D May 1984
%P 189-193

%A Donald C.S. Allison
%A M.T. Noga
%T The L1 traveling salesman problem
%J Information Processing Letters
%K ipl
%V 18
%N 4
%D May 1984
%P 195-199

%A Jurgen Tiekenheinrich
%T A 4n-lower bound on the monotone network complexity
of a one-output boolean function
%J Information Processing Letters
%K ipl
%V 18
%N 4
%D May 1984
%P 201-202

%A Heikki Mannila
%A Esko Ukkonen
%T A simple linear-time algorithm for in situ merging
%J Information Processing Letters
%K ipl
%V 18
%N 4
%D May 1984
%P 203-208

%A Susumu Yamasaki
%A Mikio Yoshida
%A Shuji Doshita
%A Mikito Hirata
%T A new combination of input and unit deductions for Horn sentences
%J Information Processing Letters
%K ipl
%V 18
%N 4
%D May 1984
%P 209-213

%A Eike Best
%T Fairness and conspiracies
%J Information Processing Letters
%K ipl
%V 18
%N 4
%D May 1984
%P 215-220

%A Vladimir Lifschitz
%T On verification of programs with goto statements
%J Information Processing Letters
%K ipl
%V 18
%N 4
%D May 1984
%P 221-225

%A Takao Ohya
%A Masao Iri
%A Kazuo Murota
%T A fast Voronoi-diagram algorithm with quaternary tree bucketing
%J Information Processing Letters
%K ipl
%V 18
%N 4
%D May 1984
%P 227-231

%A Paolo Atzeni
%A Nicola M. Morfuni
%T Functional dependencies in relations with null values
%J Information Processing Letters
%K ipl
%V 18
%N 4
%D May 1984
%P 233-238

%A B. Monien
%T Deterministic two-way one-head pushdown automata are very powerful
%J Information Processing Letters
%K ipl
%V 18
%N 5
%D June 1984
%P 239-242

%A M.P. Fle
%A G. Roucairol
%T Multiseralization of iterated transactions
%J Information Processing Letters
%K ipl
%V 18
%N 5
%D June 1984
%P 243-247

%A Gerhard Barth
%T An analytical comparison of two string searching algorithms
%J Information Processing Letters
%K ipl
%V 18
%N 5
%D June 1984
%P 249-256

%A Moshe Y. Vardi
%T A note on lossless database decompositions
%J Information Processing Letters
%K ipl
%V 18
%N 5
%D June 1984
%P 257-260

%A Nathan Goodman
%A Y.C. Tay
%T A characterization of multivalued dependencies
equivalent to a join dependency
%J Information Processing Letters
%K ipl
%V 18
%N 5
%D June 1984
%P 261-266

%A J. Blazewicz
%A J. Weglarz
%A M. Drabowski
%T Scheduling independent 2-processor tasks to minimize schedule length
%J Information Processing Letters
%K ipl
%V 18
%N 5
%D June 1984
%P 267-273

%A M.B. Trakhtenbrot
%T Some equivalent transformations of recursive programs
based on their schematic properties
%J Information Processing Letters
%K ipl
%V 18
%N 5
%D June 1984
%P 275-283

%A Bruno Courcelle
%T Some negative results concerning DPDA's
%J Information Processing Letters
%K ipl
%V 18
%N 5
%D June 1984
%P 285-289

%A Shinsei Tazawa
%T On the consecutive retrieval property for generalized binary queries
%J Information Processing Letters
%K ipl
%V 18
%N 5
%D June 1984
%P 291-293

%A D.K. Friesen
%A M.A. Langston
%T A storage-size selection problem
%J Information Processing Letters
%K ipl
%V 18
%N 5
%D June 1984
%P 295-296

%A Hari Madduri
%A Raphael Finkel
%T Extension of the banker's algorithm for resource allocation
in a distributed operating system
%J Information Processing Letters
%K ipl
%V 19
%N 1
%D July 1984
%P 1-8

%A Michio Oyamaguchi
%T Some remarks on subclass containment problems for several classes of DPDA's
%J Information Processing Letters
%K ipl
%V 19
%N 1
%D July 1984
%P 9-12

%A Nam Sung Woo
%A Carl H. Smith
%A Ashok Agrawala
%T A proof of determinacy property of the data flow schema
%J Information Processing Letters
%K ipl
%V 19
%N 1
%D July 1984
%P 13-16

%A J.R. Parker
%T On converting character strings to integers
%J Information Processing Letters
%K ipl
%V 19
%N 1
%D July 1984
%P 17-19

%A Ulrich Rechtold
%A Klaus Kuspert
%T On the use of extendible hashing without hashing
%J Information Processing Letters
%K ipl
%V 19
%N 1
%D July 1984
%P 21-26

%A Ulrich Faigle
%A Rainer Schrader
%T Minimizing completion time for a class of scheduling problems
%J Information Processing Letters
%K ipl
%V 19
%N 1
%D July 1984
%P 27-29

%A Walter J. Savitch
%A Paul M.B. Vitanyi
%T On the power of real-time two-way multihead automata with jumps
%J Information Processing Letters
%K ipl
%V 19
%N 1
%D July 1984
%P 31-35

%A Alan A. Bertossi
%T Dominating sets for split and bipartite graphs
%J Information Processing Letters
%K ipl
%V 19
%N 1
%D July 1984
%P 37-40

%A P.A. Subrahmanyan
%A J.-H. You
%T On embedding functions in logic
%J Information Processing Letters
%K ipl
%V 19
%N 1
%D July 1984
%P 41-46

%A Selim G. Aki
%T An optimal algorithm for parallel selection
%J Information Processing Letters
%K ipl
%V 19
%N 1
%D July 1984
%P 47-50

%A Udi Manber
%T A probabilistic lower bound for checking disjointness of sets
%J Information Processing Letters
%K ipl
%V 19
%N 1
%D July 1984
%P 51-53

%A Paul Spirakis
%A Chee K. Yap
%T Strong NP-hardness of moving many discs
%J Information Processing Letters
%K ipl
%V 19
%N 1
%D July 1984
%P 55-59

%A Helmut Alt
%A Kurt Mehlhorn
%A J. Ian Munro
%T Partial match retrieval in implicit data structures
%J Information Processing Letters
%K ipl
%V 19
%N 2
%D August 1984
%P 61-65

%A Alain J. Martin
%A Martin Rem
%T A presentation of the Fibonacci algorithm
%J Information Processing Letters
%K ipl
%V 19
%N 2
%D August 1984
%P 67-68

%A G.P. McKeown
%A V.J. Rayward-Smith
%T Communication problems on MIMD parallel computers
%J Information Processing Letters
%K ipl
%V 19
%N 2
%D August 1984
%P 69-73

%A Prashant Palvia
%A Salvatore T. March
%T Approximating block accesses in database organizations
%J Information Processing Letters
%K ipl
%V 19
%N 2
%D August 1984
%P 75-79

%A E. Luque
%A A. Ripoli
%T Integer linear programming for microprograms register allocation
%J Information Processing Letters
%K ipl
%V 19
%N 2
%D August 1984
%P 81-85

%A Ewa Klupsz
%T A linear algorithm of a deadlock avoidance for nonpreemtible resources
%J Information Processing Letters
%K ipl
%V 19
%N 2
%D August 1984
%P 87-94

%A Grazia Lotti
%T Area-time tradeoff for rectangular matrix multiplication in VLSI models
%J Information Processing Letters
%K ipl
%V 19
%N 2
%D August 1984
%P 95-98

%A Witold Lipski,\ Jr.
%T An O(n log n) Manhattan path algorithm
%J Information Processing Letters
%K ipl
%V 19
%N 2
%D August 1984
%P 99-102

%A Elaine J. Weyuker
%T The complexity of data flow criteria for test data selection
%J Information Processing Letters
%K ipl
%V 19
%N 2
%D August 1984
%P 103-109

%A A. Shamir
%A C.P. Schnorr
%T Cryptanalysis of certain variants of Rabin's signature scheme
%J Information Processing Letters
%K ipl
%V 19
%N 3
%D October 1984
%P 113-115

%A Joseph M. Treat
%A Timothy A. Budd
%T Extensions to grid selector composition and computation in APL
%J Information Processing Letters
%K ipl
%V 19
%N 3
%D October 1984
%P 117-123

%A David Avis
%T Non-partitionable point sets
%J Information Processing Letters
%K ipl
%V 19
%N 3
%D October 1984
%P 125-129

%A Peter Eades
%A Brendan McKay
%T An algorithm for generating subsets of fixed size
with a strong minimal change property
%J Information Processing Letters
%K ipl
%V 19
%N 3
%D October 1984
%P 131-133

%A Dale Johnson
%A Barrett R. Bryant
%T Formal syntax methods for natural language
%J Information Processing Letters
%K ipl
%V 19
%N 3
%D October 1984
%P 135-143

%A Tomasz Kowaltowski
%A Antonio Palma
%T Another solution of the mutual exclusion problem
%J Information Processing Letters
%K ipl
%V 19
%N 3
%D October 1984
%P 145-146

%A R.G. Gupta
%A V.S.P. Srivastava
%T On synthesis of scheduling algorithms
%J Information Processing Letters
%K ipl
%V 19
%N 3
%D October 1984
%P 147-150

%A Joachim Biskup
%T Some variants of the take-grant protection model
%J Information Processing Letters
%K ipl
%V 19
%N 3
%D October 1984
%P 151-156

%A D. Maio
%A M.R. Scalas
%A P. Tiberio
%T On estimating access costs in relational databases
%J Information Processing Letters
%K ipl
%V 19
%N 3
%D October 1984
%P 157-161

%A Wojciech Rytter
%T On linear context-free languages and one-way multihead automata
%J Information Processing Letters
%K ipl
%V 19
%N 4
%D November 1984
%P 163-166

%A M. Chrobak
%A B.S. Chlebus
%T Probabilistic Turing machines and recursively enumerable Dedekind cuts
%J Information Processing Letters
%K ipl
%V 19
%N 4
%D November 1984
%P 167-171

%A Ph. Darondeau
%A L. Kott
%T Towards a formal proof system for omega-rational expressions
%J Information Processing Letters
%K ipl
%V 19
%N 4
%D November 1984
%P 173-177

%A Marek Chrobak
%T A note on bounded-reversal multipushdown machines
%J Information Processing Letters
%K ipl
%V 19
%N 4
%D November 1984
%P 179-180

%A Dick Grune
%T How to produce all sentences for a two-level grammar
%J Information Processing Letters
%K ipl
%V 19
%N 4
%D November 1984
%P 181-185

%A Arturo Carpi
%T On the centers of the set of weakly square-free words
on a two letter alphabet
%J Information Processing Letters
%K ipl
%V 19
%N 4
%D November 1984
%P 187-190

%A J. Kral
%T On software equations
%J Information Processing Letters
%K ipl
%V 19
%N 4
%D November 1984
%P 191-196

%A Michael Kallay
%T The complexity of incremental convex hull algorithms in R^d
%J Information Processing Letters
%K ipl
%V 19
%N 4
%D November 1984
%P 197

%A Clement H.C. Leung
%T Approximate storage utilisation of B-trees:
a simple derivation and generalisations
%J Information Processing Letters
%K ipl
%V 19
%N 4
%D November 1984
%P 199-201

%A T.R. Walsh
%T How evenly should one divide to conquer quickly ?
%J Information Processing Letters
%K ipl
%V 19
%N 4
%D November 1984
%P 203-208

%A Lawrence W. Dowdy
%A Derek L. Eager
%A Karen D. Gordon
%A Lawrence V. Saxton
%T Throughput concavity and response time convexity
%J Information Processing Letters
%K ipl
%V 19
%N 4
%D November 1984
%P 209-212

%A Juhani Karhumaki
%A Derek Wood
%T Inverse morphic equivalence of languages
%J Information Processing Letters
%K ipl
%V 19
%N 5
%D November 1984
%P 213-218

%A Greg N. Frederickson
%T On linear-time algorithms for five-coloring planar graphs
%J Information Processing Letters
%K ipl
%V 19
%N 5
%D November 1984
%P 219-224

%A Erkki Makinen
%T On derivation preservation
%J Information Processing Letters
%K ipl
%V 19
%N 5
%D November 1984
%P 225-228

%A Derick Wood
%T The contour problem for rectilinear polygons
%J Information Processing Letters
%K ipl
%V 19
%N 5
%D November 1984
%P 229-236

%A Paul Bourret
%T How to estimate the sizes of domains
%J Information Processing Letters
%K ipl
%V 19
%N 5
%D November 1984
%P 237-243

%A George Tourlakis
%T An inductive number-theoretic characterization of NP
%J Information Processing Letters
%K ipl
%V 19
%N 5
%D November 1984
%P 245-247

%A Jozef Vyskoc
%T A note on boolean matrix multiplication
%J Information Processing Letters
%K ipl
%V 19
%N 5
%D November 1984
%P 249-251

%A Pierre McKenzie
%T Permutations of bounded degree generate groups of polynomial diameter
%J Information Processing Letters
%K ipl
%V 19
%N 5
%D November 1984
%P 253-254

%A Goker Gursel
%A Peter Scheuermann
%T Asserting the optimality of serial SJRPs
in processing simple queries in chain networks
%J Information Processing Letters
%K ipl
%V 19
%N 5
%D November 1984
%P 255-260

%A Christine Duboc
%T Some properties of commutation in free partially commutative monoids
%J Information Processing Letters
%K ipl
%V 20
%N 1
%D January 1985
%P 1-4

%A Ronald V. Book
%A Friedrich Otto
%T Cancellation rules and extended word problems
%J Information Processing Letters
%K ipl
%V 20
%N 1
%D January 1985
%P 5-11

%A A. Mirzaian
%A E. Arjomandi
%T Selection in X+Y and matrices with sorted rows and columns
%J Information Processing Letters
%K ipl
%V 20
%N 1
%D January 1985
%P 13-17

%A Erkki Makinen
%T A note on undercover relation
%J Information Processing Letters
%K ipl
%V 20
%N 1
%D January 1985
%P 19-21

%A G.P. McKeown
%T A special purpose MIMD parallel processor
%J Information Processing Letters
%K ipl
%V 20
%N 1
%D January 1985
%P 23-27
%K chordal rings

%A S. Upendra Rao
%A A.K. Majumdar
%T An algorithm for local compaction of horizontal microprograms
%J Information Processing Letters
%K ipl
%V 20
%N 1
%D January 1985
%P 29-33

%A Solomon Passy
%A Tinko Tinchev
%T PDL with data constants
%J Information Processing Letters
%K ipl
%V 20
%N 1
%D January 1985
%P 35-41

%A Silvio Lemos Meira
%T A linear applicative solution for the set union problem
%J Information Processing Letters
%K ipl
%V 20
%N 1
%D January 1985
%P 43-45

%A Adam C. Bounas
%T Direct determination of a "seed" binary matrix
%J Information Processing Letters
%K ipl
%V 20
%N 1
%D January 1985
%P 47-50

%A Sushil Jajodia
%T On equivalence of relational and network database models
%J Information Processing Letters
%K ipl
%V 20
%N 1
%D January 1985
%P 51-54

%A G. Bilardi
%A F.P. Preparata
%T The VLSI optimality of the AKS sorting network
%J Information Processing Letters
%K ipl
%V 20
%N 2
%D February 1985
%P 55-59

%A David A. Plaisted
%T The undecidability of self-embedding for term rewriting systems
%J Information Processing Letters
%K ipl
%V 20
%N 2
%D February 1985
%P 61-64

%A Jan L.A. van\ de\ Snepscheut
%T Evaluating expressions with a queue
%J Information Processing Letters
%K ipl
%V 20
%N 2
%D February 1985
%P 65-66

%A John McLean
%T A comment on the "basic security theorem" of Bell and LaPadula
%J Information Processing Letters
%K ipl
%V 20
%N 2
%D February 1985
%P 67-70

%A Kohei Noshita
%T Translation of Turner combinators in O(n log n) space
%J Information Processing Letters
%K ipl
%V 20
%N 2
%D February 1985
%P 71-74

%A P. Widmayer
%A C.K. Wong
%T An optimal algorithm for the maximum alignment of terminals
%J Information Processing Letters
%K ipl
%V 20
%N 2
%D February 1985
%P 75-82

%A Satish R. Thatte
%T On the correspondence between two classes of reduction systems
%J Information Processing Letters
%K ipl
%V 20
%N 2
%D February 1985
%P 83-85

%A David Harel
%A David Peleg
%T More on looping vs. repeating dynamic logic
%J Information Processing Letters
%K ipl
%V 20
%N 2
%D February 1985
%P 87-90

%A A.J. Auzins
%A E.B. Kinber
%T On separation of the emptiness and equivalence problems
for program schemes
%J Information Processing Letters
%K ipl
%V 20
%N 2
%D February 1985
%P 91-93

%A D. Beauquier
%A D. Perrin
%T Codeterministic automata on infinite words
%J Information Processing Letters
%K ipl
%V 20
%N 2
%D February 1985
%P 95-98

%A Esko Ukkonen
%T Upper bounds on the size of LR(k) parsers
%J Information Processing Letters
%K ipl
%V 20
%N 2
%D February 1985
%P 99-103

%A Michael G. Main
%T An infinite square-free co-CFL
%J Information Processing Letters
%K ipl
%V 20
%N 2
%D February 1985
%P 105-107

%A Subhash C. Kak
%T How to detect tampering of data
%J Information Processing Letters
%K ipl
%V 20
%N 2
%D February 1985
%P 109-110

%A Ernest C. Njau
%T Details of distortions in the computed Fourier transforms of signals
part I: short periodic signals
%J Information Processing Letters
%K ipl
%V 20
%N 3
%D April 1985
%P 111-113

%A Eduardo D. Sontag
%T Real addition and the polynomial hierarchy
%J Information Processing Letters
%K ipl
%V 20
%N 3
%D April 1985
%P 115-120

%A Mee Yee Chan
%T A note on redundant disk module allocation
%J Information Processing Letters
%K ipl
%V 20
%N 3
%D April 1985
%P 121-123

%A Alain J. Martin
%T The probe: an addition to communication primitives
%J Information Processing Letters
%K ipl
%V 20
%N 3
%D April 1985
%P 125-130

%A E. Lodi
%A F. Luccio
%T Split sequence hash search
%J Information Processing Letters
%K ipl
%V 20
%N 3
%D April 1985
%P 131-136

%A Richard Cole
%A Chee K. Yap
%T A parallel median algorithm
%J Information Processing Letters
%K ipl
%V 20
%N 3
%D April 1985
%P 137-139

%A Erkki Makinen
%T An undecidable problem for context-free grammars
%J Information Processing Letters
%K ipl
%V 20
%N 3
%D April 1985
%P 141-142

%A Yung Hyang Tsin
%T An optimal parallel processor bound
in strong orientation of an undirected graph
%J Information Processing Letters
%K ipl
%V 20
%N 3
%D April 1985
%P 143-146

%A Baruch Awerbuch
%T A new distributed depth-first-search algorithm
%J Information Processing Letters
%K ipl
%V 20
%N 3
%D April 1985
%P 147-150

%A Jeffrey Shallit
%A Adi Shamir
%T Number-theoretic functions which are equivalent to number of divisors
%J Information Processing Letters
%K ipl
%V 20
%N 3
%D April 1985
%P 151-153

%A Hugo Volger
%T Some results on addition/subtraction chains
%J Information Processing Letters
%K ipl
%V 20
%N 3
%D April 1985
%P 155-160

%A W.M. Beynon
%A C.S. Iliopoulos
%T Computing a basis for a finite Abelian p-group
%J Information Processing Letters
%K ipl
%V 20
%N 3
%D April 1985
%P 161-163

%A Emo Welzl
%T Constructing the visibility graph for n-line segments in O(n^2) time
%J Information Processing Letters
%K ipl
%V 20
%N 4
%D May 1985
%P 167-171

%A Mathai Joseph
%T On a problem in real-time computing
%J Information Processing Letters
%K ipl
%V 20
%N 4
%D May 1985
%P 173-177

%A Nicola Santoro
%A Jeffrey B. Sidney
%T Interpolation-binary search
%J Information Processing Letters
%K ipl
%V 20
%N 4
%D May 1985
%P 179-181

%A K. Ranfarajan
%A S. Arun-Kumar
%T Fair derivations in E0L systems
%J Information Processing Letters
%K ipl
%V 20
%N 4
%D May 1985
%P 183-188

%A Carroll Morgan
%T Global and logical time in distributed algorithms
%J Information Processing Letters
%K ipl
%V 20
%N 4
%D May 1985
%P 189-194

%A David S. Wise
%T Representing matrices as quadtrees for parallel processors
%J Information Processing Letters
%K ipl
%V 20
%N 4
%D May 1985
%P 195-199

%A J. Mark Keil
%T Finding Hamiltonian circuits in interval graphs
%J Information Processing Letters
%K ipl
%V 20
%N 4
%D May 1985
%P 201-206

%A W.J. van\ Gils
%T How to cope with faulty processors
in a completely connected network of communicating processors
%J Information Processing Letters
%K ipl
%V 20
%N 4
%D May 1985
%P 207-213

%A Costas S. Iliopoulos
%T Analysis of algorithms on problems in general Abelian groups
%J Information Processing Letters
%K ipl
%V 20
%N 4
%D May 1985
%P 215-220

%A Amiram Yehudai
%T A note on chains of deterministic pushdown transducers
%J Information Processing Letters
%K ipl
%V 20
%N 4
%D May 1985
%P 221-222

%A Maciej Slusarek
%T A note on the dynamic storage allocation problem
%J Information Processing Letters
%K ipl
%V 20
%N 5
%D June 1985
%P 223-227

%A John H. Reif
%T Depth-first search is inherently sequential
%J Information Processing Letters
%K ipl
%V 20
%N 5
%D June 1985
%P 229-234

%A Uzi Vishkin
%T On efficient parallel strong orientation
%J Information Processing Letters
%K ipl
%V 20
%N 5
%D June 1985
%P 235-240

%A Juris Hartmanis
%T Independence results about context-free languages and lower bounds
%J Information Processing Letters
%K ipl
%V 20
%N 5
%D June 1985
%P 241-248

%A James R. Bitner
%T Storing matrices on disk for efficient row and column retrieval
%J Information Processing Letters
%K ipl
%V 20
%N 5
%D June 1985
%P 249-254

%A Luc Devroye
%T A note on the expected time required to construct the outer layer
%J Information Processing Letters
%K ipl
%V 20
%N 5
%D June 1985
%P 255-257

%A Christos H. Papadimitriou
%T An algorithm for shortest-path motion in three dimensions
%J Information Processing Letters
%K ipl
%V 20
%N 5
%D June 1985
%P 259-263

%A Hanan Samet
%T Bidirectional coroutines
%J Information Processing Letters
%K ipl
%V 21
%N 1
%D July 1985
%P 1-6

%A Juraj Hromkovic
%T Alternating multicounter machines with constant number of reversals
%J Information Processing Letters
%K ipl
%V 21
%N 1
%D July 1985
%P 7-9

%A M. Negri
%A G. Pelagatti
%T Join during merge: an improved sort based algorithm
%J Information Processing Letters
%K ipl
%V 21
%N 1
%D July 1985
%P 11-16

%A Gerald Guralnik
%A Charles Zemach
%A Tony Warnock
%T An algorithm for uniform random sampling
of points in and on a hypersphere
%J Information Processing Letters
%K ipl
%V 21
%N 1
%D July 1985
%P 17-21

%A Linda Pagli
%T Self-adjusting hash tables
%J Information Processing Letters
%K ipl
%V 21
%N 1
%D July 1985
%P 23-25

%A Deepak Kapur
%A Mukkai Krishnamoorthy
%T Worst-case choice for the stable marriage problem
%J Information Processing Letters
%K ipl
%V 21
%N 1
%D July 1985
%P 27-30

%A Se Man Oh
%A J.C.H. Park
%T A note on removing loops from table-driven code generators
%J Information Processing Letters
%K ipl
%V 21
%N 1
%D July 1985
%P 31-34
%K LALR

%A Mordechai M. Yung
%T A secure and useful "keyless cryptosystem"
%J Information Processing Letters
%K ipl
%V 21
%N 1
%D July 1985
%P 35-38

%A H. Edelsbrunner
%A H.A. Maurer
%T Finding extreme points in three dimensions
and solving the post-office problem in the plane
%J Information Processing Letters
%K ipl
%V 21
%N 1
%D July 1985
%P 39-47

%A Ingo Wegener
%T Optimal search with positive switch cost is NP-hard
%J Information Processing Letters
%K ipl
%V 21
%N 1
%D July 1985
%P 49-52

%A Vladimir J. Lumelsky
%T On fast computation of distance between line segments
%J Information Processing Letters
%K ipl
%V 21
%N 2
%D August 1985
%P 55-61

%A Thomas Rauchle
%A Sam Toueg
%T Exposure to deadlock for communicating processes in hard to detect
%J Information Processing Letters
%K ipl
%V 21
%N 2
%D August 1985
%P 63-68

%A Anne Kaldewali
%T On the decomposition of sequences into ascending subsequences
%J Information Processing Letters
%K ipl
%V 21
%N 2
%D August 1985
%P 69

%A Juraj Hromkovic
%T Linear lower bounds on unbounded fan-in boolean circuits
%J Information Processing Letters
%K ipl
%V 21
%N 2
%D August 1985
%P 71-74

%A Ladislav Janiga
%A Vaclav Koubek
%T A note on finding minimum cuts in directed planar networks
by parallel computations
%J Information Processing Letters
%K ipl
%V 21
%N 2
%D August 1985
%P 75-78

%A Dario Bini
%A Victor Ya Pan
%T Fast parallel polynomial division via reduction
to triangular Toeplitz matrix inversion
and to polynomial inversion modulo a power
%J Information Processing Letters
%K ipl
%V 21
%N 2
%D August 1985
%P 79-81

%A Dietmar Watjen
%T Feedback automata and their languages
%J Information Processing Letters
%K ipl
%V 21
%N 2
%D August 1985
%P 83-86

%A Paul M.B. Vitanyi
%T Square time is optimal for simulation
of one pushdown store or one queue by an oblivious one-head tape unit
%J Information Processing Letters
%K ipl
%V 21
%N 2
%D August 1985
%P 87-91

%A Van Nguyen
%T The incompleteness of Misra and Chandy's proof systems
%J Information Processing Letters
%K ipl
%V 21
%N 2
%D August 1985
%P 93-96

%A Alain J. Martin
%A Jerry R. Burch
%T Fair mutual exclusion with unfair P and V operations
%J Information Processing Letters
%K ipl
%V 21
%N 2
%D August 1985
%P 97-100

%A Clemens Lautemann
%A Friedhelm Meyer\ auf\ der\ Heide
%T Lower time bounds for integer programming with two variables
%J Information Processing Letters
%K ipl
%V 21
%N 2
%D August 1985
%P 101-105

%A Clark D. Thompson
%T VLSI design with multiple active layers
%J Information Processing Letters
%K ipl
%V 21
%N 3
%D September 1985
%P 109-111

%A Suresh C. Kothari
%A K.V.S. Ramarao
%T General algorithms for the address calculation
of lexicographically ordered tuples
%J Information Processing Letters
%K ipl
%V 21
%N 3
%D September 1985
%P 113-116

%A D.T. Lee
%A Y.T. Ching
%T The power of geometric duality revisited
%J Information Processing Letters
%K ipl
%V 21
%N 3
%D September 1985
%P 117-122

%A Joseph Ja'Ja'
%A Jean Takche
%T Improved lower bounds for some matrix multiplication problems
%J Information Processing Letters
%K ipl
%V 21
%N 3
%D September 1985
%P 123-127

%A Ted Herman
%A K. Many Chandy
%T On distributed search
%J Information Processing Letters
%K ipl
%V 21
%N 3
%D September 1985
%P 129-133

%A M. Jantzen
%T A note on a special one-rule semi-Thue system
%J Information Processing Letters
%K ipl
%V 21
%N 3
%D September 1985
%P 135-140

%A Timothy A. Budd
%T Creation and reflexive rights in grammatical protection systems
%J Information Processing Letters
%K ipl
%V 21
%N 3
%D September 1985
%P 141-145

%A Paul M.B. Vitanyi
%T An n^1.618 lower bound on the time to simulate
one queue or two pushdown stores by one tape
%J Information Processing Letters
%K ipl
%V 21
%N 3
%D September 1985
%P 147-152

%A Chae Woo Yoo
%T An approach to the transportation of computer software
%J Information Processing Letters
%K ipl
%V 21
%N 3
%D September 1985
%P 153-157

%A B. Codenotti
%A F. Romani
%A G. Lotti
%T VLSI implementation of fast solvers for band linear systems
with constant coefficient matrix
%J Information Processing Letters
%K ipl
%V 21
%N 3
%D September 1985
%P 159-163

%A Ralf Hartmut Guting
%T Fast dynamic intersection searching
in a set of isomorphic line segments
%J Information Processing Letters
%K ipl
%V 21
%N 4
%D October 1985
%P 165-171

%A Jean-Paul Laumond
%T Enumeration of articulation pairs of a planar graph
%J Information Processing Letters
%K ipl
%V 21
%N 4
%D October 1985
%P 173-179

%A Bowen Alpern
%A Fred B. Schneider
%T Defining liveness
%J Information Processing Letters
%K ipl
%V 21
%N 4
%D October 1985
%P 181-185

%A M.D. Atkinson
%T On zigzag permutations and comparisons of adjacent elements
%J Information Processing Letters
%K ipl
%V 21
%N 4
%D October 1985
%P 187-189

%A Yves Robert
%A Maurice Tchuente
%T A systolic array for the longest common subsequence problem
%J Information Processing Letters
%K ipl
%V 21
%N 4
%D October 1985
%P 191-198

%A J.L. Keedy
%A B. Freisleben
%T On the efficient use of semaphore primitives
%J Information Processing Letters
%K ipl
%V 21
%N 4
%D October 1985
%P 199-205

%A Ching C. Hsiao
%A Nien-Tsu Shen
%T k-fold bitonic sort on a mesh-connected parallel computer
%J Information Processing Letters
%K ipl
%V 21
%N 4
%D October 1985
%P 207-212

%A A. Marchetti-Spaccamela
%A G. Romano
%T On different approximation criteria for subset product problems
%J Information Processing Letters
%K ipl
%V 21
%N 4
%D October 1985
%P 213-218

%A Bertran Meyer
%T Incremental string matching
%J Information Processing Letters
%K ipl
%V 21
%N 5
%D November 1985
%P 219-227

%A Jan Magott
%T Performance evaluation of systems of cyclic sequential processes
with mutual exclusion using Petri nets
%J Information Processing Letters
%K ipl
%V 21
%N 5
%D November 1985
%P 229-232

%A A.J. Kfoury
%T The unwind property for programs with bounded memory
%J Information Processing Letters
%K ipl
%V 21
%N 5
%D November 1985
%P 233-238

%A Wlodzimierz Dobosiewitz
%T A note on natural selection
%J Information Processing Letters
%K ipl
%V 21
%N 5
%D November 1985
%P 239-243

%A Pavol Duris
%A Ondrej Sykora
%A Imrich Vrt'o
%A Clark D. Thompson
%T Tight chip area lower bounds
for discrete Fourier and Walsh-Hadamard transformations
%J Information Processing Letters
%K ipl
%V 21
%N 5
%D November 1985
%P 245-247

%A Kenneth J. Supowit
%T Decomposing a set of points into chains,
with applications to permutation and circle graphs
%J Information Processing Letters
%K ipl
%V 21
%N 5
%D November 1985
%P 249-252

%A Ulrich Derigs
%T An efficient Dijkstra-like labeling method
for computing shortest odd/even paths
%J Information Processing Letters
%K ipl
%V 21
%N 5
%D November 1985
%P 253-258

%A Ingrid J.M. Birkhoff
%T A direct routing algorithm
for the bit-reversal permutation on a shuffle-exchange network
%J Information Processing Letters
%K ipl
%V 21
%N 5
%D November 1985
%P 259-268

%A Heikki Mannila
%A Kurt Mehlhorn
%T A fast algorithm for renaming a set of clauses as a Horn set
%J Information Processing Letters
%K ipl
%V 21
%N 5
%D November 1985
%P 269-272

%A Philippe Chatelin
%T On transformations of algorithms to multiply 2*2 matrices
%J Information Processing Letters
%K ipl
%V 22
%N 1
%D January 1986
%P 1-5

%A Jean Berstel
%T Every iterated morphism yields a co-CFL
%J Information Processing Letters
%K ipl
%V 22
%N 1
%D January 1986
%P 7-9

%A Victor Ya. Pan
%T The trade-off between the additive complexity and the asynchronicity
of linear and bilinear algorithms
%J Information Processing Letters
%K ipl
%V 22
%N 1
%D January 1986
%P 11-14

%A Bernd Baumbarten
%A Peter Ochsenschlager
%T On termination and phase changes in the presence of unreliable communication
%J Information Processing Letters
%K ipl
%V 22
%N 1
%D January 1986
%P 15-20

%A Kenneth L. Clarkson
%T Linear programming in O(n*3^d) time
%J Information Processing Letters
%K ipl
%V 22
%N 1
%D January 1986
%P 21-24

%A Andrzej Lingas
%T The greedy and Delauney triangulations are not bad in the average case
%J Information Processing Letters
%K ipl
%V 22
%N 1
%D January 1986
%P 25-31

%A Louis E. Rosier
%T A note on Presburger arithmetic with array segments, permutation and equality
%J Information Processing Letters
%K ipl
%V 22
%N 1
%D January 1986
%P 33-35

%A Mirko Kirvanek
%T Hexagonal unit network - a tool for proving the NP-completeness results
of geometric problems
%J Information Processing Letters
%K ipl
%V 22
%N 1
%D January 1986
%P 37-41

%A Christian T.M. Jacobs
%A Peter van\ Emde\ Boas
%T Two results on tables
%J Information Processing Letters
%K ipl
%V 22
%N 1
%D January 1986
%P 43-48

%A V. Kriauciukas
%T Tree-like parse and polynomial subclasses of search problems
%J Information Processing Letters
%K ipl
%V 22
%N 1
%D January 1986
%P 49-54

%A Ivan Stojmenovic
%A Eljas Soisalon-Soininen
%T A note on approximate convex hulls
%J Information Processing Letters
%K ipl
%V 22
%N 2
%D January 1986
%P 55-56

%A Amos Israeli
%A Y. Shiloach
%T An improved parallel algorithm for maximal matching
%J Information Processing Letters
%K ipl
%V 22
%N 2
%D January 1986
%P 57-60

%A Ke-Chang Dal
%T Edison-80, a language for modular programming of parallel processes
%J Information Processing Letters
%K ipl
%V 22
%N 2
%D January 1986
%P 61-72

%A M.D. Grigoriadis
%A B. Kalantari
%T A lower bound to the complexity
of Euclidean and rectilinear matching algorithms
%J Information Processing Letters
%K ipl
%V 22
%N 2
%D January 1986
%P 73-76

%A Amos Israeli
%A A. Ital
%T A fast and simple randomized parallel algorithm for maximal matching
%J Information Processing Letters
%K ipl
%V 22
%N 2
%D January 1986
%P 77-80

%A Charles U. Martel
%T Lower bounds on parallel algorithms
for finding the first maximal independent set
%J Information Processing Letters
%K ipl
%V 22
%N 2
%D January 1986
%P 81-85

%A Marta Cialdea
%T Some remarks on the possibility
of extending resolution proof procedures to intuitionistic logic
%J Information Processing Letters
%K ipl
%V 22
%N 2
%D January 1986
%P 87-90

%A Pavel Goralcik
%A Viclav Koubek
%T Verifying nonrigidity
%J Information Processing Letters
%K ipl
%V 22
%N 2
%D January 1986
%P 91-95

%A Marc Snir
%T Exact balancing is not always good
%J Information Processing Letters
%K ipl
%V 22
%N 2
%D January 1986
%P 97-102

%A Max B. Webster
%A Paul W. Baker
%T A class of differential equations for testing variable step-size integration
%J Information Processing Letters
%K ipl
%V 22
%N 2
%D January 1986
%P 103-107

%A P. Srinivas Kumar
%A M. Manohar
%T On probability of foreest of quadtrees reducing to quadtrees
%J Information Processing Letters
%K ipl
%V 22
%N 3
%D March 1986
%P 109-111

%A Klaus Ambos-Spies
%T Inhomogeneities in the polynomial-time degrees:
the degrees of super sparse sets
%J Information Processing Letters
%K ipl
%V 22
%N 3
%D March 1986
%P 113-117

%A Franz Aurenhammer
%T The one-dimensional weighted Voronoi diagram
%J Information Processing Letters
%K ipl
%V 22
%N 3
%D March 1986
%P 119-123

%A Arturo Carpi
%A Aldo de\ Luca
%T Square-free words on partially commutative free monoids
%J Information Processing Letters
%K ipl
%V 22
%N 3
%D March 1986
%P 125-131

%A Yoshio Hattori
%T Nonisomorphic graphs with the same T-polynomial
%J Information Processing Letters
%K ipl
%V 22
%N 3
%D March 1986
%P 133-134

%A F. Gire
%T Two decidability problems for infinite words
%J Information Processing Letters
%K ipl
%V 22
%N 3
%D March 1986
%P 135-140

%A R. John Muir Hughes
%T A novel representation of lists and its application to the function "reverse"
%J Information Processing Letters
%K ipl
%V 22
%N 3
%D March 1986
%P 141-144

%A Sylvianne R Schwer
%T On the rationality of Petri net languages
%J Information Processing Letters
%K ipl
%V 22
%N 3
%D March 1986
%P 145-146

%A Lia Chen
%T O(1) space complexity deletion for AVL trees
%J Information Processing Letters
%K ipl
%V 22
%N 3
%D March 1986
%P 147-149

%A E.J. Cockayne
%A D.E. Hewgill
%T Exact computation of Steiner minimal trees in the plane
%J Information Processing Letters
%K ipl
%V 22
%N 3
%D March 1986
%P 151-156

%A Robert C. Shock
%T Computing the minimum cover of functional dependencies
%J Information Processing Letters
%K ipl
%V 22
%N 3
%D March 1986
%P 157-159

%A Michael Kallay
%T COnvex hull made easy
%J Information Processing Letters
%K ipl
%V 22
%N 3
%D March 1986
%P 161

%A Brigitte Jaumard
%A Michel Minoux
%T An efficient algorithm for the transitive closure
and a linear worst-case complexity result for a class of sparse graphs
%J Information Processing Letters
%K ipl
%V 22
%N 4
%D April 1986
%P 163-169

%A J. Mark Keil
%T Total domination in interval graphs
%J Information Processing Letters
%K ipl
%V 22
%N 4
%D April 1986
%P 171-174

%A Wolfgang Panny
%T A note on the higher moments
of the expected behavior of straight insertion sort
%J Information Processing Letters
%K ipl
%V 22
%N 4
%D April 1986
%P 175-177

%A Mark C. Hamburg
%T Two tagless variations on the Deutch-Schorr-Waite algorithm
%J Information Processing Letters
%K ipl
%V 22
%N 4
%D April 1986
%P 179-183
%K marking, garbage collection

%A Michael C. Loui
%A Teresa A. Matsushita
%A Douglas B. West
%T Election in a complete network with a sense of direction
%J Information Processing Letters
%K ipl
%V 22
%N 4
%D April 1986
%P 185-187

%A Svante Carlsson
%T Splitmerge - a fast stable merging algorithm
%J Information Processing Letters
%K ipl
%V 22
%N 4
%D April 1986
%P 189-192

%A B. Codenotti
%A G. Lotti
%T A note on the VLSI counter
%J Information Processing Letters
%K ipl
%V 22
%N 4
%D April 1986
%P 193-195

%A Hania Gajewska
%A Robert E. Tarjan
%T Deques with heap order
%J Information Processing Letters
%K ipl
%V 22
%N 4
%D April 1986
%P 197-200

%A Dana Richards
%T Data compression and Gray-code sorting
%J Information Processing Letters
%K ipl
%V 22
%N 4
%D April 1986
%P 201-205

%A Key-Sun Choi
%A Gil Chang Kim
%T A controlled quantification in parsing of Montague grammar
%J Information Processing Letters
%K ipl
%V 22
%N 4
%D April 1986
%P 207-216

%A P.T. Highnam
%T Optimal algorithms for finding the symmetries of a planar point set
%J Information Processing Letters
%K ipl
%V 22
%N 5
%D April 1986
%P 219-222

%A Shaunak Pawagi
%A I.V. Ramakrishnan
%T An O(log n) algorithm for parallel update of minimum spanning trees
%J Information Processing Letters
%K ipl
%V 22
%N 5
%D April 1986
%P 223-229

%A Ming Li
%A Yaacov Yesha
%T String matching cannot be done
by a two-head one-way deterministic finite automaton
%J Information Processing Letters
%K ipl
%V 22
%N 5
%D April 1986
%P 231-235

%A John B. Evans
%T Experiments with trees for the storage and retrieval of future events
%J Information Processing Letters
%K ipl
%V 22
%N 5
%D April 1986
%P 237-242

%A G.K. Gupta
%A B. Srinivasan
%T Approximate storage utilization of B-trees
%J Information Processing Letters
%K ipl
%V 22
%N 5
%D April 1986
%P 243-246

%A Paul Bourret
%A R. Souza de\ Oliviera
%T Lower and upper bounds of the sizes of domains: estimates and experiments
%J Information Processing Letters
%K ipl
%V 22
%N 5
%D April 1986
%P 247-253

%A Herbert J. Bernstein
%T Determining the shape of a convex n-sided polygon
by using 2n+k tactile probes
%J Information Processing Letters
%K ipl
%V 22
%N 5
%D April 1986
%P 255-260

%A Arthur M. Keller
%T Set-theoretic problems of null completion in relational databases
%J Information Processing Letters
%K ipl
%V 22
%N 5
%D April 1986
%P 261-265

%A Yannis Manolopoulos
%T Batched search of index sequential files
%J Information Processing Letters
%K ipl
%V 22
%N 5
%D April 1986
%P 267-272

%A Timo O. Alanko
%A R.L. Smelianski
%T On the calculation of control transition probabilities in a program
%J Information Processing Letters
%K ipl
%V 22
%N 5
%D April 1986
%P 273-276

%A Wojciech Rytter
%T The space complexity of the unique decipherability problem
%J Information Processing Letters
%K ipl
%V 23
%N 1
%D July 1986
%P 1-3

%A Ferng-Ching Lin
%A Wei-Kuan Shih
%T Long edges in the layouts
of shuffle-exchange and cube-connected cycles graphs
%J Information Processing Letters
%K ipl
%V 23
%N 1
%D July 1986
%P 5-9

%A G. Tinhofer
%A H. Schreck
%T The bounded subset problem is almost everywhere randomly decidable in O(n)
%J Information Processing Letters
%K ipl
%V 23
%N 1
%D July 1986
%P 11-17

%A Hartmut Schmeck
%T On the maximum edge length in VLSI layouts of complete binary trees
%J Information Processing Letters
%K ipl
%V 23
%N 1
%D July 1986
%P 19-23

%A Jose L. Balcazar
%T On DELTA(P, 2)-immunity
%J Information Processing Letters
%K ipl
%V 23
%N 1
%D July 1986
%P 25-28

%A Karel Culik,\ II
%A Junahi Karhumaki
%T A note on the equivalence problem of rational formal power series
%J Information Processing Letters
%K ipl
%V 23
%N 1
%D July 1986
%P 29-31

%A K. Kakuta
%A H. Nakamura
%A S. Iida
%T A parallel reference counting algorithm
%J Information Processing Letters
%K ipl
%V 23
%N 1
%D July 1986
%P 33-37

%A Bernd-Jurgen Falkowski
%A Lothar Schmitz
%T A note on the queen's problem
%J Information Processing Letters
%K ipl
%V 23
%N 1
%D July 1986
%P 39-46

%A O.M. Vikas
%A Suresh Kumar Basandra
%T Data algebra and its application in database design
%J Information Processing Letters
%K ipl
%V 23
%N 1
%D July 1986
%P 47-54

%A Ivan Lavalle
%A Gerard Roucairol
%T A fully distributed (minimal) spanning tree algorithm
%J Information Processing Letters
%K ipl
%V 23
%N 2
%D August 1986
%P 55-62

%A Alberto Apostolico
%T Improving the worst-case performance of the Hunt-Szymanski strategy
for the longest common subsequence of two strings
%J Information Processing Letters
%K ipl
%V 23
%N 2
%D August 1986
%P 63-69

%A Hans Rohnert
%T Shortest paths in the plane with convex polygonal obstacles
%J Information Processing Letters
%K ipl
%V 23
%N 2
%D August 1986
%P 71-76

%A Rob R. Hoogerwoord
%T An implementation of mutual inclusion
%J Information Processing Letters
%K ipl
%V 23
%N 2
%D August 1986
%P 77-80

%A Wojciech Rytter
%T An application of Mehlhorn's algorithm for bracket languages
to log(n) space recognition of input-driven languages
%J Information Processing Letters
%K ipl
%V 23
%N 2
%D August 1986
%P 81-84

%A Janusz Laski
%T An algorithm for the derivation of codefinitions in computer programs
%J Information Processing Letters
%K ipl
%V 23
%N 2
%D August 1986
%P 85-90

%A J.K. Annot
%A M.D. Jassens
%A A.J. van\ de\ Goor
%T Comments on Morris's starvation-free solution to the mutual exclusion problem
%J Information Processing Letters
%K ipl
%V 23
%N 2
%D August 1986
%P 91-97

%A Simeon Ntafos
%T On gallery watchmen in grids
%J Information Processing Letters
%K ipl
%V 23
%N 2
%D August 1986
%P 99-102

%A John Franco
%T On the probabilistic performance of algorithms for the satisfiability problem
%J Information Processing Letters
%K ipl
%V 23
%N 2
%D August 1986
%P 103-106

%A Bruno Codenotti
%A Grazia Lotti
%T Area-time tradeoffs for bilinear forms computations in VLSI
%J Information Processing Letters
%K ipl
%V 23
%N 2
%D August 1986
%P 107-109

%A Brudo Codenotti
%A Grazia Lotti
%T A VLSI fast solver for tridiagonal linear systems
%J Information Processing Letters
%K ipl
%V 23
%N 3
%D October 1986
%P 111-114

%A A.M. Makarov
%T A noncommutative algorithm for multiplying 5*5 matrices
using 102 multiplications
%J Information Processing Letters
%K ipl
%V 23
%N 3
%D October 1986
%P 115-117

%A Ten-Hwang Lai
%A Alan Sprague
%T A note on anomalies in parallel branch-and-bound algorithms
with one-to-one bounding functions
%J Information Processing Letters
%K ipl
%V 23
%N 3
%D October 1986
%P 119-122

%A Jack Cooper
%A Selim G. Akl
%T Efficient selection on a binary tree
%J Information Processing Letters
%K ipl
%V 23
%N 3
%D October 1986
%P 123-126

%A Patricio V. Poblette
%T Approximating functions by their Poisson transform
%J Information Processing Letters
%K ipl
%V 23
%N 3
%D October 1986
%P 127-130

%A Alan A. Bertossi
%T Total domination in interval graphs
%J Information Processing Letters
%K ipl
%V 23
%N 3
%D October 1986
%P 131-134

%A Wojciech Szpankowski
%T On an asymptotic analysis of tree-type algorithm for broadcast communications
%J Information Processing Letters
%K ipl
%V 23
%N 3
%D October 1986
%P 135-142

%A Klaus W. Wagner
%T On the intersection of the class of linear context-free languages
and the class of single-reset languages
%J Information Processing Letters
%K ipl
%V 23
%N 3
%D October 1986
%P 143-146

%A G. Mints
%A R. Tyugu
%T Semantics of a declarative language
%J Information Processing Letters
%K ipl
%V 23
%N 3
%D October 1986
%P 147-151

%A Kazem Taghva
%T Some characterizations
of finitely specifiable implicational dependency families
%J Information Processing Letters
%K ipl
%V 23
%N 3
%D October 1986
%P 153-158

%A Jan Tijmen Udding
%T Absence of individual starvation using weak semaphores
%J Information Processing Letters
%K ipl
%V 23
%N 3
%D October 1986
%P 159-162

%A Patrick Dehornoy
%T Turing complexity of the ordinals
%J Information Processing Letters
%K ipl
%V 23
%N 4
%D November 1986
%P 167-170

%A M. Latteux
%A E. Timmerman
%T Finitely generated omega-languages
%J Information Processing Letters
%K ipl
%V 23
%N 4
%D November 1986
%P 171-175

%A Bowen Alpern
%A Alan J. Demers
%A Fred B. Schneider
%T Safety without stuttering
%J Information Processing Letters
%K ipl
%V 23
%N 4
%D November 1986
%P 177-180

%A David R. O'Hallaron
%A Paul F. Reynolnds,\ Jr.
%T A generalized deadlock predicate
%J Information Processing Letters
%K ipl
%V 23
%N 4
%D November 1986
%P 181-188

%A Lenore Blum
%T Towards an asymptotic analysis of Karmarkar's algorithm
%J Information Processing Letters
%K ipl
%V 23
%N 4
%D November 1986
%P 189-194

%A Alan A. Bertossi
%A Maurizio Bonuccelli
%T Hamiltonian circuits in interval graph generalizations
%J Information Processing Letters
%K ipl
%V 23
%N 4
%D November 1986
%P 195-200

%A Susumu Yamasaki
%A Shuji Doshita
%T Resolution deduction to detect satisfiability for another class
including non-Horn sentences in propositional logic
%J Information Processing Letters
%K ipl
%V 23
%N 4
%D November 1986
%P 201-207

%A Dan Gordon
%T Eliminating the flag in threaded binary search trees
%J Information Processing Letters
%K ipl
%V 23
%N 4
%D November 1986
%P 209-214

%A O.J. Murphy
%A S.M. Selkow
%T The efficiency of using k-d trees
for finding nearest neighbors in discrete space
%J Information Processing Letters
%K ipl
%V 23
%N 4
%D November 1986
%P 215-218

%A R. Sommerhalder
%A S.C. van\ Westrhenen
%T A parallel O(log n) algorithm
for the drawing of algebraic curves in an n*n square
%J Information Processing Letters
%K ipl
%V 23
%N 5
%D November 1986
%P 221-226

%A Klaus Ambos-Spies
%T A note on complete problems for complexity classes
%J Information Processing Letters
%K ipl
%V 23
%N 5
%D November 1986
%P 227-230

%A Jan L.A. van\ de\ Snepscheut
%A Jan Tijmen Udding
%T An alternative implementation of communication primitives
%J Information Processing Letters
%K ipl
%V 23
%N 5
%D November 1986
%P 231-238

%A David John Evans
%A Nadia Y. Yousif
%T Merging by the parallel jump searching algorithm
%J Information Processing Letters
%K ipl
%V 23
%N 5
%D November 1986
%P 239-246

%A G. Chen
%A M.H. Williams
%T The value of an array facility in Prolog
%J Information Processing Letters
%K ipl
%V 23
%N 5
%D November 1986
%P 247-251

%A Manfred Broy
%T Denotational semantics of communicating sequential programs
%J Information Processing Letters
%K ipl
%V 23
%N 5
%D November 1986
%P 253-259

%A Jordan Stojanovski
%T A note on implementing Prolog in Lisp
%J Information Processing Letters
%K ipl
%V 23
%N 5
%D November 1986
%P 261-264

%A C.C. Handley
%T An in situ distributive sort
%J Information Processing Letters
%K ipl
%V 23
%N 5
%D November 1986
%P 265-270

%A Erkki Makinen
%T A note on pure grammars
%J Information Processing Letters
%K ipl
%V 23
%N 5
%D November 1986
%P 271-274

%A Ernst L. Leiss
%T The inaccessible set:
a classification by query type of security risks in statistical databases
%J Information Processing Letters
%K ipl
%V 23
%N 6
%D December 1986
%P 275-279

%A Michele Benois
%A Jacques Sakarovich
%T On the complexity of some extended word problems
defined by cancellation rules
%J Information Processing Letters
%K ipl
%V 23
%N 6
%D December 1986
%P 281-287

%A Herbert Edelsbrunner
%A Emo Welzl
%T Halfplanar range search in linear space and O(n^0.695) query time
%J Information Processing Letters
%K ipl
%V 23
%N 6
%D December 1986
%P 289-293

%A Alain J. Martin
%T A new generalization of Dekker's algorithm for mutual exclusion
%J Information Processing Letters
%K ipl
%V 23
%N 6
%D December 1986
%P 295-297

%A Leszek Holenderski
%T The correctness of nondeterministic programs revisited
%J Information Processing Letters
%K ipl
%V 23
%N 6
%D December 1986
%P 299-303

%A Lloyd Allison
%A Trevor I. Dix
%T A bit-string longest-common-subsequence algorithm
%J Information Processing Letters
%K ipl
%V 23
%N 6
%D December 1986
%P 305-310

%A Kwang-Moo Choe
%A Chun-Hyon Chang
%T Efficient computation of the locally least-cost insertion string
for the LR error repair
%J Information Processing Letters
%K ipl
%V 23
%N 6
%D December 1986
%P 311-316

%A Frank Harary
%A Peter J. Slater
%T A linear algorithm for the cutting center of a tree
%J Information Processing Letters
%K ipl
%V 23
%N 6
%D December 1986
%P 317-319

%A Richard B. Kieburtz
%T When chasing your tail saves time
%J Information Processing Letters
%K ipl
%V 23
%N 6
%D December 1986
%P 321-324

%A Ikuo Nakata
%A Masataka Sassa
%T L-attributed LL(1)-grammars are LR-attributed
%J Information Processing Letters
%K ipl
%V 23
%N 6
%D December 1986
%P 325-328