%A Athanasios Alexandrakis
%A Symeon Bozapalidis
%T Weighted grammars and Kleene's theorem
%J Information Processing Letters
%K ipl
%V 24
%N 1
%D January 1987
%P 1-4

%A Stuart A. Kurtz
%A Michael J. O'Donnell
%A James S. Royer
%T How to prove representation-independent independence results
%J Information Processing Letters
%K ipl
%V 24
%N 1
%D January 1987
%P 5-10

%A W.H.J. Feijen
%A A.J.M. van\ Gasteren
%A David Gries
%T In-situ conversion of a cyclic permutation
%J Information Processing Letters
%K ipl
%V 24
%N 1
%D January 1987
%P 11-14

%A Taenam Kim
%A Kyung-Yong Chwa
%T An O(n log n log log n) parallel maximum matching algorithm
for bipartite graphs
%J Information Processing Letters
%K ipl
%V 24
%N 1
%D January 1987
%P 15-17

%A Peter Hochschild
%T Multiple cuts, input repetition, and VLSI complexity
%J Information Processing Letters
%K ipl
%V 24
%N 1
%D January 1987
%P 19-24

%A Rapahel Finkel
%A Hari H. Madduri
%T An efficient deadlock avoidance algorithm
%J Information Processing Letters
%K ipl
%V 24
%N 1
%D January 1987
%P 25-30

%A Masataka Sassa
%A Harushi Ishizuka
%A Ikuo Nakata
%T ECLR-attributed grammars: a practical class of LR-attributed grammars
%J Information Processing Letters
%K ipl
%V 24
%N 1
%D January 1987
%P 31-41

%A A.J. Bernstein
%T Predicate transfer and timeout in message-passing systems
%J Information Processing Letters
%K ipl
%V 24
%N 1
%D January 1987
%P 43-52

%A R.S. Bird
%A John Hughes
%T The alpha-beta algorithm: an exercise in program transformation
%J Information Processing Letters
%K ipl
%V 24
%N 1
%D January 1987
%P 53-57

%A Toshitsugu Yuba
%A Mamoru Hoshi
%T Binary search networks: a new method for key searching
%J Information Processing Letters
%K ipl
%V 24
%N 1
%D January 1987
%P 59-65

%A V. Arvind
%A S. Biswas
%T An O(n^2) algorithm for the satisfiability problem
of a subset of propositional sentences in CNF that includes all Horn sentences
%J Information Processing Letters
%K ipl
%V 24
%N 1
%D January 1987
%P 67-69

%A Maciej Slusarek
%T An off-line storage allocation algorithm
%J Information Processing Letters
%K ipl
%V 24
%N 2
%D January 1987
%P 71-75

%A E. Allen Emerson
%T Uniform inevitability is tree automation ineffable
%J Information Processing Letters
%K ipl
%V 24
%N 2
%D January 1987
%P 77-79

%A Anne Grazon
%T An infinite word language which is not co-CFL
%J Information Processing Letters
%K ipl
%V 24
%N 2
%D January 1987
%P 81-85

%A Ouri Wolfson
%T Concurrent execution of transaction copies
%J Information Processing Letters
%K ipl
%V 24
%N 2
%D January 1987
%P 87-93

%A Dan Field
%T A note on a new data structure for in-the-past queries
%J Information Processing Letters
%K ipl
%V 24
%N 2
%D January 1987
%P 95-96

%A Claudio Rey
%A Rabab Ward
%T On determining the on-line minimax linear fit to a discrete point set
%J Information Processing Letters
%K ipl
%V 24
%N 2
%D January 1987
%P 97-101

%A Bogdan Korel
%T The program dependence graph in static program testing
%J Information Processing Letters
%K ipl
%V 24
%N 2
%D January 1987
%P 103-108

%A Georg Gottlob
%T Subsumption and implication
%J Information Processing Letters
%K ipl
%V 24
%N 2
%D January 1987
%P 109-111

%A Masataka Sassa
%A Ikuo Nakata
%T A simple realization of LR-parsers for regular right part grammars
%J Information Processing Letters
%K ipl
%V 24
%N 2
%D January 1987
%P 113-120

