The SCEAS System
Navigation Menu

Journals in DBLP

Acta Inf.
1981, volume: 15, number:

  1. Friedrich L. Bauer, Andrei P. Ershov, Manfred Paul, Alan J. Perlis
    Klaus Samelson. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1981, v:15, n:, pp:1-2 [Journal]
  2. William E. Wright
    Binary Search Trees in Secondary Memory. [Citation Graph (1, 0)][DBLP]
    Acta Inf., 1981, v:15, n:, pp:3-17 [Journal]
  3. Onno J. Boxma, Alan G. Konheim
    Approximate Analysis of Exponential Queueing Systems with Blocking. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1981, v:15, n:, pp:19-66 [Journal]
  4. François Baccelli
    Analysis of a Service Facility with Periodic Checkpointing. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1981, v:15, n:, pp:67-81 [Journal]
  5. Daniel M. Berry
    Remarks on R. D. Tennent's Language Design Methods Based on Semantic Principles: Algol 68, A Language Designed Using Semantic Principles. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1981, v:15, n:, pp:83-98 [Journal]
  6. Paul Walton Purdom Jr., Cynthia A. Brown, Edward L. Robertson
    Backtracking with Multi-Level Dynamic Search Rearrangement. [Citation Graph (1, 0)][DBLP]
    Acta Inf., 1981, v:15, n:, pp:99-113 [Journal]
  7. Paul Walton Purdom Jr., Cynthia A. Brown
    Parsing Extended LR(k) Grammars. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1981, v:15, n:, pp:115-127 [Journal]
  8. Werner Kuich
    The Characterization of Parallel Ultralinear Grammars by Rational Power Series. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1981, v:15, n:, pp:129-139 [Journal]
  9. Lawrence T. Kou, George Markowsky, Leonard Berman
    A Fast Algorithm for Steiner Trees. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1981, v:15, n:, pp:141-145 [Journal]
  10. Ingo Wegener
    An Improved Complexity Hierarchy on the Depth of Boolean Functions. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1981, v:15, n:, pp:147-152 [Journal]
  11. F. Rodriguez
    Indépendance Forte de Certaines Opérations. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1981, v:15, n:, pp:153-166 [Journal]
  12. Stefan Reisch
    Hex ist PSPACE-vollständig. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1981, v:15, n:, pp:167-191 [Journal]
  13. Daniel J. Moore, Bruce Russell
    Axiomatic Data Type Specifications: A First Order Theory of Linear Lists. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1981, v:15, n:, pp:193-207 [Journal]
  14. Toshiro Araki, Nobuki Tokura
    Flow Languages Equal Recursively Enumerable Languages. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1981, v:15, n:, pp:209-217 [Journal]
  15. Krzysztof R. Apt
    Recursive Assertions and Parallel Programs. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1981, v:15, n:, pp:219-232 [Journal]
  16. Ralph-Johan Back
    Proving Total Correctness of Nondeterministic Programs in Infinitary Logic. [Citation Graph (1, 0)][DBLP]
    Acta Inf., 1981, v:15, n:, pp:233-249 [Journal]
  17. Hans Daduna, Rolf Schassberger
    A Discrete-Time Round-Robin Queue with Bernoulli Input and General Arithmetic Service Time Distributions. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1981, v:15, n:, pp:251-263 [Journal]
  18. Rainer Kemp
    LR (0) Grammars Generated by LR (0) Parsers. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1981, v:15, n:, pp:265-280 [Journal]
  19. Gary Levin, David Gries
    A Proof Technique for Communicating Sequential Processes. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1981, v:15, n:, pp:281-302 [Journal]
  20. Stal O. Anderaa, Egon Börger
    The Equivalence of Horn and Network Complexity for Boolean Functions. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1981, v:15, n:, pp:303-307 [Journal]
  21. Ernst W. Mayr
    Persistence of Vector Replacement Systems is Decidable. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1981, v:15, n:, pp:309-318 [Journal]
  22. Kellogg S. Booth, Richard J. Lipton
    Computing Extremal and Approximate Distances in Graphs Having Unit Cost Edges. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1981, v:15, n:, pp:319-328 [Journal]
  23. Witold Lipski Jr., Franco P. Preparata
    Efficient Algorithms for Finding Maximum Matchings in Convex Bipartite Graphs and Related Problems. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1981, v:15, n:, pp:329-346 [Journal]
  24. Donald L. Iglehart, Gerald S. Shedler
    Regenerative Simulation of Response Times in Networks of Queues: Statistical Efficiency. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1981, v:15, n:, pp:347-363 [Journal]
  25. Robert Cartwright, Derek C. Oppen
    The Logic of Aliasing. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1981, v:15, n:, pp:365-384 [Journal]
  26. Arie de Bruin
    Goto Statements: Semantics and Deduction Systems. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1981, v:15, n:, pp:385-424 [Journal]
  27. Harald Würgers
    A Specification Technique Based on Predicate Transformers. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1981, v:15, n:, pp:425-445 [Journal]
  28. Takehiro Tokuda
    Eliminating Unit Reductions from LR(k) Parsers Using Minimum Contexts. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1981, v:15, n:, pp:447-470 [Journal]
  29. Marco A. Casanova, Philip A. Bernstein
    General Purpose Schedulers for Database System. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1981, v:15, n:, pp:471- [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002