%A E.G. Coffman
%A B. Randell
%T Performance predictions for extended paged memories
%J Acta Informatica
%K acta_inf
%V 1
%D 1971
%P 1-13

%A D.E. Knuth
%T Optimum binary search trees
%J Acta Informatica
%K acta_inf
%V 1
%D 1971
%P 14-25

%A W.M. Turski
%T A model for data structures and its applications
%J Acta Informatica
%K acta_inf
%V 1
%D 1971
%P 26-34

%A N. Wirth
%T The programming language Pascal
%J Acta Informatica
%K acta_inf
%V 1
%D 1971
%P 35-63

%A V. Claus
%T Ein Vollstandigkeitssatz fur Programme und Schaltkreise
%J Acta Informatica
%K acta_inf
%V 1
%D 1971
%P 64-78

%A Donald E. Knuth
%T Top-down syntax analysis
%J Acta Informatica
%K acta_inf
%V 1
%D 1971
%P 79-110

%A H. Langmaack
%T Application of regular canonical systems
to grammars translatable from left to right
%J Acta Informatica
%K acta_inf
%V 1
%D 1971
%P 111-114

%A E.W. Dijkstra
%T Hierarchical ordering of sequential processes
%J Acta Informatica
%K acta_inf
%V 1
%D 1971
%P 115-138

%A A. Schonhage
%T Schnell Berechnung von Kettenbruchentwicklungen
%J Acta Informatica
%K acta_inf
%V 1
%D 1971
%P 139-144

%A F.K. Hwang
%A S. Lin
%T Optimal merging of 2 elements with n elements
%J Acta Informatica
%K acta_inf
%V 1
%D 1971
%P 145-158

%A D. Perrin
%A J.-F. Perrot
%T Congruences at automorphismes des automates finis
%J Acta Informatica
%K acta_inf
%V 1
%D 1971
%P 159-172

%A R. Bayer
%A E. McCreight
%T Organization and maintenance of large ordered indexes
%J Acta Informatica
%K acta_inf
%V 1
%D 1972
%P 173-189

%A Per Brinch Hansen
%T A comparison of two synchronizing concepts
%J Acta Informatica
%K acta_inf
%V 1
%D 1972
%P 190-199

%A E.G. Coffman,\ Jr.
%A R.L. Graham
%T Optimal scheduling for two-processor systems
%J Acta Informatica
%K acta_inf
%V 1
%D 1972
%P 200-213

%A M. Clint
%A C.A.R. Hoare
%T Program proving: jumps and functions
%J Acta Informatica
%K acta_inf
%V 1
%D 1972
%P 214-224

%A G. Kaufholz
%T Der programmierbare endliche Automat
%J Acta Informatica
%K acta_inf
%V 1
%D 1972
%P 225-241

%A G. Rozenberg
%T Direction controlled programmed grammars
%J Acta Informatica
%K acta_inf
%V 1
%D 1972
%P 242-252

%A Hermann Walter
%T Inhibitionsfelder
%J Acta Informatica
%K acta_inf
%V 1
%D 1972
%P 253-269

%A C.A.R. Hoare
%T Proof of correctness of data representations
%J Acta Informatica
%K acta_inf
%V 1
%D 1972
%P 271-281

%A W.M. Turski
%T A model for data structures and its applications (part II)
%J Acta Informatica
%K acta_inf
%V 1
%D 1972
%P 282-289

%A R. Bayer
%T Symmetric binary B-trees: data structure and maintenance algorithms
%J Acta Informatica
%K acta_inf
%V 1
%D 1972
%P 290-306

%A T.C. Hu
%A K.C. Tan
%T Least upper bound on the cost of optimum binary search trees
%J Acta Informatica
%K acta_inf
%V 1
%D 1972
%P 307-310

%A A.C. MacKellar
%A C.K. Wong
%T Bounds on algorithms for string generation
%J Acta Informatica
%K acta_inf
%V 1
%D 1972
%P 311-319

%A V. Strassen
%T Berechnung und Programm I
%J Acta Informatica
%K acta_inf
%V 1
%D 1972
%P 320-335

%A J. Hartmanis
%T On non-determinancy in simple computing devices
%J Acta Informatica
%K acta_inf
%V 1
%D 1972
%P 336-344

%A C.P. Schnorr
%A H. Stimm
%T Endliche Automaten und Zufallsfolgen
%J Acta Informatica
%K acta_inf
%V 1
%D 1972
%P 345-359

%A G. Schott
%T Automatic analysis of inflectional morphems in german nouns
%J Acta Informatica
%K acta_inf
%V 1
%D 1972
%P 360-374

%A P.J. Courtois
%A F. Heymans
%A D.L. Parnas
%T Comments on "A comparison of two synchronizing concepts by P.B. Hansen"
%J Acta Informatica
%K acta_inf
%V 1
%D 1972
%P 375-376

%A Soren Lauesen
%T Job scheduling guaranteeing reasonable turn-around times
%J Acta Informatica
%K acta_inf
%V 2
%D 1973
%P 1-11

%A T. Anderson
%A J. Eve
%A J.J. Horning
%T Efficient LR(1) parsers
%J Acta Informatica
%K acta_inf
%V 2
%D 1973
%P 12-39

%A A. Salomaa
%T On sentential forms of context-free grammars
%J Acta Informatica
%K acta_inf
%V 2
%D 1973
%P 40-49

%A M. Clint
%T Program proving: coroutines
%J Acta Informatica
%K acta_inf
%V 2
%D 1973
%P 50-63

%A V. Strassen
%T Berechnung und Programm II
%J Acta Informatica
%K acta_inf
%V 2
%D 1973
%P 64-79

%A H.-J. Stob
%T Rangierkomplexitat von Permutationen
%J Acta Informatica
%K acta_inf
%V 2
%D 1973
%P 80-96

%A David Gries
%T Describing an algorithm by Hopcroft
%J Acta Informatica
%K acta_inf
%V 2
%D 1973
%P 97-109

%A Hans Langmaack
%T On correct procedure parameter transmission in higher programming languages
%J Acta Informatica
%K acta_inf
%V 2
%D 1973
%P 110-142

%A H.J. Genrich
%A K. Lautenbach
%T Synchrisationsgraphen
%J Acta Informatica
%K acta_inf
%V 2
%D 1973
%P 143-161

%A Karel Culik
%A Michael A. Arbib
%T Sequential and jumping machines and their relations to computers
%J Acta Informatica
%K acta_inf
%V 2
%D 1973
%P 162-171

%A H.-D. Ehrich
%T Minimale und m-minimale Variablenmengen fur partielle Boole'sche Funktionen
%J Acta Informatica
%K acta_inf
%V 2
%D 1973
%P 172-179

%A L. Boasson
%A M. Nivat
%T Sur diverses familles de langages fermees par transduction rationnelle
%J Acta Informatica
%K acta_inf
%V 2
%D 1973
%P 180-188

%A Per Brinch Hansen
%T A reply to comments on "A comparison of two synchronizing concepts"
%J Acta Informatica
%K acta_inf
%V 2
%D 1973
%P 189-190

%A J.D. Ullman
%T Fast algorithms for the elimination of common subexpressions
%J Acta Informatica
%K acta_inf
%V 2
%D 1973
%P 191-213

%A G. Rozenberg
%A A. Lindenmayer
%T Developmental systems with locally catenative formulas
%J Acta Informatica
%K acta_inf
%V 2
%D 1973
%P 214-248

%A Walter J. Savitch
%T A note on multihead automata and context-sensitive languages
%J Acta Informatica
%K acta_inf
%V 2
%D 1973
%P 249-252

%A Peter Kandzia
%T Zur Theorie der partiell-linearen Realisierungen endlicher Automaten
%J Acta Informatica
%K acta_inf
%V 2
%D 1973
%P 253-282

%A Volker Claus
%T Die mittlere Additionsdauer eines Paralleladdierwerks
%J Acta Informatica
%K acta_inf
%V 2
%D 1973
%P 283-291

%A Jay Earley
%T Relational level data structures for programming languages
%J Acta Informatica
%K acta_inf
%V 2
%D 1973
%P 293-309

%A Hans Langmaack
%T On procedures as open subroutines I
%J Acta Informatica
%K acta_inf
%V 2
%D 1973
%P 311-333

%A C.A.R. Hoare
%A N. Wirth
%T An axiomatic definition of the programming language PASCAL
%J Acta Informatica
%K acta_inf
%V 2
%D 1973
%P 335-355

%A W. Menzel
%T An extension of the theory of learning systems
%J Acta Informatica
%K acta_inf
%V 2
%D 1973
%P 357-381

%A L. Boasson
%A J.P. Crestin
%A M. Nivat
%T Familles de langages translatables et fermees par crochet
%J Acta Informatica
%K acta_inf
%V 2
%D 1973
%P 383-393

%A E. Gelenbe
%A P. Tiberio
%A J.C.A. Boekhorst
%T Page size in demand-paging systems
%J Acta Informatica
%K acta_inf
%V 3
%D 1974
%P 1-23

%A Maurice Schlumberger
%A Jean Vuillemin
%T Optimal disk merge patterns
%J Acta Informatica
%K acta_inf
%V 3
%D 1974
%P 25-35

%A A. Nahapetian
%T Node flows in graphs with conservative flow
%J Acta Informatica
%K acta_inf
%V 3
%D 1974
%P 37-41

%A A.N. Habermann
%T Critical comments on the programming language Pascal
%J Acta Informatica
%K acta_inf
%V 3
%D 1974
%P 47-57

%A A.B. Cremers
%T Normal forms for context-sensitive grammars
%J Acta Informatica
%K acta_inf
%V 3
%D 1974
%P 59-73

%A Lutz Eichner
%T Lineare Realisier endlicher Automaten uber endlichen Korpern
%J Acta Informatica
%K acta_inf
%V 3
%D 1974
%P 75-100

%A T. Betteridge
%T An analytic storage allocation model
%J Acta Informatica
%K acta_inf
%V 3
%D 1974
%P 101-122

%A Ellis Horowitz
%T A unified view of the complexity of evaluation and interpolation
%J Acta Informatica
%K acta_inf
%V 3
%D 1974
%P 123-133

%A C.A.R. Hoare
%A P.E. Lauer
%T Consistent and complementary formal theories
of the semantics of programming languages
%J Acta Informatica
%K acta_inf
%V 3
%D 1974
%P 135-153

%A P.F. Schuler
%T Weakly context-sensitive languages as model for programming languages
%J Acta Informatica
%K acta_inf
%V 3
%D 1974
%P 155-170

%A Gerd Kaufholz
%T Uber die Vernetzungsstruktur von Maschinen
%J Acta Informatica
%K acta_inf
%V 3
%D 1974
%P 171-186

%A David B. Benson
%T An abstract machine theory for formal language parsers
%J Acta Informatica
%K acta_inf
%V 3
%D 1974
%P 187-202

%A David Kuck
%A Yoichi Muraoka
%T Bounds on the parallel evaluation of arithmetic expressions
using associativity and commutativity
%J Acta Informatica
%K acta_inf
%V 3
%D 1974
%P 203-216

%A W.J. Paul
%A H.-J. Stob
%T Zur Komplexitat von Sortierproblemen
%J Acta Informatica
%K acta_inf
%V 3
%D 1974
%P 217-225

%A Hans Langmaack
%T On procedures as open subroutines II
%J Acta Informatica
%K acta_inf
%V 3
%D 1974
%P 227-241

%A Zohar Manna
%A Amir Pnueli
%T Axiomatic approach to total correctness of programs
%J Acta Informatica
%K acta_inf
%V 3
%D 1974
%P 243-263

%A A. Ehrenfeucht
%A G. Rozenberg
%T Nonterminals versus homomorphisms in defining languages
for some classes of rewriting systems
%J Acta Informatica
%K acta_inf
%V 3
%D 1974
%P 265-283

%A Martti Penttonen
%T On derivation languages corresponding to context-free grammars
%J Acta Informatica
%K acta_inf
%V 3
%D 1974
%P 285-291

%A Jean Berstel
%T Sur une conjecture de S. Greibach
%J Acta Informatica
%K acta_inf
%V 3
%D 1974
%P 293-295

%A C.C. Gotlieb
%A Frank W. Tompa
%T Choosing a storage schema
%J Acta Informatica
%K acta_inf
%V 3
%D 1974
%P 297-319