%A Richard Anderson
%A Ernst W. Mayr
%T Parallelism and the maximal path problem
%J Information Processing Letters
%K ipl
%V 24
%N 2
%D January 1987
%P 121-126

%A C.A.R. Hoare
%A H.E. Jifeng
%T The weakest prespecification
%J Information Processing Letters
%K ipl
%V 24
%N 2
%D January 1987
%P 127-132

%A Mihalis Yannakakis
%A Fanica Gavril
%T The maximum colorable subgraph problem for chordal graphs
%J Information Processing Letters
%K ipl
%V 24
%N 2
%D January 1987
%P 133-137

%A Marek Kubale
%T The complexity of scheduling independent two-processor tasks
on dedicated processors
%J Information Processing Letters
%K ipl
%V 24
%N 3
%D February 1987
%P 141-147

%A Mark W. Krentel
%T A note on the transaction backout problem
%J Information Processing Letters
%K ipl
%V 24
%N 3
%D February 1987
%P 149-152

%A Richard P. Anstee
%T A polynomial algorithm for b-matchings: an alternative approach
%J Information Processing Letters
%K ipl
%V 24
%N 3
%D February 1987
%P 153-157

%A M. Roussille
%A P. Dofour
%T Generation of convex polygons with individual angular constraints
%J Information Processing Letters
%K ipl
%V 24
%N 3
%D February 1987
%P 159-164

%A W.F. McColll
%A M.S. Paterson
%T The planar realization of boolean functions
%J Information Processing Letters
%K ipl
%V 24
%N 3
%D February 1987
%P 165-170

%A Dung T. Huynh
%T On solving hard problems by polynomial-size circuits
%J Information Processing Letters
%K ipl
%V 24
%N 3
%D February 1987
%P 171-176

%A Dick Grune
%T How to compare the incomparable
%J Information Processing Letters
%K ipl
%V 24
%N 3
%D February 1987
%P 177-181

%A M. Castan
%A M.-H. Durand
%A M. Lemaitre
%T A set of combinators for abstraction in linear space
%J Information Processing Letters
%K ipl
%V 24
%N 3
%D February 1987
%P 183-188

%A D.C. van\ Leijenhorst
%A Th.P. van\ der\ Weide
%T On a recursion connected with tree balancing algorithms
%J Information Processing Letters
%K ipl
%V 24
%N 3
%D February 1987
%P 189-192

%A Varol Akman
%T An algorithm for determining an opaque minimal forest of a convex polygon
%J Information Processing Letters
%K ipl
%V 24
%N 3
%D February 1987
%P 193-198

%A Michel Raynal
%T A distributed algorithm to prevent mutual drift between n logical clocks
%J Information Processing Letters
%K ipl
%V 24
%N 3
%D February 1987
%P 199-202

%A Leonard Pitt
%T A note on extending Knuth's tree estimator to directed acyclic graphs
%J Information Processing Letters
%K ipl
%V 24
%N 3
%D February 1987
%P 203-206

%A D.J. Evans
%A W.S. Yousif
%T Explicit solution of block tridiagonal systems of linear equations
%J Information Processing Letters
%K ipl
%V 24
%N 3
%D February 1987
%P 207-209

%A Jan L.A. van\ de\ Snepschut
%T "Algorithms for on-the-fly garbage collection" revisited
%J Information Processing Letters
%K ipl
%V 24
%N 4
%D March 1987
%P 211-216

%A Shaunak R. Pawagi
%A P.S. Gopalakrishnan
%A I.V. Ramakrishnan
%T Computing dominators in parallel
%J Information Processing Letters
%K ipl
%V 24
%N 4
%D March 1987
%P 217-221

%A D.C. van\ Leijenhorst
%T A note on the formula size of the "mod k" functions
%J Information Processing Letters
%K ipl
%V 24
%N 4
%D March 1987
%P 223-224

%A M. Zubair
%A B.B. Madan
%T Time efficient systolic architecture for matrix * vector multiplication
%J Information Processing Letters
%K ipl
%V 24
%N 4
%D March 1987
%P 225-231

%A Dario Bini
%A Victor Ya. Pan
%T A logarithmic boolean time algorithm for parallel polynomial division
%J Information Processing Letters
%K ipl
%V 24
%N 4
%D March 1987
%P 233-237

