The SCEAS System
Navigation Menu

Journals in DBLP

Inf. Process. Lett.
1990, volume: 34, number: 5

  1. Paul E. S. Dunne
    Comment on Kochol's Paper ``Efficient Monotone Circuits for Threshold Functions''. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:34, n:5, pp:221-222 [Journal]
  2. Stefan Rönn, Heikki Saikkonen
    Distributed Termination Detection with Counters. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:34, n:5, pp:223-227 [Journal]
  3. Zsolt Tuza
    Periodic String Division Generated by Deterministic L Systems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:34, n:5, pp:229-234 [Journal]
  4. Sung Kwon Kim
    A Parallel Algorithm for Finding a Maximum Clique of a Set of Circular Arcs of a Circle. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:34, n:5, pp:235-241 [Journal]
  5. Owen Murphy
    A Unifying Framework for Trie Design Heuristics. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:34, n:5, pp:243-249 [Journal]
  6. William Pugh
    Slow Optimally Balanced Search Strategies VS. Cached Fast Uniformly Balanced Search Strategies. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:34, n:5, pp:251-254 [Journal]
  7. Andreas S. Pombortsis
    Sharing Special Purpose Resources in a Multiprocessor Environment. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:34, n:5, pp:255-260 [Journal]
  8. R. T. Kuo, S. S. Tseng
    The Necessary and Sufficient Condition for the Worst-Case Male Optimal Stable Matching. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:34, n:5, pp:261-263 [Journal]
  9. J. M. Robson
    Random Access Machines with Multi-Dimensional Memories. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:34, n:5, pp:265-266 [Journal]
  10. Mark Allen Weiss, Robert Sedgewick
    More on Shellsort Increment Sequences. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:34, n:5, pp:267-270 [Journal]
  11. Gaston H. Gonnet, Ricardo A. Baeza-Yates
    An Analysis of the Karp-Rabin String Matching Algorithm. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:34, n:5, pp:271-274 [Journal]
  12. Ingo Althöfer
    Tight Lower Bounds on the Length of Word Chains. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:34, n:5, pp:275-276 [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