%A E. Gelenbe
%A J. Enfant
%A D. Potier
%T Analyse d'un algorithme de gestion simultanee
memoire centrale - disque de pagination
%J Acta Informatica
%K acta_inf
%V 3
%D 1974
%P 321-345

%A M.R. Garey
%A R.L. Graham
%T Performance bounds on the splitting algorithm for binary testing
%J Acta Informatica
%K acta_inf
%V 3
%D 1974
%P 347-355

%A M. Nielsen
%A G. Rozenberg
%A A. Salomaa
%A S. Skyum
%T Nonterminals, homomorphisms and codings in different variations of OL-systems
II. nondeterministic systems
%J Acta Informatica
%K acta_inf
%V 3
%D 1974
%P 357-364

%A K. Ecker
%A H. Ratschek
%T Eigenschaften der von linearen Automaten erkennbaren Worte
%J Acta Informatica
%K acta_inf
%V 3
%D 1974
%P 365-383

%A Lutz Eichner
%T Total lineare Realisierbarkeit endlicher Automaten
%J Acta Informatica
%K acta_inf
%V 3
%D 1974
%P 385-397

%A A. van\ Wijngaarden
%A B.J. Mailloux
%A J.E.L. Peck
%A C.H.A. Koster
%A M. Sinztoff
%A C.H. Lindsey
%A L.G.L.T. Meertens
%A R.G. Fisker
%T Revised report on the algorithmic language Algol 68
%J Acta Informatica
%K acta_inf
%V 5
%D 1975
%P 1-236

%A J. Nehmer
%T Dispatcher primitives for the construction of operating system kernels
%J Acta Informatica
%K acta_inf
%V 5
%D 1975
%P 237-255

%A W.K. Giloi
%A J. Encarnacao
%A S. Savitt
%T Interactive graphics on intelligent terminals
in a time-sharing environment
%J Acta Informatica
%K acta_inf
%V 5
%D 1975
%P 257-271

%A John R. Rice
%T Parallel algorithms for adaptive quadrature II
metalgorithm correctness
%J Acta Informatica
%K acta_inf
%V 5
%D 1975
%P 273-285

%A Kurt Mehlhorn
%T Nearly optimal binary search trees
%J Acta Informatica
%K acta_inf
%V 5
%D 1975
%P 287-295

%A P.E. Lauer
%A R.H. Campbell
%T Formal semantics of a class of high-level primitives
for coordinating concurrent processes
%J Acta Informatica
%K acta_inf
%V 5
%D 1975
%P 297-332

%A Shmuel Katz
%A Zohar Manna
%T A closer look at termination
%J Acta Informatica
%K acta_inf
%V 5
%D 1975
%P 333-352

%A P. Deussen
%T A decidability criterion for van Wijngaarden grammars
%J Acta Informatica
%K acta_inf
%V 5
%D 1975
%P 353-375

%A Seymour Ginsburg
%A Edwin H. Spanier
%T Substitution of grammar forms
%J Acta Informatica
%K acta_inf
%V 5
%D 1975
%P 377-386

%A P.F. Schuler
%T A note on degrees of context-sensitivity
%J Acta Informatica
%K acta_inf
%V 5
%D 1975
%P 387-394

%A E.G. Coffman Jr.
%A Ravi Sethi
%T Algorithms minimizing mean flow time: schedule-length properties
%J Acta Informatica
%K acta_inf
%V 6
%D 1976
%P 1-14

%A E.J. Neuhold
%A T. Weller
%T Specification and proving of command programs
%J Acta Informatica
%K acta_inf
%V 6
%D 1976
%P 15-40

%A J. Darlington
%A R.M. Burstall
%T A system which automatically improves programs
%J Acta Informatica
%K acta_inf
%V 6
%D 1976
%P 41-60

%A A.P. Ershov
%T Axiomatics for memory allocation
%J Acta Informatica
%K acta_inf
%V 6
%D 1976
%P 61-75

%A Zvi Galil
%T Hierarchies of complete problems
%J Acta Informatica
%K acta_inf
%V 6
%D 1976
%P 77-88

%A Ronald V. Book
%A Ashok K. Chandra
%T Inherently nonplanar automata
%J Acta Informatica
%K acta_inf
%V 6
%D 1976
%P 89-94

%A Burkhard Monien
%T Transformational methods and the application to complexity problems
%J Acta Informatica
%K acta_inf
%V 6
%D 1976
%P 95-108

%A E.R. Anderson
%A F.C. Belz
%A E.K. Blum
%T SEMANOL (73) a metalanguage
for programming the semantics of programming languages
%J Acta Informatica
%K acta_inf
%V 6
%D 1976
%P 109-131

%A Michael Karr
%T Affine relationships among variables of a program
%J Acta Informatica
%K acta_inf
%V 6
%D 1976
%P 133-151

%A Robert T. Moenck
%T Another polynomial homomorphism
%J Acta Informatica
%K acta_inf
%V 6
%D 1976
%P 153-169

%A Robert Endre Tarjan
%T Edge-disjoint spanning trees and depth-first search
%J Acta Informatica
%K acta_inf
%V 6
%D 1976
%P 171-185

%A W.R. Franta
%T The mathematical analysis of the computer system
modeled as a two-stage cyclic queue
%J Acta Informatica
%K acta_inf
%V 6
%D 1976
%P 187-209

%A Gary J. Nutt
%T Some resource allocation policies in a multi associative processor
%J Acta Informatica
%K acta_inf
%V 6
%D 1976
%P 211-225

%A Hans Albrecht Schmid
%T On the efficient implementation of conditional critical regions
and the construction of monitors
%J Acta Informatica
%K acta_inf
%V 6
%D 1976
%P 227-249

%A P.-J. Courtois
%A H. Vantilborgh
%T A decomposable model of program paging behaviour
%J Acta Informatica
%K acta_inf
%V 6
%D 1976
%P 251-275

%A R.C. Backhouse
%T An alternative approach to the improvement of LR(k) parsers
%J Acta Informatica
%K acta_inf
%V 6
%D 1976
%P 277-296

%A H.J. Schneider
%A H. Ehrig
%T Grammars on partial graphs
%J Acta Informatica
%K acta_inf
%V 6
%D 1976
%P 297-316

%A E.A. Ashcroft
%A M. Clint
%A C.A.R. Hoare
%T Remarks on "Program proving:
jumps and functions by M. Clint and C.A.R. Hoare"
%J Acta Informatica
%K acta_inf
%V 6
%D 1976
%P 317-318

%A Susan Owicki
%A David Gries
%T An axiomatic proof technique for parallel programs
%J Acta Informatica
%K acta_inf
%V 6
%D 1976
%P 319-340

%A Jacques Cohen
%A Martin Roth
%T On the implementation of Strassen's fast multiplication algorithm
%J Acta Informatica
%K acta_inf
%V 6
%D 1976
%P 341-355

%A Edsger W. Dijkstra
%T On a gauntlet thrown by David Gries
%J Acta Informatica
%K acta_inf
%V 6
%D 1976
%P 357-359

%A K. Taniguchi
%A T. Kasami
%T An O(n) algorithm for computing the set of available expressions of D-charts
%J Acta Informatica
%K acta_inf
%V 6
%D 1976
%P 361-364

%A A. Brandwajn
%T A model of a virtual memory system
%J Acta Informatica
%K acta_inf
%V 6
%D 1976
%P 365-386

%A R.M. Wharton
%T Resolution of ambiguity in parsing
%J Acta Informatica
%K acta_inf
%V 6
%D 1976
%P 387-395

%A H.A. Maurer
%A D. Wood
%T On grammar forms with terminal context
%J Acta Informatica
%K acta_inf
%V 6
%D 1976
%P 397-402

%A Werner Heise
%T Optimal codes, n-arcs and Laguerre geometry
%J Acta Informatica
%K acta_inf
%V 6
%D 1976
%P 403-406

%A A. Ehrenfeucht
%A G. Rozenberg
%T On proving that certain languages are not ETOL
%J Acta Informatica
%K acta_inf
%V 6
%D 1976
%P 407-415

%A R. Zuczek
%T A new approach to parallel computing
%J Acta Informatica
%K acta_inf
%V 7
%D 1976
%P 1-13

%A Leslie Lamport
%T The synchronization independent processes
%J Acta Informatica
%K acta_inf
%V 7
%D 1976
%P 15-34

%A E. Gelenbe
%A R.R. Muntz
%T Probabilistic models of computer systems
Part I: exact results
%J Acta Informatica
%K acta_inf
%V 7
%D 1976
%P 35-60

%A O.L. Madsen
%A B.B. Kristensen
%T LR-parsing of extended context free grammars
%J Acta Informatica
%K acta_inf
%V 7
%D 1976
%P 61-73

%A H.K.-G. Walter
%T Grammarforms and grammarhomomorphisms
%J Acta Informatica
%K acta_inf
%V 7
%D 1976
%P 75-93

%A C.P. Schorr
%T The network complexity and the Turing machine complexity of finite functions
%J Acta Informatica
%K acta_inf
%V 7
%D 1976
%P 95-107

%A Donald P. Gaver
%A George Humfeld
%T Multitype multiprogramming models
%J Acta Informatica
%K acta_inf
%V 7
%D 1976
%P 111-121

%A E. Gelenbe
%A G. Pujolle
%T The behaviour of a single queue in a general queueing network
%J Acta Informatica
%K acta_inf
%V 7
%D 1976
%P 123-136

%A Thomas Giammo
%T Validation of a computer performance model
of the exponential queueing network family
%J Acta Informatica
%K acta_inf
%V 7
%D 1976
%P 137-152

%A Carl E. Landwehr
%T An endogenous priority model for load control
in combined batch-interactive computer systems
%J Acta Informatica
%K acta_inf
%V 7
%D 1976
%P 153-166

%A J.P. Buzen
%T Fundamental operational laws of computer system performance
%J Acta Informatica
%K acta_inf
%V 7
%D 1976
%P 167-182

%A J. Labetoulle
%A G. Pujolle
%T A study of queueing networks with deterministic service
and application to computer networks
%J Acta Informatica
%K acta_inf
%V 7
%D 1976
%P 183-195

%A Peter J. Denning
%A Kevin C. Kahn
%A Jacques Leroudier
%A Dominique Potier
%A Rajan Suri
%T Optimal multiprogramming
%J Acta Informatica
%K acta_inf
%V 7
%D 1976
%P 197-216

%A Jeffrey R. Spirn
%T Multi-queue scheduling of two tasks
%J Acta Informatica
%K acta_inf
%V 7
%D 1976
%P 217-226

%A Peter D. Welch
%T On the self contained modelling of DB/DC systems
%J Acta Informatica
%K acta_inf
%V 7
%D 1976
%P 227-247

%A David Pager
%T A practical general method for constructing LR(k) parsers
%J Acta Informatica
%K acta_inf
%V 7
%D 1977
%P 249-268

%A Werner Kern
%T Specheroptimale Formalubersetzung
%J Acta Informatica
%K acta_inf
%V 7
%D 1977
%P 269-287

%A Arnold L. Rosenberg
%A Larry J. Stockmeyer
%T Storage schemes for boundedly extendible arrays
%J Acta Informatica
%K acta_inf
%V 7
%D 1977
%P 289-303

%A John B. Kam
%A Jeffrey D. Ullman
%T Monotone data flow analysis frameworks
%J Acta Informatica
%K acta_inf
%V 7
%D 1977
%P 305-317

%A Robert E. Shostak
%T On the role of unification in mechanical theorem proving
%J Acta Informatica
%K acta_inf
%V 7
%D 1977
%P 319-323

%A Robert Sedgewick
%T The analysis of quicksort programs
%J Acta Informatica
%K acta_inf
%V 7
%D 1977
%P 327-355

%A Tomasz Kowaltowski
%T Axiomatic approach to side effects and general jumps
%J Acta Informatica
%K acta_inf
%V 7
%D 1977
%P 357-360

%A Donal T. MacVeigh
%T Effect of data representation on cost of sparse matrix operations
%J Acta Informatica
%K acta_inf
%V 7
%D 1977
%P 361-394

%A A. Schonhage
%T SchnelleMultiplikation von Polynomem uber Korpern der Characteristik 2
%J Acta Informatica
%K acta_inf
%V 7
%D 1977
%P 395-398

