Journals in DBLP

Acta Inf.
1983, volume: 19, number:

1. H. T. Kung, Christos H. Papadimitriou
   An Optimality Theory of Concurrency Control for Databases. [Citation Graph (9, 0)][DBLP]
   Acta Inf., 1983, v:19, n:, pp:1-11 [Journal]
   
2. Takao Tsuda, Takashi Sato
   Transposition of Large Tabular Data Structures with Applications to Physical Database Organization. [Citation Graph (1, 0)][DBLP]
   Acta Inf., 1983, v:19, n:, pp:13-33 [Journal]
   
3. Klaus Küspert
   Storage Utilization in B*-Trees with a Generalized Overflow Technique. [Citation Graph (2, 0)][DBLP]
   Acta Inf., 1983, v:19, n:, pp:35-55 [Journal]
   
4. Richard N. Taylor
   Complexity of Analyzing the Synchronization Structure of Concurrent Programs. [Citation Graph (0, 0)][DBLP]
   Acta Inf., 1983, v:19, n:, pp:57-84 [Journal]
   
5. Kazuo Iwama
   The Universe Problem for Unrestricted Flow Languages. [Citation Graph (0, 0)][DBLP]
   Acta Inf., 1983, v:19, n:, pp:85-96 [Journal]
   
6. Jan A. Bergstra, J. Terlouw
   Standard Model Semantics for DSL A Data Type Specification Language. [Citation Graph (0, 0)][DBLP]
   Acta Inf., 1983, v:19, n:, pp:97-113 [Journal]
   
7. Gilberto Filé
   Interpretation and Reduction of Attribute Grammars. [Citation Graph (0, 0)][DBLP]
   Acta Inf., 1983, v:19, n:, pp:115-150 [Journal]
   
8. Günther E. Pfaff
   The Construction of Operator Interfaces Based on Logical Input Devices. [Citation Graph (0, 0)][DBLP]
   Acta Inf., 1983, v:19, n:, pp:151-166 [Journal]
   
9. Takao Tsuda, Akira Urano, Takashi Sato
   Transposition of Large Tabular Data Structures with Applications to Physical Database Organization. [Citation Graph (1, 0)][DBLP]
   Acta Inf., 1983, v:19, n:, pp:167-182 [Journal]
   
10. Ute Schürfeld
    New Lower Bounds on the Formula Size of Boolean Functions. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1983, v:19, n:, pp:183-194 [Journal]
    
11. Jean-Pierre Queille, Joseph Sifakis
    Fairness and Related Properties in Transition Systems - A Temporal Logic to Deal with Fairness. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1983, v:19, n:, pp:195-220 [Journal]
    
12. John P. Kearns, Mary Lou Soffa
    The Implementation of Retention in a Coroutine Environment. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1983, v:19, n:, pp:221-233 [Journal]
    
13. Gregor Engels, Udo Pletat, Hans-Dieter Ehrich
    An Operational Semantics for Specifications of Abstract Data Types with Error Handling. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1983, v:19, n:, pp:235-253 [Journal]
    
14. Hanne Riis Nielson
    Computation Sequences: A Way to Characterize Classes of Attribute Grammars. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1983, v:19, n:, pp:255-268 [Journal]
    
15. Friedhelm Meyer auf der Heide
    Efficiency of Universal Parallel Computers. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1983, v:19, n:, pp:269-296 [Journal]
    
16. Alfred Schmitt
    On the Number of Relational Operators Necessary to Compute Certain Functions of Real Variables. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1983, v:19, n:, pp:297-304 [Journal]
    
17. Moshe Y. Vardi
    Inferring Multivalued Dependencies From Functional and Join Dependencies. [Citation Graph (4, 0)][DBLP]
    Acta Inf., 1983, v:19, n:, pp:305-324 [Journal]
    
18. Ichiro Suzuki, Tadao Kasami
    Three Measures for Synchronic Dependence in Petri Nets. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1983, v:19, n:, pp:325-338 [Journal]
    
19. M. A. El-Affendi, Demetres D. Kouvatsos
    A Maximum Entropy Analysis of the M/G/ 1 and G/M/ 1 Queueing Systems at Equilibrium. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1983, v:19, n:, pp:339-355 [Journal]
    
20. Keijo Ruohonen
    On Some Variants of Post's Correspondence Problem. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1983, v:19, n:, pp:357-367 [Journal]
    
21. Rakesh Agrawal, Keith D. Detro
    An Efficient Incremental LR Parser for Grammars With Epsilon Productions. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1983, v:19, n:, pp:369-376 [Journal]
    
22. Juraj Hromkovic
    On-Way Multihead Deterministic Finite Automata. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1983, v:19, n:, pp:377-384 [Journal]
    
23. Peter Klein, Friedhelm Meyer auf der Heide
    A Lower Time Bound for the Knapsack Problem on Random Access Machines. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1983, v:19, n:, pp:385-395 [Journal]
    
24. R. Sommerhalder, S. C. van Westrhenen
    Parallel Language Recognition in Constant Time by Cellular Automata. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1983, v:19, n:, pp:397-407 [Journal]