%A Anders Edenbrandt
%T Chordal graph recognition is in NC
%J Information Processing Letters
%K ipl
%V 24
%N 4
%D March 1987
%P 239-241

%A Prakash Ramanan
%T Obtaining lower bounds using artificial components
%J Information Processing Letters
%K ipl
%V 24
%N 4
%D March 1987
%P 243-246

%A Svante Carlsson
%T A variant of heapsort with almost optimal number of comparisons
%J Information Processing Letters
%K ipl
%V 24
%N 4
%D March 1987
%P 247-250

%A Martin Charles Glumbic
%T A general method for avoiding cycling in a network
%J Information Processing Letters
%K ipl
%V 24
%N 4
%D March 1987
%P 251-253

%A Silvio Romero de\ Lemos Meira
%T Strict combinators
%J Information Processing Letters
%K ipl
%V 24
%N 4
%D March 1987
%P 255-258

%A J. Blazewicz
%A G. Finke
%T Minimizing mean weighted execution time loss
on identical and uniform processors
%J Information Processing Letters
%K ipl
%V 24
%N 4
%D March 1987
%P 259-263

%A R. Nigel Horspool
%A Michael R. Levy
%T Correctness of an extended operator-precedence parsing algorithm
%J Information Processing Letters
%K ipl
%V 24
%N 4
%D March 1987
%P 265-273

%A Jonathan Ruby
%T A liveness property of a parallel algorithm
%J Information Processing Letters
%K ipl
%V 24
%N 4
%D March 1987
%P 275-277

%A Jayme Luiz Szwarcfiter
%T A note on the computation of the k-closure of a graph
%J Information Processing Letters
%K ipl
%V 24
%N 4
%D March 1987
%P 279-280

%A Klaus Madlener
%A Friedrich Otto
%T Using string-rewriting
for solving the word problem for finitely presented groups
%J Information Processing Letters
%K ipl
%V 24
%N 5
%D March 1987
%P 281-284

%A Takao Asano
%A Tetsuo Asano
%A Hiroshi Imai
%T Shortest path between two simple polygons
%J Information Processing Letters
%K ipl
%V 24
%N 5
%D March 1987
%P 285-288

%A M.D. Atkinson
%A H.W. Chang
%T Computing the number of mergings with constraints
%J Information Processing Letters
%K ipl
%V 24
%N 5
%D March 1987
%P 289-292

%A Cyrus Hazari
%A Hussein Zedan
%T A distributed algorithm for distributed termination
%J Information Processing Letters
%K ipl
%V 24
%N 5
%D March 1987
%P 293-297

%A Gregers Koch
%T Automating the semantic component
%J Information Processing Letters
%K ipl
%V 24
%N 5
%D March 1987
%P 299-305

%A D.S. Hirschberg
%A Dennis James Volper
%T Improved update/query algorithms for the interval valuation problem
%J Information Processing Letters
%K ipl
%V 24
%N 5
%D March 1987
%P 307-310

%A Ernest J.H. Chang
%A Gaston H. Gonnet
%A Doron Rotem
%T On the costs of self-stabilization
%J Information Processing Letters
%K ipl
%V 24
%N 5
%D March 1987
%P 311-316

%A Mark Valentine
%A Robert H. Davis
%T The automated solution of logic puzzles
%J Information Processing Letters
%K ipl
%V 24
%N 5
%D March 1987
%P 317-324

%A Marek Chrobak
%A Wojciech Rytter
%T Remarks on string-matching and one-way multihead automata
%J Information Processing Letters
%K ipl
%V 24
%N 5
%D March 1987
%P 325-329

%A R.D. Tennent
%T A note on undefined execution values in programming logics
%J Information Processing Letters
%K ipl
%V 24
%N 5
%D March 1987
%P 331-333

%A Peter Widmayer
%A Derick Wood
%T Time- and space-optimal contour computation for a set of rectangles
%J Information Processing Letters
%K ipl
%V 24
%N 5
%D March 1987
%P 335-338

%A Michael B. Dillencourt
%T Traveling salesman cycles are not always subgraphs
of Delaunay triangulations or of minimum weight triangulations
%J Information Processing Letters
%K ipl
%V 24
%N 5
%D March 1987
%P 339-342