%A J-F. Perrot
%T Monoides syntactiques des langages algebriques
%J Acta Informatica
%K acta_inf
%V 7
%D 1977
%P 399-413

%A David Anthony Watt
%T The parsing problem for affix grammars
%J Acta Informatica
%K acta_inf
%V 8
%D 1977
%P 1-20

%A David C. Luckham
%A Norihisa Suzuki
%T Proof of termination within a weak logic of programs
%J Acta Informatica
%K acta_inf
%V 8
%D 1977
%P 21-36

%A M.E. Majster
%T Extended directed graphs,
a formalism for structured data and data structures
%J Acta Informatica
%K acta_inf
%V 8
%D 1977
%P 37-59

%A I. Mitrani
%A J.H. Hine
%T Complete parameterized families of job scheduling strategies
%J Acta Informatica
%K acta_inf
%V 8
%D 1977
%P 61-73

%A H.A. Maurer
%A A. Slomaa
%A D. Wood
%T EOL forms
%J Acta Informatica
%K acta_inf
%V 8
%D 1977
%P 75-96

%A R.D. Tennent
%T Language design methods based on semantic principles
%J Acta Informatica
%K acta_inf
%V 8
%D 1977
%P 97-112

%A Bruce Russell
%T On an equivalence between continuation and stack semantics
%J Acta Informatica
%K acta_inf
%V 8
%D 1977
%P 113-123

%A Nissim Francez
%A Boris Klebansky
%A Amir Pnueli
%T Backtracking in recursive computations
%J Acta Informatica
%K acta_inf
%V 8
%D 1977
%P 125-144

%A George W. Ernst
%T Rules of inference for procedure calls
%J Acta Informatica
%K acta_inf
%V 8
%D 1977
%P 145-152

%A Bo Munch-Andersen
%A Torben U. Zahle
%T Scheduling according to job priority
with prevention of deadlock and permanent blocking
%J Acta Informatica
%K acta_inf
%V 8
%D 1977
%P 153-175

%A Joel I. Seiferas
%T Iterative arrays with direct central control
%J Acta Informatica
%K acta_inf
%V 8
%D 1977
%P 177-192

%A P. Deussen
%A K. Mehlhorn
%T Van Wijngaarden grammars and space complexity class EXSPACE
%J Acta Informatica
%K acta_inf
%V 8
%D 1977
%P 193-199

%A Tilak Agerwala
%T Some extended semaphore primitives
%J Acta Informatica
%K acta_inf
%V 8
%D 1977
%P 201-220

%A James E. Donahue
%T Locations considered unnecessary
%J Acta Informatica
%K acta_inf
%V 8
%D 1977
%P 221-242

%A F. Kroger
%T LAR: a logic of algorithmic reasoning
%J Acta Informatica
%K acta_inf
%V 8
%D 1977
%P 243-266

%A Yoshihide Igarashi
%T General properties of derivational complexity
%J Acta Informatica
%K acta_inf
%V 8
%D 1977
%P 267-283

%A Peter R.J. Asveld
%A Joost Engelfriet
%T Iterated deterministic substitution
%J Acta Informatica
%K acta_inf
%V 8
%D 1977
%P 285-302

%A J. Eve
%A R. Kurki-Suonio
%T On computing the transitive closure of a relation
%J Acta Informatica
%K acta_inf
%V 8
%D 1977
%P 303-314

%A R.D. Tennent
%T On a new approach to representation independent data classes
%J Acta Informatica
%K acta_inf
%V 8
%D 1977
%P 315-324

%A N. Ramsperger
%T Concurrent access to data
%J Acta Informatica
%K acta_inf
%V 8
%D 1977
%P 325-334

%A Reidar Conradi
%T Some comments on "Concurrent readers and writers"
%J Acta Informatica
%K acta_inf
%V 8
%D 1977
%P 335-340

%A Hiseo Kameda
%A Calvin C. Gotlieb
%T A feedback-coupled resource allocation policy
for multiprogrammed computer systems
%J Acta Informatica
%K acta_inf
%V 8
%D 1977
%P 341-357

%A Michel Parent
%A Dominique Potier
%T A note on the influence of program loading on the page fault rate
%J Acta Informatica
%K acta_inf
%V 8
%D 1977
%P 359-370

%A Burkhard Monien
%T The LBA-problem and the deterministic tape complexity
of two-way one-counter languages over a one-letter alphabet
%J Acta Informatica
%K acta_inf
%V 8
%D 1977
%P 371-382

%A R. Bayer
%A M. Schkolnick
%T Concurrency operations on B-trees
%J Acta Informatica
%K acta_inf
%V 9
%D 1977
%P 1-21

%A D.T. Lee
%A C.K. Wong
%T Worst-case analysis for region and partial region searches
in multidimensional binary search trees and balanced quad trees
%J Acta Informatica
%K acta_inf
%V 9
%D 1977
%P 23-29

%A David Pager
%T Eliminating unit productions fro LR parsers
%J Acta Informatica
%K acta_inf
%V 9
%D 1977
%P 31-59

%A Stefan Sokolowski
%T Axioms for total correctness
%J Acta Informatica
%K acta_inf
%V 9
%D 1977
%P 61-71

%A J. Paredaens
%A R. Vyncke
%T A class of measures on formal languages
%J Acta Informatica
%K acta_inf
%V 9
%D 1977
%P 73-86

%A J. Avenhaus
%A K. Madlener
%T Subrekursive Komplexitat bei Gruppen
I. Gruppen mit vorgeschrieber Komplexitat
%J Acta Informatica
%K acta_inf
%V 9
%D 1977
%P 87-104

%A Wilfred J. Hansen
%A Hendrik Boom
%T The report on the standard hardware representation for Algol 68
%J Acta Informatica
%K acta_inf
%V 9
%D 1977
%P 105-119

%A Claus H. Correll
%T Proving programs correct through refinement
%J Acta Informatica
%K acta_inf
%V 9
%D 1977
%P 121-132

%A Nissim Francez
%A Amir Pnueli
%T A proof method for cyclic programs
%J Acta Informatica
%K acta_inf
%V 9
%D 1977
%P 133-157

%A Andrew Chi-Chih Yao
%T On random 2-3 trees
%J Acta Informatica
%K acta_inf
%V 9
%D 1977
%P 159-170

%A Ronald V. Book
%T On the complexity of formal grammars
%J Acta Informatica
%K acta_inf
%V 9
%D 1977
%P 171-181

%A J. Avenhaus
%A K. Madlener
%T Subrekursive Komplexitat bei Gruppen
II. Der Einbettungssatz von Higman fur entscheidbare Gruppen
%J Acta Informatica
%K acta_inf
%V 9
%D 1977
%P 183-193

%A Terrence Pratt
%T Program analysis and optimization through kernel-control decomposition
%J Acta Informatica
%K acta_inf
%V 9
%D 1977
%P 195-216

%A Cristoph M. Hoffmann
%T Design and correctness of a compiler for a non-procedural language
%J Acta Informatica
%K acta_inf
%V 9
%D 1977
%P 217-241

%A Armin B. Cremers
%A Thomas N. Hibbard
%T Orthogonality of information structures
%J Acta Informatica
%K acta_inf
%V 9
%D 1977
%P 243-261

%A E.G. Coffman,\ Jr.
%A J.Y-T. Leung
%A D.W. Ting
%T Bin packing: maximizing the number of pieces packed
%J Acta Informatica
%K acta_inf
%V 9
%D 1977
%P 263-271

%A Arnold L. Rosenberg
%T Data encodings and their costs
%J Acta Informatica
%K acta_inf
%V 9
%D 1977
%P 273-292

%A Armin B. Cremers
%A Thomas N. Hibbard
%T Functional behaviour in data spaces
%J Acta Informatica
%K acta_inf
%V 9
%D 1977
%P 293-307

%A Manfred Stadel
%T Die Zeitkomplexitat des Normalisierungsproblems
bei Kontextsensitiven Grammatiken
%J Acta Informatica
%K acta_inf
%V 9
%D 1977
%P 309-329

%A A. Krzesinski
%A P. Teunissen
%T A multiclass network model of a demand paging computer system
%J Acta Informatica
%K acta_inf
%V 9
%D 1977
%P 331-343

%A H. Hule
%A H.A. Maurer
%A Th. Ottman
%T Good OL forms
%J Acta Informatica
%K acta_inf
%V 9
%D 1977
%P 345-353

%A Henry S. Warren,\ Jr.
%T Static main storage packing problems
%J Acta Informatica
%K acta_inf
%V 9
%D 1977
%P 355-376

%A P. Deussen
%T A unified approach to the generation and the acception
of formal languages
%J Acta Informatica
%K acta_inf
%V 9
%D 1977
%P 377-390

%A R.L. London
%A J.V. Guttag
%A J.J. Horning
%A B.W. Lampson
%A J.G. Mitchell
%A G.J. Popek
%T Proof rules for the programming language Euclid
%J Acta Informatica
%K acta_inf
%V 10
%D 1978
%P 1-26

%A J.V. Guttag
%A J.J. Horning
%T The algebraic specification of abstract data types
%J Acta Informatica
%K acta_inf
%V 10
%D 1978
%P 27-52

%A William E. Howden
%T Algebraic program testing
%J Acta Informatica
%K acta_inf
%V 10
%D 1978
%P 53-66

%A Teuvo Laurinolli
%T Bounded quantification and relations recognizable by finite automata
%J Acta Informatica
%K acta_inf
%V 10
%D 1978
%P 67-78

%A Karel Culik II
%T The ultimate equivalence problem for DOL systems
%J Acta Informatica
%K acta_inf
%V 10
%D 1978
%P 79-84

%A Carlo Montangero
%A Guiliano Pacini
%A Maria Simi
%A Franco Turini
%T Information management in context trees
%J Acta Informatica
%K acta_inf
%V 10
%D 1978
%P 85-94

%A Jane W.S. Liu
%A C.L. Liu
%T Performance analysis of multiprocessor systems
containing functionally dedicated processors
%J Acta Informatica
%K acta_inf
%V 10
%D 1978
%P 95-104

%A B. Bartsch
%A G. Bolch
%T A conservation law for G/G/n queueing systems
%J Acta Informatica
%K acta_inf
%V 10
%D 1978
%P 105-109

%A W.J. Paul
%A R.E. Tarjan
%T Time-space trade-offs in a pebble game
%J Acta Informatica
%K acta_inf
%V 10
%D 1978
%P 111-115

%A Mordechai Ben-Ari
%T Ianov pushdown schemes are contained in boolean recursive schemes
%J Acta Informatica
%K acta_inf
%V 10
%D 1978
%P 117-125

%A V.K. Sebelfeld
%T Aquivalente Transformationen fur Flubdiagramme
%J Acta Informatica
%K acta_inf
%V 10
%D 1978
%P 127-155

%A Peter J.L. Wallis
%T The design of a portable programming language
%J Acta Informatica
%K acta_inf
%V 10
%D 1978
%P 157-167

%A Detlef Wotschke
%A Calia Wrathell
%T A note on classes of complements and the LBA problem
%J Acta Informatica
%K acta_inf
%V 10
%D 1978
%P 169-173

%A Reinhold Franck
%T A class of linearly parsable graph grammars
%J Acta Informatica
%K acta_inf
%V 10
%D 1978
%P 175-201

%A C.J. Maxson
%T Linear regular sets
%J Acta Informatica
%K acta_inf
%V 10
%D 1978
%P 203-208

%A J. Lewi
%A K. de\ Vlaminck
%A J. Huens
%A M. Huybrechts
%T The ELL(1) parser generator and the error recovery mechanism
%J Acta Informatica
%K acta_inf
%V 10
%D 1978
%P 209-228

%A Eric C.R. Hehner
%T On removing the machine from the language
%J Acta Informatica
%K acta_inf
%V 10
%D 1978
%P 229-243

%A Wayne A. Babich
%A Mehdi Jazayeri
%T The method of attributes for data flow analysis
Part I. Exhaustive analysis
%J Acta Informatica
%K acta_inf
%V 10
%D 1978
%P 245-264

%A Wayne A. Babich
%A Mehdi Jazayeri
%T The method of attributes for data flow analysis
Part II. Demand analysis
%J Acta Informatica
%K acta_inf
%V 10
%D 1978
%P 265-272

%A D.M. Choy
%A C.K. Wong
%T Optimal alpha-beta trees with capacity constraint
%J Acta Informatica
%K acta_inf
%V 10
%D 1978
%P 273-296

