The SCEAS System
Navigation Menu

Journals in DBLP

Inf. Process. Lett.
1981, volume: 12, number: 5

  1. Jon Mauney, Charles N. Fischer
    An Improvement to Immediate Error Detection in Strong LL(1) Parsers. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:12, n:5, pp:211-212 [Journal]
  2. Lloyd K. Konneker, Yaakov L. Varol
    A Note on Heuristics for Dynamic Organization of Data Structures. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:12, n:5, pp:213-216 [Journal]
  3. Marc Snir
    On the Complexity of Simplifying Quadratic Forms. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:12, n:5, pp:217-220 [Journal]
  4. David M. Harland
    On Facilities for Interprocess Communication. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:12, n:5, pp:221-226 [Journal]
  5. Oscar H. Ibarra, Shlomo Moran, Louis E. Rosier
    Probabilistic Algorithms and Straight-Line Programs for Some Rank Decision Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:12, n:5, pp:227-232 [Journal]
  6. Jean-Jacques Pansiot
    A Note on Post's Correspondence Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:12, n:5, pp:233- [Journal]
  7. Wojciech Rytter
    An Effective Simulation of Deterministic Pushdown Automata with Many Two-Way and One-Way Heads. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:12, n:5, pp:234-236 [Journal]
  8. Bing-Chao Huang
    An Algorithm for Inverting a Permutation. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:12, n:5, pp:237-238 [Journal]
  9. Józef Winkowski
    Protocols of Accessing Overlapping Sets of Resources. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:12, n:5, pp:239-243 [Journal]
  10. Maxime Crochemore
    An Optimal Algorithm for Computing the Repetitions in a Word. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:12, n:5, pp:244-250 [Journal]
  11. Moshe Y. Vardi
    The Decision Problem for Database Dependencies. [Citation Graph (10, 0)][DBLP]
    Inf. Process. Lett., 1981, v:12, n:5, pp:251-254 [Journal]
  12. Jürgen Ebert
    A Sensitive Transitive Closure Algorithm. [Citation Graph (8, 0)][DBLP]
    Inf. Process. Lett., 1981, v:12, n:5, pp:255-258 [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