%A J.R. Kennaway
%A M.R. Sleep
%T Variable abstraction in O(n log n) space
%J Information Processing Letters
%K ipl
%V 24
%N 5
%D March 1987
%P 343-349

%A Heinrich Muller
%T Sorting numbers using limited systolic coprocessors
%J Information Processing Letters
%K ipl
%V 24
%N 6
%D April 1987
%P 351-354

%A Georg Gottlob
%T On the size of nonredundant FD-covers
%J Information Processing Letters
%K ipl
%V 24
%N 6
%D April 1987
%P 355-360

%A Andrzej Szepietowski
%T There are no fully space constructible functions between log log n and log n
%J Information Processing Letters
%K ipl
%V 24
%N 6
%D April 1987
%P 361-362

%A Ian Parberry
%T An improved simulation of space and reversal bounded deterministic
Turing machines by width and depth bounded uniform circuits
%J Information Processing Letters
%K ipl
%V 24
%N 6
%D April 1987
%P 363-367

%A Hanan Samet
%A Clifford A. Shaffer
%A Robert E. Webber
%T Digitizing the plane with cells of nonuniform size
%J Information Processing Letters
%K ipl
%V 24
%N 6
%D April 1987
%P 369-375

%A Anselm Blumer
%A Andrzej Ehrenfeucht
%A David Haussler
%A Manfred K. Warmuth
%T Occam's razor
%J Information Processing Letters
%K ipl
%V 24
%N 6
%D April 1987
%P 377-380
%K machine learning

%A M. Bajantri
%A David B. Skillicorn
%T A fast multiprocessor message passing implementation
%J Information Processing Letters
%K ipl
%V 24
%N 6
%D April 1987
%P 381-389

%A Chritopher W. Fraser
%A David R. Hanson
%T Optimization of argument evaluation order
%J Information Processing Letters
%K ipl
%V 24
%N 6
%D April 1987
%P 391-395

%A Raymond Marie
%A Kishor S. Trivedi
%T A note on the effect of preemptive policies
on the stability of a priority queue
%J Information Processing Letters
%K ipl
%V 24
%N 6
%D April 1987
%P 397-401

%A William E. Wright
%T A note on external sorting using almost single input buffering
%J Information Processing Letters
%K ipl
%V 24
%N 6
%D April 1987
%P 403-405

%A M.K. Sridhar
%T A new algorithm for parallel solution of linear equations
%J Information Processing Letters
%K ipl
%V 24
%N 6
%D April 1987
%P 407-412

%A Herbert Edelsbrunner
%A Mark H. Overmars
%T Zooming by repeated range detection
%J Information Processing Letters
%K ipl
%V 24
%N 6
%D April 1987
%P 413-417

%A Jik H. Chang
%A Oscar H. Ibarra
%A Bala Ravikumar
%A Leonard Berman
%T Some observations concerning alternating Turing machines using small space
%J Information Processing Letters
%K ipl
%V 25
%N 1
%D April 1987
%P 1-9

%A Avraham A. Melkman
%T On-line construction of the convex hull of a simple polyline
%J Information Processing Letters
%K ipl
%V 25
%N 1
%D April 1987
%P 11-12

%A Bernd Kirsig
%A Klaus-Jorn Lange
%T Separation with the Ruzzo, Simon and Tompa relativization
implies DSPACE(log n) not equal to NSPACE(log n)
%J Information Processing Letters
%K ipl
%V 25
%N 1
%D April 1987
%P 13-15

%A Richard G. Hamlet
%T Probable correctness theory
%J Information Processing Letters
%K ipl
%V 25
%N 1
%D April 1987
%P 17-25

%A Rodney R. Howell
%A Louis E. Rosier
%A Hsu-Chun Yen
%T An O(n^1.5) algorithm to decide boundedness
for conflict-free vector replacement systems
%J Information Processing Letters
%K ipl
%V 25
%N 1
%D April 1987
%P 27-33

%A George Cybenko
%A David W. Krumme
%A K.N. Venkataraman
%T Fixed hypercube embedding
%J Information Processing Letters
%K ipl
%V 25
%N 1
%D April 1987
%P 35-39