%A Joachim Biskup
%T On the complementation rule for multivalued dependencies
in database relations
%J Acta Informatica
%K acta_inf
%V 10
%D 1978
%P 297-305

%A A. Celentano
%T Incremental LR parsers
%J Acta Informatica
%K acta_inf
%V 10
%D 1978
%P 307-321

%A R. Meersman
%A G. Rozenberg
%T Two-level meta-controlled substitution grammars
%J Acta Informatica
%K acta_inf
%V 10
%D 1978
%P 323-339

%A Lutz Eichner
%T The semigroups of linearly realizable finite automata I
%J Acta Informatica
%K acta_inf
%V 10
%D 1978
%P 341-367

%A Lutz Eichner
%T The semigroups of linearly realizable finite automata II
%J Acta Informatica
%K acta_inf
%V 10
%D 1978
%P 369-390

%A Axel van\ Lamsweerde
%A Michel Sintzoff
%T Formal derivation of strongly correct concurrent programs
%J Acta Informatica
%K acta_inf
%V 12
%D 1979
%P 1-31

%A Helmut Alt
%T Lower bounds on space complexity for contextfree recognition
%J Acta Informatica
%K acta_inf
%V 12
%D 1979
%P 33-61

%A Yasuichi Horibe
%A Tibor O.H. Nemetz
%T On the max-entropy rule for a binary search tree
%J Acta Informatica
%K acta_inf
%V 12
%D 1979
%P 63-72

%A Jorgen Steensgaard-Madsen
%T Pascal - clarifications and recommended extensions
%J Acta Informatica
%K acta_inf
%V 12
%D 1979
%P 73-94

%A Warren Burton
%T Generalized recursive data structures
%J Acta Informatica
%K acta_inf
%V 12
%D 1979
%P 95-108

%A P.E. Lauer
%A P.R. Torrigiani
%A M.W. Shields
%T COSY - a system specification language based on paths and processes
%J Acta Informatica
%K acta_inf
%V 12
%D 1979
%P 109-158

%A Donald L. Iglehart
%A Gerald S. Shedler
%T Regenerative simulation of response times
in networks of queues with multiple job types
%J Acta Informatica
%K acta_inf
%V 12
%D 1979
%P 159-175

%A Ronald V. Book
%T On languages accepted by space-bounded oracle machines
%J Acta Informatica
%K acta_inf
%V 12
%D 1979
%P 177-185

%A C.J.M. Turnbull
%A E.S. Lee
%T Generalized deterministic left to right parsing
%J Acta Informatica
%K acta_inf
%V 12
%D 1979
%P 187-207

%A Reinhard Wilhelm
%T Computation and the use of data flow information in optimizing compilers
%J Acta Informatica
%K acta_inf
%V 12
%D 1979
%P 209-225

%A Beate Commentz-Walter
%T Size-depth tradeoff in monotone boolean formulae
%J Acta Informatica
%K acta_inf
%V 12
%D 1979
%P 227-243

%A J.W. Cohen
%T The multiple phase service network with generalized processor sharing
%J Acta Informatica
%K acta_inf
%V 12
%D 1979
%P 245-284

%A Erol Gelenbe
%T Probabilistic models of computer systems
Part II: Diffusion approximations, waiting times and batch arrivals
%J Acta Informatica
%K acta_inf
%V 12
%D 1979
%P 285-303

%A Teruo Hikita
%T On a class of recursive procedures and equivalent iterative ones
%J Acta Informatica
%K acta_inf
%V 12
%D 1979
%P 305-320

%A N. Mikou
%A S. Tucci
%T Analyse et optimisation d'une procedure de reprise
dans un systeme de gestion de donnees centralisees
%J Acta Informatica
%K acta_inf
%V 12
%D 1979
%P 321-338

%A Eljas Soisalon-Soininen
%A Esko Ukkonen
%T A method for transforming grammars into LL(k) form
%J Acta Informatica
%K acta_inf
%V 12
%D 1979
%P 339-369

%A Kurt Mehlhorn
%T Some remarks on boolean sums
%J Acta Informatica
%K acta_inf
%V 12
%D 1979
%P 371-375

%A Hirokazu Nishimura
%T Sequential method in propositional dynamic logic
%J Acta Informatica
%K acta_inf
%V 12
%D 1979
%P 377-400

%A Edsger W. Dijkstra
%T Some beautiful arguments using mathematical induction
%J Acta Informatica
%K acta_inf
%V 13
%D 1980
%P 1-8

%A Cristoph M. Hoffmann
%T Semantic properties of Lucid's compute clause and its compilation
%J Acta Informatica
%K acta_inf
%V 13
%D 1980
%P 9-20

%A Philip Heidelberger
%T Variance reduction techniques for the simulation of Markov processes
II matrix iterative methods
%J Acta Informatica
%K acta_inf
%V 13
%D 1980
%P 21-37

%A Gaston H. Gonnet
%A Lawrence D. Rogers
%A J. Alan George
%T An algorithmic and complexity analysis of interpolation search
%J Acta Informatica
%K acta_inf
%V 13
%D 1980
%P 39-52

%A Zvi Galil
%T Applications of efficient mergeable heaps for optimization problems on trees
%J Acta Informatica
%K acta_inf
%V 13
%D 1980
%P 53-58

%A Stefan Reisch
%T Gobang ist PSPACE-vollstandig
%J Acta Informatica
%K acta_inf
%V 13
%D 1980
%P 59-66

%A Jorg Siekmann
%A Graham Wrightson
%T Paramodulated connection graphs
%J Acta Informatica
%K acta_inf
%V 13
%D 1980
%P 67-86

%A H.A. Maurer
%A A. Salomaa
%A D. Wood
%T An generators and generative capacity of EOL forms
%J Acta Informatica
%K acta_inf
%V 13
%D 1980
%P 87-107

%A Ingo Wegener
%T A new lower bound on the monotone network complexity of boolean sums
%J Acta Informatica
%K acta_inf
%V 13
%D 1980
%P 109-114

%A Johannes Rohrich
%T Methods for the automatic construction of error correcting parsers
%J Acta Informatica
%K acta_inf
%V 13
%D 1980
%P 115-139

%A C.N. Fischer
%A D.R. Milton
%A S.B. Quiring
%T Efficient LL(1) error correction and recovery using only insertions
%J Acta Informatica
%K acta_inf
%V 13
%D 1980
%P 141-154

%A J.L. Bentley
%A H.A. Maurer
%T Efficient worst-case data structures for range searching
%J Acta Informatica
%K acta_inf
%V 13
%D 1980
%P 155-168

%A Edmund Melson Clarke
%T Proving correctness of coroutines without history variables
%J Acta Informatica
%K acta_inf
%V 13
%D 1980
%P 169-188

%A Christophe Reutenauer
%T An Ogden-like iteration lemma for rational power series
%J Acta Informatica
%K acta_inf
%V 13
%D 1980
%P 189-197

%A Chandra M.R. Kintala
%A Detlef Wotschke
%T Amounts of nondeterminism in finite automata
%J Acta Informatica
%K acta_inf
%V 13
%D 1980
%P 199-204

%A Frank W. Tompa
%T A practical example of the specification of abstract data types
%J Acta Informatica
%K acta_inf
%V 13
%D 1980
%P 205-224

%A David R. Barstow
%T Remarks on "A synthesis of several sorting algorithms" by John Darlington
%J Acta Informatica
%K acta_inf
%V 13
%D 1980
%P 225-227

%A Uwe Kastens
%T Ordered attribute grammars
%J Acta Informatica
%K acta_inf
%V 13
%D 1980
%P 229-256

%A G. Rozenberg
%A D. Wood
%T Context-free grammars with selective rewriting
%J Acta Informatica
%K acta_inf
%V 13
%D 1980
%P 257-268

%A Hans Kleine Buning
%A Lutz Priese
%T Universal asynchronous iterative array of Mealy automata
%J Acta Informatica
%K acta_inf
%V 13
%D 1980
%P 269-285

%A H.A. Rollik
%T Automaten in planaren Graphen
%J Acta Informatica
%K acta_inf
%V 13
%D 1980
%P 287-298

%A William R. Franta
%A Mark Benedict Bilodeau
%T Analysis of a prioritized CSMA protocol based on staggered delays
%J Acta Informatica
%K acta_inf
%V 13
%D 1980
%P 299-324

%A A.T. Berztiss
%T Depth-first K-trees and critical path analysis
%J Acta Informatica
%K acta_inf
%V 13
%D 1980
%P 325-346

%A Michel Latteux
%T Sur les generateurs algebriques et lineaires
%J Acta Informatica
%K acta_inf
%V 13
%D 1980
%P 347-363

%A H.A. Maurer
%A M. Nivat
%T Rational bijection of rational sets
%J Acta Informatica
%K acta_inf
%V 13
%D 1980
%P 365-378

%A Susumo Morito
%A Harvey M. Salkin
%T Using the Blankinship algorithm to find
the general solution of a linear Diophantine equation
%J Acta Informatica
%K acta_inf
%V 13
%D 1980
%P 379-382

%A Bernhard Mescheder
%T On the number of active *-operations needed to compute
the discrete Fourier transform
%J Acta Informatica
%K acta_inf
%V 13
%D 1980
%P 383-408

%A Bruce Russell
%T Correctness of the compiling process based on axiomatic semantics
%J Acta Informatica
%K acta_inf
%V 14
%D 1980
%P 1-20

%A Leslie Lamport
%T The "Hoare logic" of concurrent programs
%J Acta Informatica
%K acta_inf
%V 14
%D 1980
%P 21-37

%A B. Plateau
%T Evaluation des performances d'un algorithme
de controle de la coherence d'une base de donnees repartie
%J Acta Informatica
%K acta_inf
%V 14
%D 1980
%P 39-62

%A Carla Schlatter Ellis
%T Concurrent search and insertion in 2-3 trees
%J Acta Informatica
%K acta_inf
%V 14
%D 1980
%P 63-86

%A Riner Phillip
%A Ernst-Jurgen Praub
%T Uber Separatoren in planaren Graphen
%J Acta Informatica
%K acta_inf
%V 14
%D 1980
%P 87-106

%A Allan G. Bromley
%T Memory fragmentation in buddy methods for dynamic storage allocation
%J Acta Informatica
%K acta_inf
%V 14
%D 1980
%P 107-117

%A V.K. Vaishnavi
%A H.P. Kriegel
%A D. Wood
%T Optimum multiway search trees
%J Acta Informatica
%K acta_inf
%V 14
%D 1980
%P 119-133

%A Reiji Nakajima
%A Michio Honda
%A Hayao Nakahara
%T Hierarchical program specification and verification -
a many-sorted logical approach
%J Acta Informatica
%K acta_inf
%V 14
%D 1980
%P 135-155

%A Eljas Soisalon-Soininen
%T On the space optimizing effect
of eliminating single productions from LR parsers
%J Acta Informatica
%K acta_inf
%V 14
%D 1980
%P 157-174

%A Lutz Michael Wegner
%T On parsing two-level grammars
%J Acta Informatica
%K acta_inf
%V 14
%D 1980
%P 175-193

%A Marco A. Casanova
%A Philip A. Bernstein
%T General purpose schedulers for database systems
%J Acta Informatica
%K acta_inf
%V 14
%D 1980
%P 195-220

%A Zvi Galil
%T An O(V^(5/3)E^(2/3)) algorithm for the maximal flow problem
%J Acta Informatica
%K acta_inf
%V 14
%D 1980
%P 221-242

%A Wolfgang J. Paul
%A Ernst J. Praub
%A Rudiger Reischuk
%T On alternation
%J Acta Informatica
%K acta_inf
%V 14
%D 1980
%P 243-255

%A Beate Commentz-Walter
%A Juergen Sattler
%T Size-depth tradeoff in non-monotone boolean formulae
%J Acta Informatica
%K acta_inf
%V 14
%D 1980
%P 257-269

%A Anton Nijholt
%T A survey of normal form covers for context free grammars
%J Acta Informatica
%K acta_inf
%V 14
%D 1980
%P 271-294

%A R. Kemp
%T A note on the density of inherently ambiguous context-free languages
%J Acta Informatica
%K acta_inf
%V 14
%D 1980
%P 295-298

%A Paul Purdom
%A Cynthia A. Brown
%T Semantic routines and LR(k) parsers
%J Acta Informatica
%K acta_inf
%V 14
%D 1980
%P 299-315

