Volume 17, 1982
- Tamás Gergely, László Úry:
A Theory of Interactive Programming.
1-20
- André Arnold:
Synchronized Behaviours of Processes and Rational Relations.
21-29
- C. L. Liu, Jane W.-S. Liu, Arthur L. Liestman:
Scheduling with Slack Time.
31-41
- John E. Shore:
Information Theoretic Approximations for M/G/ 1 und G/G/ 1 Queuing Systems.
43-61
- Satoru Miyano:
A Hierarchy Theorem for Multihead Stack-Counter Automata.
63-67
- Grzegorz Rozenberg, R. Verraedt:
Completeness of E 0 L Forms is Decidable.
69-87
- Thiet-Dung Huynh:
Remarks on the Complexity of an Invariant of Context-Free Grammars.
89-99
- Michel Martinez:
Program Behavior Prediction and Prepaging.
101-120
- Michael O. Rabin:
The Choice Coordination Problem.
121-134
- Joep L. W. Kessels:
Arbitration Without Common Modifiable Variables.
135-141
- Sridhar Vasudevan:
Inner Loops in Flowgraphs and Code Optimization.
143-155
- Scott Huddleston, Kurt Mehlhorn:
A New Data Structure for Representing Sorted Lists.
157-184
- Kari-Jouko Räihä, Mikko Saarinen:
Testing Attribute Grammars for Circularity.
185-192
- Jean-Michel Autebert, Joffroy Beauquier, Luc Boasson:
Formes de langages et de grammaires.
193-213
- Alon Itai, Michael Rodeh:
Representation of Graphs.
215-219
- Hagen Huwig:
Ein Modell des P=NP -Problems mit einer positiven Lösung.
221-243
- Ernst-Erich Doberkat:
Deleting the Root of a Heap.
245-265
- Mark H. Overmars, Jan van Leeuwen:
Dynamic Multi-Dimensional Data Structures Based on Quad- and K - D Trees.
267-285
- François Baccelli, Thierry Fleury:
On Parsing Arithmetic Expressions in a Multiprocessing Environment.
287-310
- A. Staphylopatis:
Performance Considerations in the Parallel Execution of Numerical Algorithms on two Processors.
311-325
- Lawrence Snyder:
Recognition and Selection of Idioms for Code Optimization.
327-348
- Alan J. Demers, C. Keleman, Bernd Reusch:
On Some Decidable Properties of Finite State Translations.
349-364
- Flaviu Cristian:
Robust Data Types.
365-397
- Clement H. C. Leung, Qui Hoon Choo:
The Effect of Fixed-Length Record Implementation on File System Response.
399-409
- Joseph JáJá, Janos Simon:
Space Efficient Algorithms for Some Graph Theoretical Problems.
411-423
- Norbert Blum:
On the Power of Chain Rules in Context Free Grammars.
425-433
- Eljas Soisalon-Soininen, Derick Wood:
On a Covering Relation for Context-Free Grammars.
435-449
- Peter R. J. Asveld, J. V. Tucker:
Complexity Theory and the Operational Structure of Algebraic Programming Systems.
451-476
- Paul Pritchard:
Explaining the Wheel Sieve.
477-485
Copyright © Fri Dec 4 19:31:26 2009
by Michael Ley (ley@uni-trier.de)