%A Jean-Paul Laumond
%T Obstacle growing in a nonpolygonal world
%J Information Processing Letters
%K ipl
%V 25
%N 1
%D April 1987
%P 41-50

%A Joseph Naor
%T A fast parallel coloring of planar graphs with five colors
%J Information Processing Letters
%K ipl
%V 25
%N 1
%D April 1987
%P 51-53

%A Cao An Wang
%A Yung H. Tsin
%T An O(log n) time parallel algorithm
for triangulating a set of points in the plane
%J Information Processing Letters
%K ipl
%V 25
%N 1
%D April 1987
%P 55-60

%A Gary A. Hyslop
%A Edmund A. Lamagna
%T Performance of distributive partitioned sort in a demand paging environment
%J Information Processing Letters
%K ipl
%V 25
%N 1
%D April 1987
%P 61-64

%A John H. Reif
%T A topological approach to dynamic graph connectivity
%J Information Processing Letters
%K ipl
%V 25
%N 1
%D April 1987
%P 65-70

%A C.A.R. Hoare
%A Jifeng He
%A J.W. Sanders
%T Prespecification in data refinement
%J Information Processing Letters
%K ipl
%V 25
%N 2
%D May 1987
%P 71-76

%A Jyrki Katajainen
%A Olli Nevalainen
%A Jukka Teuhola
%T A linear expected-time algorithm
for computing planar relative neighborhood graphs
%J Information Processing Letters
%K ipl
%V 25
%N 2
%D May 1987
%P 77-86

%A Mikhail Atallah
%A Chanderjit Bajaj
%T Efficient algorithms for common transversals
%J Information Processing Letters
%K ipl
%V 25
%N 2
%D May 1987
%P 87-91

%A Manfred Broy
%T Predicative specifications
for functional programs describing communicating networks
%J Information Processing Letters
%K ipl
%V 25
%N 2
%D May 1987
%P 93-101

%A K.B. Lakshmanan
%A N. Meenakshi
%A K. Thulasiraman
%T A time-optimal message-efficient distributed algorithm for depth-first search
%J Information Processing Letters
%K ipl
%V 25
%N 2
%D May 1987
%P 103-109

%A A.M. Frieze
%T Parallel algorithms for finding Hamiltonian cycles in random graphs
%J Information Processing Letters
%K ipl
%V 25
%N 2
%D May 1987
%P 111-117

%A F. Miller Maley
%T An observation concerning constraint-based compaction
%J Information Processing Letters
%K ipl
%V 25
%N 2
%D May 1987
%P 119-122

%A V.J. Rayward-Smith
%T The complexity of preemptive scheduling
given interprocessor communication delays
%J Information Processing Letters
%K ipl
%V 25
%N 2
%D May 1987
%P 123-125

%A Ravi B. Boppana
%A Johan Hastad
%A Stathis Zachos
%T Does co-NP have short interactive proofs ?
%J Information Processing Letters
%K ipl
%V 25
%N 2
%D May 1987
%P 127-132

%A R.D. Tennent
%T Quantification in Algol-like languages
%J Information Processing Letters
%K ipl
%V 25
%N 2
%D May 1987
%P 133-137

%A Yoshihito Toyama
%T Counterexamples to termination for the direct sum of term rewriting systems
%J Information Processing Letters
%K ipl
%V 25
%N 3
%D May 1987
%P 141-143

%A J. Pierre Verjus
%T On the proof of a distributed algorithm
%J Information Processing Letters
%K ipl
%V 25
%N 3
%D May 1987
%P 145-147

%A Michael B. Dillencourt
%T A non-Hamiltonian, nondegenerate Delaunay triangulation
%J Information Processing Letters
%K ipl
%V 25
%N 3
%D May 1987
%P 149-151

%A Ten H. Lai
%A Tao H. Yang
%T On distributed snapshots
%J Information Processing Letters
%K ipl
%V 25
%N 3
%D May 1987
%P 153-158

%A Andrew Klapper
%T A lower bound on the complexity
of the convex hull problem for simple polyhedra
%J Information Processing Letters
%K ipl
%V 25
%N 3
%D May 1987
%P 159-161