%A K.R. Moll
%T Left context precedence grammars
%J Acta Informatica
%K acta_inf
%V 14
%D 1980
%P 317-335

%A Mitchell Wand
%T First-order identities as a defining language
%J Acta Informatica
%K acta_inf
%V 14
%D 1980
%P 337-357

%A Hirokazu Nishimura
%T Descriptively complete process logic
%J Acta Informatica
%K acta_inf
%V 14
%D 1980
%P 359-369

%A F. Kroger
%T Infinite proof rules for loops
%J Acta Informatica
%K acta_inf
%V 14
%D 1980
%P 371-389

%A Wolfgang Paul
%A Rudiger Reischuk
%T On alternation II
%J Acta Informatica
%K acta_inf
%V 14
%D 1980
%P 391-403

%A William E. Wright
%T Binary search trees in secondary memory
%J Acta Informatica
%K acta_inf
%V 15
%D 1981
%P 3-17

%A Onno J. Boxma
%A Alan G. Konheim
%T Approximate analysis of exponential queueing systems with blocking
%J Acta Informatica
%K acta_inf
%V 15
%D 1981
%P 19-66

%A Francois Baccelli
%T Analysis of a service facility with periodic checkpointing
%J Acta Informatica
%K acta_inf
%V 15
%D 1981
%P 67-81

%A D.M. Berry
%T Remarks on R.D. Tennent's
"Language design methods based on semantic principles":
Algol 68, a language designed using semantic principles
%J Acta Informatica
%K acta_inf
%V 15
%D 1981
%P 83-98

%A Paul Walton Purdom,\ Jr.
%A Cynthia A. Brown
%A Edward L. Robertson
%T Backtracking with multi-level dynamic search arrangement
%J Acta Informatica
%K acta_inf
%V 15
%D 1981
%P 99-113

%A Paul Walton Purdom,\ Jr.
%A Cynthia A. Brown
%T Parsing extended LR(k) grammars
%J Acta Informatica
%K acta_inf
%V 15
%D 1981
%P 115-127

%A Werner Kuich
%T The characterization of parallel ultralinear grammars
by rational power series
%J Acta Informatica
%K acta_inf
%V 15
%D 1981
%P 129-139

%A L. Kou
%A G. Markowsky
%A L. Berman
%T A fast algorithm for Steiner trees
%J Acta Informatica
%K acta_inf
%V 15
%D 1981
%P 141-145

%A Ingo Wegener
%T An improved complexity hierarchy on the depth of boolean functions
%J Acta Informatica
%K acta_inf
%V 15
%D 1981
%P 147-152

%A F. Rodriguez
%T Independance forte de certaines operations
%J Acta Informatica
%K acta_inf
%V 15
%D 1981
%P 153-166

%A Stefan Reisch
%T Hex ist PSPACE-vollstandig
%J Acta Informatica
%K acta_inf
%V 15
%D 1981
%P 167-191

%A Daniel J. Moore
%A Bruce Russell
%T Axiomatic data type specifications: a first order theory of linear lists
%J Acta Informatica
%K acta_inf
%V 15
%D 1981
%P 193-207

%A Toshiro Araki
%A Nobuki Tokura
%T Flow languages equal recursively enumerable languages
%J Acta Informatica
%K acta_inf
%V 15
%D 1981
%P 209-217

%A Krzysztof R. Apt
%T Recursive assertions and parallel programs
%J Acta Informatica
%K acta_inf
%V 15
%D 1981
%P 219-232

%A R.J.R. Back
%T Proving total correctness of nondeterministic programs in infinitary logic
%J Acta Informatica
%K acta_inf
%V 15
%D 1981
%P 233-249

%A H. Daduna
%A R. Schassberger
%T A discrete-time round-robin queue
with Bernoulli input and general arithmetic service time distributions
%J Acta Informatica
%K acta_inf
%V 15
%D 1981
%P 251-263

%A R. Kemp
%T LR(0) grammars generated by LR(0) parsers
%J Acta Informatica
%K acta_inf
%V 15
%D 1981
%P 265-280

%A Gary Marc Levin
%A David Gries
%T A proof technique for communicating sequential processes
%J Acta Informatica
%K acta_inf
%V 15
%D 1981
%P 281-302

%A Stal O. Anderaa
%A Egon Borger
%T The equivalence of Horn and network complexity for boolean functions
%J Acta Informatica
%K acta_inf
%V 15
%D 1981
%P 303-307

%A Ernst Mayr
%T Persistence of vector replacement systems is decidable
%J Acta Informatica
%K acta_inf
%V 15
%D 1981
%P 309-318

%A Kellogg S. Booth
%A Richard J. Lipton
%T Computing extremal and approximate distances
in graphs having unit cost edges
%J Acta Informatica
%K acta_inf
%V 15
%D 1981
%P 319-328

%A W. Lipski,\ Jr.
%A F.P. Preparata
%T Efficient algorithms for finding maximum matchings
in convex bipartite graphs and related problems
%J Acta Informatica
%K acta_inf
%V 15
%D 1981
%P 329-346

%A Donald L. Iglehart
%A Gerald S. Shedler
%T Regenerative simulation of response times in networks of queues:
statistical efficiency
%J Acta Informatica
%K acta_inf
%V 15
%D 1981
%P 347-363

%A Robert Cartwright
%A Derek Oppen
%T The logic of aliasing
%J Acta Informatica
%K acta_inf
%V 15
%D 1981
%P 365-384

%A Arie de Bruin
%T Goto statements: semantics and deduction systems
%J Acta Informatica
%K acta_inf
%V 15
%D 1981
%P 385-424

%A Harald Wurges
%T A specification technique based on predicate transformers
%J Acta Informatica
%K acta_inf
%V 15
%D 1981
%P 425-445

%A Takehiro Tokuda
%T Eliminating unit reductions from LR(k) parsers using minimum contexts
%J Acta Informatica
%K acta_inf
%V 15
%D 1981
%P 447-470

%A Zvi Kedem
%A Abraham Silberschatz
%T A characterization of database graphs admitting a simple locking protocol
%J Acta Informatica
%K acta_inf
%V 16
%D 1981
%P 1-13

%A M. Clint
%T On the use of history variables
%J Acta Informatica
%K acta_inf
%V 16
%D 1981
%P 15-30

%A Richard Hamlet
%T Reliability theory of program testing
%J Acta Informatica
%K acta_inf
%V 16
%D 1981
%P 31-43

%A Manfred Stadel
%T Behandlung verschiedener INTEGER-Darstellungen durch optimierende Compiler
%J Acta Informatica
%K acta_inf
%V 16
%D 1981
%P 45-56

%A R. Schassberger
%T On the response time distribution in a discrete round-robin queue
%J Acta Informatica
%K acta_inf
%V 16
%D 1981
%P 57-62

%A D. Janssens
%A G. Rozenberg
%T A characterization of context-free string languages
by directed node-label controlled graph grammars
%J Acta Informatica
%K acta_inf
%V 16
%D 1981
%P 63-85

%A Paul Pritchard
%T Another look at the "longest ascending subsequence" problem
%J Acta Informatica
%K acta_inf
%V 16
%D 1981
%P 87-91

%A Eike Best
%A Brian Randell
%T A formal model of atomicity in asynchronous systems
%J Acta Informatica
%K acta_inf
%V 16
%D 1981
%P 93-124

%A Thomas J. Ostrand
%A Marvin C. Paull
%A Elaine J. Weyuker
%T Parsing regular grammars with finite lookahead
%J Acta Informatica
%K acta_inf
%V 16
%D 1981
%P 125-138

%A Volker Claus
%T The (n,k)-bounded emptiness-problem for probabilistic acceptors
and related problems
%J Acta Informatica
%K acta_inf
%V 16
%D 1981
%P 139-160

%A Ernst-Rudiger Olderog
%T Sound and complete Hoare-like calculi based on copy rules
%J Acta Informatica
%K acta_inf
%V 16
%D 1981
%P 161-197

%A Andrzej Blikel
%T The clean termination of iterative programs
%J Acta Informatica
%K acta_inf
%V 16
%D 1981
%P 199-217

%A Alain J. Martin
%T An axiomatic definition of synchronization primitives
%J Acta Informatica
%K acta_inf
%V 16
%D 1981
%P 219-235

%A T.I. Fenner
%A G. Loizou
%T An analysis of two related loop-free algorithms
for generating integer partitions
%J Acta Informatica
%K acta_inf
%V 16
%D 1981
%P 237-252

%A Jayashree Ramanathan
%A Ken Kennedy
%T Pathlistings applied to data flow analysis
%J Acta Informatica
%K acta_inf
%V 16
%D 1981
%P 253-273

%A Joost Engelfriet
%A Gilberto File
%T The formal power of one-visit attribute grammars
%J Acta Informatica
%K acta_inf
%V 16
%D 1981
%P 275-302

%A Leslie M. Goldschlager
%T Epsilon-productions in context-free grammars
%J Acta Informatica
%K acta_inf
%V 16
%D 1981
%P 303-308

%A John L. Hennessy
%A Richard B. Kieburtz
%T The formal definition of a real-time language
%J Acta Informatica
%K acta_inf
%V 16
%D 1981
%P 309-345

%A Thomas Klinger
%A Stefan Reisch
%T A gap between the actual complexity of permutations
and their entropy defined by Stob
%J Acta Informatica
%K acta_inf
%V 16
%D 1981
%P 347-362

%A George Markowsky
%T Best Huffman trees
%J Acta Informatica
%K acta_inf
%V 16
%D 1981
%P 363-370

%A Zohar Manna
%A Richard Waldinger
%T Problematic features of programming languages:
a situational-calculus approach
%J Acta Informatica
%K acta_inf
%V 16
%D 1981
%P 371-426

%A Henk Alblas
%T A characterization of attribute evaluation in passes
%J Acta Informatica
%K acta_inf
%V 16
%D 1981
%P 427-464

%A Thomas Lengauer
%T Black-white pebbles and graph separation
%J Acta Informatica
%K acta_inf
%V 16
%D 1981
%P 465-475

%A T. Gergely
%A L. Ury
%T A theory of interactive programming
%J Acta Informatica
%K acta_inf
%V 17
%D 1982
%P 1-20

%A A. Arnold
%T Synchronized behaviours of processes and rational relations
%J Acta Informatica
%K acta_inf
%V 17
%D 1982
%P 21-29

%A C.L. Liu
%A W.S. Liu
%A A.L. Liestman
%T Scheduling with slack time
%J Acta Informatica
%K acta_inf
%V 17
%D 1982
%P 31-41

%A J.E. Shore
%T Information theoretic approximations for M/G/1 and G/G/1 queueing systems
%J Acta Informatica
%K acta_inf
%V 17
%D 1982
%P 43-61

%A S. Miyano
%T A hierarchy theorem for multihead stack-counter automata
%J Acta Informatica
%K acta_inf
%V 17
%D 1982
%P 63-67

%A G. Rozenberg
%A R. Verraedt
%T Vompleteness of E0L forms is decidable
%J Acta Informatica
%K acta_inf
%V 17
%D 1982
%P 69-87

%A T.-D. Huynh
%T Remarks on the complexity of an invariant of context-free grammars
%J Acta Informatica
%K acta_inf
%V 17
%D 1982
%P 89-99

%A M. Martinez
%T Program behaviour prediction and prepaging
%J Acta Informatica
%K acta_inf
%V 17
%D 1982
%P 101-120

%A M.O. Rabin
%T The choice coordination problem
%J Acta Informatica
%K acta_inf
%V 17
%D 1982
%P 121-134

%A J.L.W. Kessels
%T Arbitration without common modifiable terms
%J Acta Informatica
%K acta_inf
%V 17
%D 1982
%P 135-141

%A S. Vasudevan
%T Inner loops in flowgraphs and code optimization
%J Acta Informatica
%K acta_inf
%V 17
%D 1982
%P 143-155

%A S. Huddleston
%A K. Mehlhorn
%T A new data structure for representing sorted lists
%J Acta Informatica
%K acta_inf
%V 17
%D 1982
%P 157-184

%A K.-J. Raiha
%A M. Saarinen
%T Testing attribute grammars for circularity
%J Acta Informatica
%K acta_inf
%V 17
%D 1982
%P 185-192

%A J.-M. Autebert
%A J. Beauquier
%A L. Boasson
%T Formes de langages et de grammaires
%J Acta Informatica
%K acta_inf
%V 17
%D 1982
%P 193-213

%A A. Itai
%A M. Rodeh
%T Representation of graphs
%J Acta Informatica
%K acta_inf
%V 17
%D 1982
%P 215-219

%A H. Huwig
%T Ein Modell des P=NP Problems mit einer positiven Losung
%J Acta Informatica
%K acta_inf
%V 17
%D 1982
%P 221-243

%A E.E. Doberkat
%T Deleting the root of a heap
%J Acta Informatica
%K acta_inf
%V 17
%D 1982
%P 245-265

%A M.H. Overmars
%A J. van\ Leeuwen
%T Dynamic multi-dimensional data structures based on quad- and K-D trees
%J Acta Informatica
%K acta_inf
%V 17
%D 1982
%P 267-285

%A F. Baccelli
%A T. Fleury
%T On parsing arithmetic expressions in a multiprocessing environment
%J Acta Informatica
%K acta_inf
%V 17
%D 1982
%P 287-310

%A A. Staphylopatis
%T Performance considerations in the parallel execution
of numerical algorithms on two processors
%J Acta Informatica
%K acta_inf
%V 17
%D 1982
%P 311-325

%A L. Snyder
%T Recognition and selection of idioms for code optimization
%J Acta Informatica
%K acta_inf
%V 17
%D 1982
%P 327-348

%A A. Demers
%A C. Keleman
%A B. Reusch
%T On some decidable properties of finite state translations
%J Acta Informatica
%K acta_inf
%V 17
%D 1982
%P 349-364

%A F. Cristian
%T Robust data types
%J Acta Informatica
%K acta_inf
%V 17
%D 1982
%P 365-397

%A C.H.C. Leung
%A Q.H. Choo
%T The effect of fixed-length record implementation on file system response
%J Acta Informatica
%K acta_inf
%V 17
%D 1982
%P 399-409

%A J. Ja' Ja'
%A J. Simon
%T Space efficient algorithms for some graph theoretical problems
%J Acta Informatica
%K acta_inf
%V 17
%D 1982
%P 411-423

%A N. Blum
%T On the power of chain rules in context free grammars
%J Acta Informatica
%K acta_inf
%V 17
%D 1982
%P 425-433

%A E. Soisalon-Soininen
%A D. Wood
%T On a covering relation for context-free grammars
%J Acta Informatica
%K acta_inf
%V 17
%D 1982
%P 435-449

%A P.R.J. Asveld
%A J.V. Tucker
%T Complexity theory and the operational structure
of algebraic programming systems
%J Acta Informatica
%K acta_inf
%V 17
%D 1982
%P 451-476

%A P. Pritchard
%T Explaining the wheel sieve
%J Acta Informatica
%K acta_inf
%V 17
%D 1982
%P 477-485

%A R.B.K. Dewar
%A S.M. Merritt
%A M. Sharir
%T Some modified algorithms for Dijkstra's longest upsequence problem
%J Acta Informatica
%K acta_inf
%V 18
%D 1982
%P 1-15

%A R.J. Ramirez
%A F.W. Tompa
%A J.I. Munro
%T Optimum reorganization points for arbitrary database costs
%J Acta Informatica
%K acta_inf
%V 18
%D 1982
%P 17-30

%A T.A. Budd
%A Dana Angluin
%T Two notions of correctness and their relation to testing
%J Acta Informatica
%K acta_inf
%V 18
%D 1982
%P 31-45

%A M. Broy
%A M. Wirsing
%T Partial abstract types
%J Acta Informatica
%K acta_inf
%V 18
%D 1982
%P 47-64

%A J. Leguy
%T Langages satures at cones decroissants. Langages at cones bifideles
%J Acta Informatica
%K acta_inf
%V 18
%D 1982
%P 65-78

%A H. Langmaack
%T On termination problems for finitely interpreted ALGOL-like programs
%J Acta Informatica
%K acta_inf
%V 18
%D 1982
%P 79-108

%A C. Frougny
%A J. Sakarovitch
%A E. Valkema
%T On the Hotz group of a context-free grammar
%J Acta Informatica
%K acta_inf
%V 18
%D 1982
%P 109-115

%A W. Reisig
%T Deterministic buffer synchronization of sequential processes
%J Acta Informatica
%K acta_inf
%V 18
%D 1982
%P 117-134

%A L.R. Carter
%T Further analysis of code generation for a single register machine
%J Acta Informatica
%K acta_inf
%V 18
%D 1982
%P 135-147

%A G.W. Ernst
%A J.K. Navlakha
%A W.F. Ogden
%T Verification of programs with procedure-type parameters
%J Acta Informatica
%K acta_inf
%V 18
%D 1982
%P 149-169

%A N. Nakatsu
%A Y. Kambayashi
%A S. Yajima
%T A longest common subsequence algorithm suitable for similar text strings
%J Acta Informatica
%K acta_inf
%V 18
%D 1982
%P 171-179

%A A. Pettorossi
%A R.M. Burstall
%T Deriving very efficient algorithms
for evaluating linear recurrence relations
using the program transformation technique
%J Acta Informatica
%K acta_inf
%V 18
%D 1982
%P 181-206

%A D.J. Brown
%A B.S. Baker
%A H.P. Katseff
%T Lower bounds for on-line two-dimensional packing algorithms
%J Acta Informatica
%K acta_inf
%V 18
%D 1982
%P 207-225

%A J.-M. Nicolas
%T Logic for improving integrity checking in relational data bases
%J Acta Informatica
%K acta_inf
%V 18
%D 1982
%P 227-253

%A B. Allen
%T On the costs of optimal and near-optimal binary search trees
%J Acta Informatica
%K acta_inf
%V 18
%D 1982
%P 255-263

%A F. Nielson
%T A denotational framework for data flow analysis
%J Acta Informatica
%K acta_inf
%V 18
%D 1982
%P 265-287

%A S.O. Anderson
%A R.C. Backhouse
%T An alternative implementation of an insertion-only recovery technique
%J Acta Informatica
%K acta_inf
%V 18
%D 1982
%P 289-298

%A K. Winklmann
%T On the complexity of some problems concerning the use of procedures I
%J Acta Informatica
%K acta_inf
%V 18
%D 1982
%P 299-318

%A A.K. Agrawala
%A S.K. Tripathi
%T On an exponential server with general cyclic arrivals
%J Acta Informatica
%K acta_inf
%V 18
%D 1982
%P 319-334

%A K. Culik II
%A J. Gruska
%A A. Salomaa
%T Systolic automata for VLSI on balanced trees
%J Acta Informatica
%K acta_inf
%V 18
%D 1983
%P 335-344

%A J. van\ Leeuwen
%A M.H. Overmars
%T Stratified balanced search trees
%J Acta Informatica
%K acta_inf
%V 18
%D 1983
%P 345-359

%A O. Erkisen
%A J. Staunstrup
%T Concurrent algorithms for root searching
%J Acta Informatica
%K acta_inf
%V 18
%D 1983
%P 361-376

%A K.J. Supowit
%A E.M. Reingold
%T The complexity of drawing trees nicely
%J Acta Informatica
%K acta_inf
%V 18
%D 1983
%P 377-392

%A G. Slutzki
%T Finite state relational programs
%J Acta Informatica
%K acta_inf
%V 18
%D 1983
%P 393-409

%A K. Winklmann
%T On the complexity of some problems concerning the use of procedures II
%J Acta Informatica
%K acta_inf
%V 18
%D 1983
%P 411-430

%A J.-P. Banatre
%A P. Frison
%A P. Quinton
%T A network for the detection of words in continuous speech
%J Acta Informatica
%K acta_inf
%V 18
%D 1983
%P 431-448

%A P. Nain
%T Partage de taches entre processeurs homogenes
%J Acta Informatica
%K acta_inf
%V 18
%D 1983
%P 449-466

%A H.T. Jung
%A C.H. Papadimitriou
%T An optimality theory of concurrency control for databases
%J Acta Informatica
%K acta_inf
%V 19
%D 1983
%P 1-11

%A T. Tsuda
%A T. Sato
%T Transposition of large tabular data structures
with applications to physical database organization
part I: transposition of tabular data structures
%J Acta Informatica
%K acta_inf
%V 19
%D 1983
%P 13-33

%A K. Kuspert
%T Storage utilization in B*-trees with a generalized overflow technique
%J Acta Informatica
%K acta_inf
%V 19
%D 1983
%P 35-55

%A R.N. Taylor
%T Complexity of analyzing the synchronization structure of concurrent programs
%J Acta Informatica
%K acta_inf
%V 19
%D 1983
%P 57-84

%A K. Iwama
%T The universe problem for unrestricted flow languages
%J Acta Informatica
%K acta_inf
%V 19
%D 1983
%P 85-96

%A J.A. Bergstra
%A J. Terlouw
%T Standard model semantics for DSL, a data type specification language
%J Acta Informatica
%K acta_inf
%V 19
%D 1983
%P 97-113

%A G. File
%T Interpretation and reduction of attribute grammars
%J Acta Informatica
%K acta_inf
%V 19
%D 1983
%P 115-150

%A G.E. Ptaff
%T The construction of operator interfaces
based on logical input devices
%J Acta Informatica
%K acta_inf
%V 19
%D 1983
%P 151-166

%A T. Tsuda
%A A. Urano
%A T. Sato
%T Transposition of large tabular data structures
with applications to physical database organization
part II: applications to physical database organization
%J Acta Informatica
%K acta_inf
%V 19
%D 1983
%P 167-182

%A U. Schurfeld
%T New lower bounds on the formula size of boolean functions
%J Acta Informatica
%K acta_inf
%V 19
%D 1983
%P 183-194

%A J.P. Queille
%A J. Sifakis
%T Fairness and related properties in transition systems -
a temporal logic to deal with fairness
%J Acta Informatica
%K acta_inf
%V 19
%D 1983
%P 195-220

%A J.P. Kearns
%A M.L. Soffa
%T The implementation of retention in a coroutine environment
%J Acta Informatica
%K acta_inf
%V 19
%D 1983
%P 221-233

%A G. Engels
%A U. Pletat
%A H.-D. Ehrich
%T An operational semantics
for specifications of abstract data types with error handling
%J Acta Informatica
%K acta_inf
%V 19
%D 1983
%P 235-253

%A H.R. Nielson
%T Computation sequences: a way to characterize classes of attribute grammars
%J Acta Informatica
%K acta_inf
%V 19
%D 1983
%P 255-268

%A F. Meyer auf der Heide
%T Efficiency of universal parallel computers
%J Acta Informatica
%K acta_inf
%V 19
%D 1983
%P 269-296

%A A. Schmidt
%T On the number of relational operators necessary to compute
certain functions of real variables
%J Acta Informatica
%K acta_inf
%V 19
%D 1983
%P 297-304

%A M.Y. Vardi
%T Inferring multivalued dependencies from functional and join dependencies
%J Acta Informatica
%K acta_inf
%V 19
%D 1983
%P 305-324

%A I. Suzuki
%A T. Kasami
%T Three measures for synchronic dependence in Petri nets
%J Acta Informatica
%K acta_inf
%V 19
%D 1983
%P 325-338

%A M.A. El-Affendi
%A D.D. Kouvatsos
%T A maximum entropy analysis of the
M/G/1 and G/M/1 queueing systems at equilibrium
%J Acta Informatica
%K acta_inf
%V 19
%D 1983
%P 339-355

%A R. Rouhonen
%T On some variants of Post's correspondence problem
%J Acta Informatica
%K acta_inf
%V 19
%D 1983
%P 357-367

%A R. Agrawal
%A K.D. Detro
%T An efficient incremental LR parser for grammars with epsilon productions
%J Acta Informatica
%K acta_inf
%V 19
%D 1983
%P 369-376

%A J. Hromkovic
%T One-way multihead deterministic finite automata
%J Acta Informatica
%K acta_inf
%V 19
%D 1983
%P 377-384

%A P. Klein
%A F. Meyer auf der Heide
%T A lower time bound for the knapsack problem on random access machines
%J Acta Informatica
%K acta_inf
%V 19
%D 1983
%P 385-395

%A R. Sommerhalder
%A S.C. van\ Westrhenen
%T Parallel language recognition in constant time by cellular automata
%J Acta Informatica
%K acta_inf
%V 19
%D 1983
%P 397-407