%A Ozalp Babaoglu
%T Stopping times of distributed consensus protocols: a probabilistic analysis
%J Information Processing Letters
%K ipl
%V 25
%N 3
%D May 1987
%P 163-169

%A Satoru Kawai
%T Local authentication in insecure environments
%J Information Processing Letters
%K ipl
%V 25
%N 3
%D May 1987
%P 171-174

%A Michael J. Fischer
%A Neil Immerman
%T Interpreting logics of knowledge in propositional dynamic logic with converse
%J Information Processing Letters
%K ipl
%V 25
%N 3
%D May 1987
%P 175-181

%A Tae-Choong Chung
%A Jung-Wan Cho
%T History sensitive string for multiple alphabets
%J Information Processing Letters
%K ipl
%V 25
%N 3
%D May 1987
%P 183-188

%A T.H. Tse
%T On the detection of unstructuredness in flowgraphs
%J Information Processing Letters
%K ipl
%V 25
%N 3
%D May 1987
%P 189-193

%A Dieter Zobel
%T Transformations for communication fairness in CSP
%J Information Processing Letters
%K ipl
%V 25
%N 3
%D May 1987
%P 195-198

%A N.A. Alexandridis
%A P.D. Tsanakas
%T An encoding scheme
for the efficient representation of hierarchical image structures
%J Information Processing Letters
%K ipl
%V 25
%N 3
%D May 1987
%P 199-206

%A Joseph M. Morris
%T Varieties of weakest liberal preconditions
%J Information Processing Letters
%K ipl
%V 25
%N 3
%D May 1987
%P 207-210

%A Jean-Michel Autebert
%A Philippe Flajolet
%A Joaquim Gabarro
%T Prefixes of infinite words and ambiguous context-free languages
%J Information Processing Letters
%K ipl
%V 25
%N 4
%D June 1987
%P 211-216

%A Bettina Brustmann
%A Ingo Wegener
%T The complexity of symmetric functions in bounded-depth circuits
%J Information Processing Letters
%K ipl
%V 25
%N 4
%D June 1987
%P 217-219

%A Edward Ochmanski
%T Inevitability in concurrent systems
%J Information Processing Letters
%K ipl
%V 25
%N 4
%D June 1987
%P 221-225

%A Rainer Kemp
%T A note on the number of leftist trees
%J Information Processing Letters
%K ipl
%V 25
%N 4
%D June 1987
%P 227-232

%A J.G. Wiltink
%T A deficiency of natural deduction
%J Information Processing Letters
%K ipl
%V 25
%N 4
%D June 1987
%P 233-234

%A Alberto Apostolico
%T Remark on the Hsu-Du new algorithm for the longest common subsequence problem
%J Information Processing Letters
%K ipl
%V 25
%N 4
%D June 1987
%P 235-236

%A David Gries
%A Adriano Pascoletti
%A Luigi Sbriz
%T Horner's rule and the computation of linear recurrences
%J Information Processing Letters
%K ipl
%V 25
%N 4
%D June 1987
%P 237-240

%A Andrew V. Goldberg
%A Serge A. Plotkin
%T Parallel (Delta + 1)-coloring of constant-degree graphs
%J Information Processing Letters
%K ipl
%V 25
%N 4
%D June 1987
%P 241-245

%A Christos Levcopoulos
%T An Omega(sqrt n) lower bound
for the nonoptimality of the greedy triangulation
%J Information Processing Letters
%K ipl
%V 25
%N 4
%D June 1987
%P 247-251

%A Matthias Reichling
%T A simplified solution of the N queens' problem
%J Information Processing Letters
%K ipl
%V 25
%N 4
%D June 1987
%P 253-255

%A Anatoli O. Buda
%T Multiprocessor automata
%J Information Processing Letters
%K ipl
%V 25
%N 4
%D June 1987
%P 257-261

%A Sandeep N. Bhatt
%A Stavros S. Cosmadakis
%T The complexity of minimizing wire lengths in VLSI layouts
%J Information Processing Letters
%K ipl
%V 25
%N 4
%D June 1987
%P 263-267

%A O. Fries
%A K. Mehlhorn
%A S. Naher
%A A. Tsakalidis
%T A log log n data structure for three-sided range queries
%J Information Processing Letters
%K ipl
%V 25
%N 4
%D June 1987
%P 269-273