%A M. Wirsing
%A P. Pepper
%A H. Partsch
%A W. Dosch
%A M. Broy
%T On hierarchies of abstract data types
%J Acta Informatica
%K acta_inf
%V 20
%D 1983
%P 1-33

%A J. He
%T General predicate transformer
and the semantics of a programming language with go to statement
%J Acta Informatica
%K acta_inf
%V 20
%D 1983
%P 35-57

%A W. Damm
%A B. Josko
%T A sound and relatively * complete Hoare-logic
for a language with higher type procedures
%J Acta Informatica
%K acta_inf
%V 20
%D 1983
%P 59-101

%A A.K. Chandra
%A L.T. Kou
%A G. Markowsky
%A S. Zaks
%T On sets of boolean n-vectors with all k-projections surjective
%J Acta Informatica
%K acta_inf
%V 20
%D 1983
%P 103-111

%A H. Kameda
%T A note on multi-queue scheduling to two tasks
%J Acta Informatica
%K acta_inf
%V 20
%D 1983
%P 113-120

%A H. Akdag
%T Performances of an algorithm constructing a nearly optimal binary tree
%J Acta Informatica
%K acta_inf
%V 20
%D 1983
%P 121-132

%A W. Bucher
%T Two-symbol DOS systems generating regular languages
%J Acta Informatica
%K acta_inf
%V 20
%D 1983
%P 133-142

%A H. Mannila
%A K.-J. Raiha
%T On the relationship of minimum and optimal covers
for a set of of functional dependencies
%J Acta Informatica
%K acta_inf
%V 20
%D 1983
%P 143-158

%A M. Coppo
%T On the semantics of polymorphism
%J Acta Informatica
%K acta_inf
%V 20
%D 1983
%P 159-170

%A N. Goodman
%A O. Shmueli
%T NP-complete problems simplified on tree schemas
%J Acta Informatica
%K acta_inf
%V 20
%D 1983
%P 171-178

%A J.-J. Pansiot
%T Hierarchie at fermeture de certaines classes de tag-systemes
%J Acta Informatica
%K acta_inf
%V 20
%D 1983
%P 179-196

%A C. Ronse
%T A three-stage construction for multiconnection networks
%J Acta Informatica
%K acta_inf
%V 20
%D 1983
%P 197-206

%A M. Ben-Ari
%A A. Pnueli
%A Z. Manna
%T The temporal logic of branching time
%J Acta Informatica
%K acta_inf
%V 20
%D 1983
%P 207-226

%A H.-U. Simon
%T Pattern matching in trees and nets
%J Acta Informatica
%K acta_inf
%V 20
%D 1983
%P 227-248

%A G. Marque-Pucheu
%T Rational set of trees and the algebraic semantics of logic programming
%J Acta Informatica
%K acta_inf
%V 20
%D 1983
%P 249-260

%A J.A. Bannister
%A K.S. Trivedi
%T Task allocation in fault-tolerant distributed systems
%J Acta Informatica
%K acta_inf
%V 20
%D 1983
%P 261-281

%A W. Pohlmann
%T LR parsing for affix grammars
%J Acta Informatica
%K acta_inf
%V 20
%D 1983
%P 283-300

%A A.J. Martin
%T A general proof rule for procedures
in predicate transformer semantics
%J Acta Informatica
%K acta_inf
%V 20
%D 1983
%P 301-313

%A A. Mili
%T A relational approach to the design of deterministic programs
%J Acta Informatica
%K acta_inf
%V 20
%D 1983
%P 315-328

%A N. Francez
%T Product properties and their direct verification
%J Acta Informatica
%K acta_inf
%V 20
%D 1983
%P 329-344

%A P. Flajolet
%T On the performance evaluation of extendible hashing and trie searching
%J Acta Informatica
%K acta_inf
%V 20
%D 1983
%P 345-369

%A A.S. Fraenkel
%A M. Mor
%A Y. Perl
%T Is text compression by prefixes and suffixes practical ?
%J Acta Informatica
%K acta_inf
%V 20
%D 1983
%P 371-389

%A H.C.M. Kleijn
%A G. Rozenberg
%T On the generative power of regular pattern grammars
%J Acta Informatica
%K acta_inf
%V 20
%D 1983
%P 391-411

%A R. Bayer
%A P. Schlichtiger
%T Data management support for database management
%J Acta Informatica
%K acta_inf
%V 21
%D 1984
%P 1-28

%A N.P. Chapman
%T LALR(1,1) parser generation for regular right part grammars
%J Acta Informatica
%K acta_inf
%V 21
%D 1984
%P 29-45

%A J.L. Szwarcfiter
%T Optimal multiway search trees for variable size keys
%J Acta Informatica
%K acta_inf
%V 21
%D 1984
%P 47-60

%A M. Hennessy
%T Axiomatising finite delay operators
%J Acta Informatica
%K acta_inf
%V 21
%D 1984
%P 61-88

%A E. Best
%A K. Voss
%T Free choice systems have home states
%J Acta Informatica
%K acta_inf
%V 21
%D 1984
%P 89-100

%A A.K. Tsakalidis
%T Maintaining order in a generalized linked list
%J Acta Informatica
%K acta_inf
%V 21
%D 1984
%P 101-112

%A S.-H.S. Huang
%A C.K. Wong
%T Generalized binary split trees
%J Acta Informatica
%K acta_inf
%V 21
%D 1984
%P 113-123

%A B.D. Lubachevsky
%T An approach to automating the verification of compact parallel
coordination programs I
%J Acta Informatica
%K acta_inf
%V 21
%D 1984
%P 125-169

%A N. Blum
%A M. Seysen
%T Characterization of all optimal networks
for a simultaneous computation of AND and OR
%J Acta Informatica
%K acta_inf
%V 21
%D 1984
%P 171-181

%A W.D. Gillett
%T On binary tree encodements
%J Acta Informatica
%K acta_inf
%V 21
%D 1984
%P 183-192

%A O.H. Ibarra
%A S.M. Kim
%T A characterization of systolic binary tree automata and applications
%J Acta Informatica
%K acta_inf
%V 21
%D 1984
%P 193-207

%A J.M. Autebert
%A J. Beauquier
%A L. Boasson
%A F. Gire
%T Bicentres de langages algebriques
%J Acta Informatica
%K acta_inf
%V 21
%D 1984
%P 209-227

%A L. Devroye
%T A probabilistic analysis of the height of tries
and of the complexity of triesort
%J Acta Informatica
%K acta_inf
%V 21
%D 1984
%P 229-237

%A R.S. Bird
%T Using circular programs to eliminate multiple traversals of data
%J Acta Informatica
%K acta_inf
%V 21
%D 1984
%P 239-250

%A H. Barringer
%A J.H. Cheng
%A C.B. Jones
%T A logic covering undefinedness in program proofs
%J Acta Informatica
%K acta_inf
%V 21
%D 1984
%P 251-269

%A R.H. Guting
%T Optimal divide-and-conquer to compute measure and contour
for a set of iso-rectangles
%J Acta Informatica
%K acta_inf
%V 21
%D 1984
%P 271-291

%A J.A. Bergstra
%A J.V. Tucker
%T The axiomatic semantics of programs based on Hoare's logic
%J Acta Informatica
%K acta_inf
%V 21
%D 1984
%P 293-320

%A D.L. Iglehart
%A G.S. Shedler
%T Simulation output analysis for local area computer networks
%J Acta Informatica
%K acta_inf
%V 21
%D 1984
%P 321-338

%A K. Melhorn
%A U. Vishkin
%T Randomized and deterministic simulations of PRAMs
by parallel machines with restricted granularity of parallel memories
%J Acta Informatica
%K acta_inf
%V 21
%D 1984
%P 339-374

%A P. Deransart
%A M. Jourdan
%A B. Lorho
%T Speeding up circularity tests for attribute grammars
%J Acta Informatica
%K acta_inf
%V 21
%D 1984
%P 375-391

%A C. Choffrut
%A K. Culik II
%T On real-time cellular automata and trellis automata
%J Acta Informatica
%K acta_inf
%V 21
%D 1984
%P 393-407

%A E.G. Coffman,\ Jr.
%A M.A. Langston
%T A performance guarantee for the greedy set-partitioning algorithm
%J Acta Informatica
%K acta_inf
%V 21
%D 1984
%P 409-415

%A G. Costa
%A C. Stirling
%T A fair calculus of communicating systems
%J Acta Informatica
%K acta_inf
%V 21
%D 1984
%P 417-441

%A D.T. Sannella
%T A set-theoretic semantics for Clear
%J Acta Informatica
%K acta_inf
%V 21
%D 1984
%P 443-472

%A M.A. Bulyonkov
%T Polyvariant mixed computation for analyzer programs
%J Acta Informatica
%K acta_inf
%V 21
%D 1984
%P 473-484

%A C.H.C. Leung
%A Q.H. Choo
%T The paging drum queue: a uniform perspective and further results
%J Acta Informatica
%K acta_inf
%V 21
%D 1984
%P 485-500

%A S. Hertel
%A M. Mantyla
%A K. Melhorn
%A J. Nievergelt
%T Space seep solves intersection of polyhedra
%J Acta Informatica
%K acta_inf
%V 21
%D 1984
%P 501-519

%A G. Bauer
%A F. Otto
%T Finite complete rewriting systems
and the complexity of the word problem
%J Acta Informatica
%K acta_inf
%V 21
%D 1984
%P 521-540

%A W.E. Wright
%T Some average performance measures for the B-tree
%J Acta Informatica
%K acta_inf
%V 21
%D 1985
%P 541-557

%A A.J. Fisher
%T Practical LL(1)-based parsing of van Wijngaarden grammars
%J Acta Informatica
%K acta_inf
%V 21
%D 1985
%P 559-584

%A M.C. Chen
%A M. Rem
%T Deadlock-freedom in resource contentions
%J Acta Informatica
%K acta_inf
%V 21
%D 1985
%P 585-598

%A D.M. Berry
%T A denotational semantics
for shared-memory parallelism and nondeterminism
%J Acta Informatica
%K acta_inf
%V 21
%D 1985
%P 599-627

%A J. Lenfant
%A S. Tahe
%T Permuting data with the Omega network
%J Acta Informatica
%K acta_inf
%V 21
%D 1985
%P 629-641

%A R. Valk
%A M. Jantzen
%T The residue of vector sets with applications
to decidability problems in Petri nets
%J Acta Informatica
%K acta_inf
%V 21
%D 1985
%P 643-674

%A M. Bechtold
%A G. Pujolle
%A O. Spaniol
%T Throughput of a satellite channel communication
%J Acta Informatica
%K acta_inf
%V 22
%N 1
%D April 1985
%P 1-14

%A J.H. Kingston
%T Analysis of tree algorithms for the simulation event list
%J Acta Informatica
%K acta_inf
%V 22
%N 1
%D April 1985
%P 15-34

%A F.B. Schneider
%A R. Conway
%A D. Skeen
%T Thrifty execution of task pipelines
%J Acta Informatica
%K acta_inf
%V 22
%N 1
%D April 1985
%P 35-46

%A A. Mili
%A J. Desharnais
%A J.-R. Gagne
%T Strongest invariant functions:
their use in the systematic analysis of while statements
%J Acta Informatica
%K acta_inf
%V 22
%N 1
%D April 1985
%P 47-56

%A D. Jacobs
%A D. Gries
%T General correctness: a unification of partial and total correctness
%J Acta Informatica
%K acta_inf
%V 22
%N 1
%D April 1985
%P 67-84

%A T. Ottman
%A M. Schrapp
%A D. Wood
%T Purely top-down updating algorithms for stratified search trees
%J Acta Informatica
%K acta_inf
%V 22
%N 1
%D April 1985
%P 85-100

%A D.W. Loveland
%T Performance bounds for binary testing with arbitrary weights
%J Acta Informatica
%K acta_inf
%V 22
%N 1
%D April 1985
%P 101-114

%A B. Monien
%A E. Speckenmeyer
%T Ramsey numbers and an approximation algorithm
for the vertex cover problem
%J Acta Informatica
%K acta_inf
%V 22
%N 1
%D April 1985
%P 115-123

%A C. Meghini
%A C. Thanos
%T Querying fragmented relations in a distributed database
%J Acta Informatica
%K acta_inf
%V 22
%N 2
%D June 1985
%P 125-138

%A J. Bruno
%T On scheduling tasks with exponential service times
and in-tree precedence constraints
%J Acta Informatica
%K acta_inf
%V 22
%N 2
%D June 1985
%P 139-148

%A R.J. Cunningham
%A A.J.J. Dick
%T Rewrite systems on a lattice of types
%J Acta Informatica
%K acta_inf
%V 22
%N 2
%D June 1985
%P 149-170

%A J.-R. Sack
%A T. Strothotte
%T An algorithm for merging heaps
%J Acta Informatica
%K acta_inf
%V 22
%N 2
%D June 1985
%P 171-186

%A N. Chiba
%A K. Onoguchi
%A T. Hishizeki
%T Drawing plane graphs nicely
%J Acta Informatica
%K acta_inf
%V 22
%N 2
%D June 1985
%P 187-202

%A T. Kamimura
%T An effectively given initial semigroup
%J Acta Informatica
%K acta_inf
%V 22
%N 2
%D June 1985
%P 203-228

%A P.E. Dunne
%T A 2.5n lower bound on the monotone network complexity of T(n, 3)
%J Acta Informatica
%K acta_inf
%V 22
%N 2
%D June 1985
%P 229-240

%A B. Rembowski
%T A priority queue with interruptions of service permitted
after a time quantum
%J Acta Informatica
%K acta_inf
%V 22
%N 3
%D August 1985
%P 241-252

%A B. Krishnamurthy
%T Short proofs for tricky formulas
%J Acta Informatica
%K acta_inf
%V 22
%N 3
%D August 1985
%P 253-276

%A J. Gonczarowki
%T Decidable properties of monadic recursive schemas
with a depth parameter
%J Acta Informatica
%K acta_inf
%V 22
%N 3
%D August 1985
%P 277-310

%A P. Rudnicki
%A W. Drabent
%T Proving properties of Pascal programs in MIZAR 2
%J Acta Informatica
%K acta_inf
%V 22
%N 3
%D August 1985
%P 311-332

%A J.L. Bruno
%A P.J. Dowey
%T Probabilistic bounds for dual bin-packing
%J Acta Informatica
%K acta_inf
%V 22
%N 3
%D August 1985
%P 333-345

%A A.J. Kfoury
%A P. Urzyczyn
%T Necessary and sufficient conditions
for the universality of programming formalisms
%J Acta Informatica
%K acta_inf
%V 22
%N 4
%D October 1985
%P 347-378

%A M.-J. Chung
%A W.M. Evangelist
%A I.H. Sudborough
%T Complete problems for space bounded subclasses of NP
%J Acta Informatica
%K acta_inf
%V 22
%N 4
%D October 1985
%P 379-396

%A M. Sonnenschein
%T Global storage cells for attributes in an attribute grammar
%J Acta Informatica
%K acta_inf
%V 22
%N 4
%D October 1985
%P 397-420

%A D.T. Huynh
%T Complexity of the word problem
for commutative semigroups of fixed dimension
%J Acta Informatica
%K acta_inf
%V 22
%N 4
%D October 1985
%P 421-432

%A M. Beynon
%T Replaceability and computational equivalence
for monotone boolean functions
%J Acta Informatica
%K acta_inf
%V 22
%N 4
%D October 1985
%P 433-450

%A E.L. Lloyd
%A M.C. Loui
%T On the worst case performance of buddy systems
%J Acta Informatica
%K acta_inf
%V 22
%N 4
%D October 1985
%P 451-473

%A M. Miyakawa
%T Optimum decision trees -
an optimal variable theorem and its related applications
%J Acta Informatica
%K acta_inf
%V 22
%N 5
%D December 1985
%P 475-498

%A S. Heilbrunner
%T Truly prefix-correct chain-free LR(1) parsers
%J Acta Informatica
%K acta_inf
%V 22
%N 5
%D December 1985
%P 499-536

%A B. Moller
%T On the algebraic specification of infinite objects -
ordered and continuous models of algebraic types
%J Acta Informatica
%K acta_inf
%V 22
%N 5
%D December 1985
%P 537-578

%A M. Latteux
%A B. Leguy
%A B. Ratoandromanana
%T The family of one-counter languages is closed under quotient
%J Acta Informatica
%K acta_inf
%V 22
%N 5
%D December 1985
%P 579-588

%A J. Hromkovic
%T Fooling a two-way nondeterministic multihead automaton
with reversal number restriction
%J Acta Informatica
%K acta_inf
%V 22
%N 5
%D December 1985
%P 589-594

%A Edsger W. Dijkstra
%A A.J.M. van\ Gasteren
%T A simple fixpoint argument without the restriction to continuity
%J Acta Informatica
%K acta_inf
%V 23
%N 1
%D April 1986
%P 1-7

%A E.-R. Olderog
%A C.A.R. Hoare
%T Specification-oriented semantics for communicating processes
%J Acta Informatica
%K acta_inf
%V 23
%N 1
%D April 1986
%P 9-66

%A L. Duponcheel
%A M. Duponcheel
%T Acceptable functional programming systems
%J Acta Informatica
%K acta_inf
%V 23
%N 1
%D April 1986
%P 67-98

%A F. Otto
%T On deciding whether a monoid is a free monoid or is a group
%J Acta Informatica
%K acta_inf
%V 23
%N 1
%D April 1986
%P 99-110

%A Hosam M. Mahmoud
%T On the average internal path length of m-ary search trees
%J Acta Informatica
%K acta_inf
%V 23
%N 1
%D April 1986
%P 111-117

%A S.A. Bengelloun
%T An incremental primal sieve
%J Acta Informatica
%K acta_inf
%V 23
%N 2
%D May 1986
%P 119-126

%A R. Heckmann
%T An efficient ELL(1) parser generator
%J Acta Informatica
%K acta_inf
%V 23
%N 2
%D May 1986
%P 127-148

%A I. Nakata
%A M. Sassa
%T Generation of efficient LALR parsers for regular right part grammars
%J Acta Informatica
%K acta_inf
%V 23
%N 2
%D May 1986
%P 149-162

%A M. Becker
%A K. Mehlhorn
%T Algorithms for routing in planar graphs
%J Acta Informatica
%K acta_inf
%V 23
%N 2
%D May 1986
%P 163-192

%A N. Soundarajan
%T Total correctness of CSP programs
%J Acta Informatica
%K acta_inf
%V 23
%N 2
%D May 1986
%P 193-216

%A M.S. Paterson
%A I. Wegener
%T Nearly optimal hierarchies for network and formula size
%J Acta Informatica
%K acta_inf
%V 23
%N 2
%D May 1986
%P 217-222

%A Y.F. Wu
%A P. Widmayer
%A C.K. Wong
%T A faster approximation algorithm for the Steiner problem in graphs
%J Acta Informatica
%K acta_inf
%V 23
%N 2
%D May 1986
%P 223-229

%A Johann A. Makowsky
%A Moshe Y. Vardi
%T On the expressive power of data dependencies
%J Acta Informatica
%K acta_inf
%V 23
%N 3
%D June 1986
%P 231-244

%A W. Bucher
%T A regularity test for dual bordered OS system systems
%J Acta Informatica
%K acta_inf
%V 23
%N 3
%D June 1986
%P 245-253

%A M. Calzarossa
%A M. Italiani
%A G. Serazzi
%T A workload model representative of static and dynamic characteristics
%J Acta Informatica
%K acta_inf
%V 23
%N 3
%D June 1986
%P 255-266

%A M. Tamminen
%A W.K. Luk
%A P. Sipala
%A L.S. Wo
%A C.K. Wong
%T Constructng maximal slicing from geometry
%J Acta Informatica
%K acta_inf
%V 23
%N 3
%D June 1986
%P 267-288

%A Grzegorz Rozenberg
%A Emo Welzl
%T Graph theoretic closure properties
of the family of boundary NLC graph languages
%J Acta Informatica
%K acta_inf
%V 23
%N 3
%D June 1986
%P 289-309

%A Mirko Krivanek
%A Jaroslav Moravek
%T NP-hard problems in hierarchical-tree clustering
%J Acta Informatica
%K acta_inf
%V 23
%N 3
%D June 1986
%P 311-323

%A Klaus W. Wagner
%T The complexity of combinatorial problems
with succinct input representation
%J Acta Informatica
%K acta_inf
%V 23
%N 3
%D June 1986
%P 325-356

%A A. Bijlsma
%A J.G. Wiltink
%A P.A. Matthews
%T Equivalence of the Gries and Martin proof rules for procedure calls
%J Acta Informatica
%K acta_inf
%V 23
%N 4
%D July 1986
%P 357-360

%A Piotr Wyrostek
%T Precedence technique is not worse than SLR(1)
%J Acta Informatica
%K acta_inf
%V 23
%N 4
%D July 1986
%P 361-392

%A Rodney Farrow
%A Daniel Yellin
%T A comparison of storage optimizations
in automatically-generated attribute evaluators
%J Acta Informatica
%K acta_inf
%V 23
%N 4
%D July 1986
%P 393-427

%A Maciej Koutny
%T The Merlin-Randell problem of train journeys
%J Acta Informatica
%K acta_inf
%V 23
%N 4
%D July 1986
%P 429-463

%A Victor F. Nicola
%T A single server queue with mixed types of interruptions
%J Acta Informatica
%K acta_inf
%V 23
%N 4
%D July 1986
%P 465-486

%A Eric C.R. Hehner
%A Lorene E. Gupta
%A Andrew J. Malton
%T Predicative methodology
%J Acta Informatica
%K acta_inf
%V 23
%N 5
%D September 1986
%P 487-505

%A Susanne Graf
%A Joseph Sifakis
%T A logic for the specification and proof
of regular controllable processes of CCS
%J Acta Informatica
%K acta_inf
%V 23
%N 5
%D September 1986
%P 507-527

%A C.C. Lee
%A D.T. Lee
%A C.K. Wong
%T Generating binary trees of bounded height
%J Acta Informatica
%K acta_inf
%V 23
%N 5
%D September 1986
%P 529-544

%A DemetresD. Kouvatsos
%T Maximum entropy and the G/G/1/N queue
%J Acta Informatica
%K acta_inf
%V 23
%N 5
%D September 1986
%P 545-565

%A Johannes Reichardt
%T Deterministic grammars and grammar morphisms
%J Acta Informatica
%K acta_inf
%V 23
%N 5
%D September 1986
%P 567-583

%A Yael Maon
%T On the equivalence of some transductions
involving letter to letter morphisms on regular languages
%J Acta Informatica
%K acta_inf
%V 23
%N 5
%D September 1986
%P 585-596

%A Karl Culik,\ II
%A Juhani Karhumaki
%T Synchronizable deterministic pushdown autumata
and the decidability of their equivalence
%J Acta Informatica
%K acta_inf
%V 23
%N 5
%D September 1986
%P 597-605

%A Valdis Berzins
%T On merging software extensions
%J Acta Informatica
%K acta_inf
%V 23
%N 6
%D November 1986
%P 607-619

%A Robert Geist
%A Mark Smotherman
%A Kishor Trivedi
%A Joanne Bechta Dugan
%T The reliability of life-critical computer systems
%J Acta Informatica
%K acta_inf
%V 23
%N 6
%D November 1986
%P 621-642

%A Erol Gelenbe
%A David Finkel
%A Satish K. Tripathi
%T Availability of a distributed computer system with failures
%J Acta Informatica
%K acta_inf
%V 23
%N 6
%D November 1986
%P 643-655

%A J. Cantor
%A A. Ephremides
%A D. Horton
%T Information theoretic analysis for a general queueing system at equilibrium
with application to queues in tandem
%J Acta Informatica
%K acta_inf
%V 23
%N 6
%D November 1986
%P 657-678

%A Jose L. Balcazar
%A Ronald V. Book
%T Sets with small generalized Kolmogorov complexity
%J Acta Informatica
%K acta_inf
%V 23
%N 6
%D November 1986
%P 679-688

%A Siegfried Bublitz
%T Decomposition of graphs and monotone formula size of homogeneous functions
%J Acta Informatica
%K acta_inf
%V 23
%N 6
%D November 1986
%P 689-696

%A Costas S. Iliopoulos
%T Monte Carlo circuits for the Abelian permutation group intersection problem
%J Acta Informatica
%K acta_inf
%V 23
%N 6
%D November 1986
%P 697-705