%A Andrew W. Appel
%T Garbage collection can be faster than stack allocation
%J Information Processing Letters
%K ipl
%V 25
%N 4
%D June 1987
%P 275-279
%K MMM

%A Vijay Raghavan
%A Shankar M. Venkatesan
%T On bounds for a board covering problem
%J Information Processing Letters
%K ipl
%V 25
%N 5
%D July 1987
%P 281-284

%A Jeffrey S. Salowe
%A W.L. Steiger
%T Stable unmerging in linear time and constant space
%J Information Processing Letters
%K ipl
%V 25
%N 5
%D July 1987
%P 285-294

%A K. Venkatesh
%A T. Radhakrishnan
%A H.F. Li
%T Optimal checkpointing and local recording for domino-free rollback recovery
%J Information Processing Letters
%K ipl
%V 25
%N 5
%D July 1987
%P 295-303

%A Jerzy R. Nawrocki
%A J. Martinek
%T A storage allocation method with invalidating dangling references
%J Information Processing Letters
%K ipl
%V 25
%N 5
%D July 1987
%P 305-310

%A Cristian Calude
%T Super-exponentials nonprimitive recursive, but rudimentary
%J Information Processing Letters
%K ipl
%V 25
%N 5
%D July 1987
%P 311-315

%A S.S. Ravi
%A H.B. Hunt,\ III
%T An application of the planar separator theorem to counting problems
%J Information Processing Letters
%K ipl
%V 25
%N 5
%D July 1987
%P 317-321

%A David Gries
%A Ivan Stojmenovic
%T A note on Graham's convex hull algorithm
%J Information Processing Letters
%K ipl
%V 25
%N 5
%D July 1987
%P 323-327

%A Yunzhou Zhu
%A To-Yat Cheung
%T A new distributed breadth-first-search algorithm
%J Information Processing Letters
%K ipl
%V 25
%N 5
%D July 1987
%P 329-333

%A Rina Suros
%A E. Montagne
%T Fitted diagonals for reducing I/O bandwidth in systolic systems
%J Information Processing Letters
%K ipl
%V 25
%N 5
%D July 1987
%P 335-341

%A Stuart Friedberg
%A Gary L. Peterson
%T An efficient solution to the mutual exclusion problem using weak semaphores
%J Information Processing Letters
%K ipl
%V 25
%N 5
%D July 1987
%P 343-347

%A Kadri Krause
%A Lawrence L. Larmore
%A Dennis James Volper
%T Packing items from a triangular distribution
%J Information Processing Letters
%K ipl
%V 25
%N 6
%D July 1987
%P 351-361

%A Joanna Jedrzejowicz
%T Nesting on shuffle closure is important
%J Information Processing Letters
%K ipl
%V 25
%N 6
%D July 1987
%P 363-367

%A Jean Pallo
%T On the rotation distance in the lattice binary trees
%J Information Processing Letters
%K ipl
%V 25
%N 6
%D July 1987
%P 369-373

%A Ricardo A. Baeza-Yates
%T Some average measures in m-ary search trees
%J Information Processing Letters
%K ipl
%V 25
%N 6
%D July 1987
%P 375-381

%A Shlomo Moran
%T Generalized lower bounds derived from Hastad's main lemma
%J Information Processing Letters
%K ipl
%V 25
%N 6
%D July 1987
%P 383-388

%A Manfred Kunde
%A Horst Steppat
%T On the worst-case ration of a compound multiprocessor scheduling algorithm
%J Information Processing Letters
%K ipl
%V 25
%N 6
%D July 1987
%P 389-396

%A Imrich Vrto
%T The area-time complexity of the VLSI counter
%J Information Processing Letters
%K ipl
%V 25
%N 6
%D July 1987
%P 397-400

%A F. Peper
%T Determining connected components in linear time
by a linear number of processors
%J Information Processing Letters
%K ipl
%V 25
%N 6
%D July 1987
%P 401-406

%A Udo Kelter
%T The complexity of strict serializability revisited
%J Information Processing Letters
%K ipl
%V 25
%N 6
%D July 1987
%P 407-411

%A Youichi Kobuchi
%T A note on symmetrical cellular spaces
%J Information Processing Letters
%K ipl
%V 25
%N 6
%D July 1987
%P 413-415

%A Brigitte Jaumard
%A Bruno Simeone
%T On the complexity of the maximum satisfiability problem for Horn formulas
%J Information Processing Letters
%K ipl
%V 26
%N 1
%D September 1987
%P 1-4

%A James R. Driscoll
%A Sheau-Dong Lang
%A LeRoy A. Franklin
%T Modeling B-tree insertion activity
%J Information Processing Letters
%K ipl
%V 26
%N 1
%D September 1987
%P 5-18

%A Alfs T. Berztiss
%T A notation for distributed operations
%J Information Processing Letters
%K ipl
%V 26
%N 1
%D September 1987
%P 19-21

%A Jean Berstel
%A Srecko Brlek
%T On the length of word chains
%J Information Processing Letters
%K ipl
%V 26
%N 1
%D September 1987
%P 23-28

%A Ronald V. Book
%A Hai-Ning Liu
%T Rewriting systems and word problems in a free partially commutative monoid
%J Information Processing Letters
%K ipl
%V 26
%N 1
%D September 1987
%P 29-32

%A Svante Carlsson
%T The deap - a double-ended heap to implement double-ended priority queues
%J Information Processing Letters
%K ipl
%V 26
%N 1
%D September 1987
%P 33-36

%A Janet Incerpi
%A Robert Sedgewick
%T Practical variations of shellsort
%J Information Processing Letters
%K ipl
%V 26
%N 1
%D September 1987
%P 37-43

%A Jean Claude Bermond
%A Jean Michel Fourneau
%A Alain Jean-Marie
%T Equivalence of multistage interconnection networks
%J Information Processing Letters
%K ipl
%V 26
%N 1
%D September 1987
%P 45-50

%A Laszlo Babai
%T Random oracles separate PSPACE from the polynomial-time hierarchy
%J Information Processing Letters
%K ipl
%V 26
%N 1
%D September 1987
%P 51-53

%A Y. Metivier
%A E. Ochmanski
%T On lexicographic semi-commutations
%J Information Processing Letters
%K ipl
%V 26
%N 2
%D October 1987
%P 55-59

%A Xiaojun Shen
%A Herbert Edelsbrunner
%T A tight lower bound on the size of visibility graphs
%J Information Processing Letters
%K ipl
%V 26
%N 2
%D October 1987
%P 61-64

%A Michael Rusinowitch
%T On termination of the direct sum of term-rewriting systems
%J Information Processing Letters
%K ipl
%V 26
%N 2
%D October 1987
%P 65-70

%A Andranik Mirzaian
%T A halving technique for the longest stuttering subsequence problem
%J Information Processing Letters
%K ipl
%V 26
%N 2
%D October 1987
%P 71-75

%A Jan Magott
%T Performance evaluation of concurrent systems
using conflict-free and persistent Petri nets
%J Information Processing Letters
%K ipl
%V 26
%N 2
%D October 1987
%P 77-80

%A Zvi Galil
%A Moti Yung
%T Partitioned encryption and achieving simultaneity by partitioning
%J Information Processing Letters
%K ipl
%V 26
%N 2
%D October 1987
%P 81-88

%A C. Mathieu
%A C. Puech
%A H. Yahia
%T Average efficiency of data structures for binary image processing
%J Information Processing Letters
%K ipl
%V 26
%N 2
%D October 1987
%P 89-93

%A K.G. Subramanian
%A Rani Siromoney
%A P. Jeyanthi Abisha
%T A D0L-T0L public key cryptosystem
%J Information Processing Letters
%K ipl
%V 26
%N 2
%D October 1987
%P 95-97

%A Ajay K. Gupta
%A Susanne E. Hambrusch
%T Optimal three-dimensional layouts of complete binary trees
%J Information Processing Letters
%K ipl
%V 26
%N 2
%D October 1987
%P 99-104

%A Matthew J. Thazhuthaveetil
%A Andrew R. Pleszkun
%T On the structural locality of reference in Lisp list access streams
%J Information Processing Letters
%K ipl
%V 26
%N 2
%D October 1987
% 105-110