The SCEAS System
Navigation Menu

Journals in DBLP

Inf. Process. Lett.
1993, volume: 48, number: 2

  1. Howard J. Karloff
    Fast Algorithms for Approximately Counting Mismatches. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:48, n:2, pp:53-60 [Journal]
  2. Daniele Pretolani
    A Linear Time Algorithm for Unique Horn Satisfiability. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:48, n:2, pp:61-66 [Journal]
  3. Wuu Yang
    An Incremental LL(1) Parsing Algorithm. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:48, n:2, pp:67-72 [Journal]
  4. M. D. Atkinson, Louise Walker
    Enumerating k-Way Trees. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:48, n:2, pp:73-75 [Journal]
  5. Mike A. Steel, Tandy Warnow
    Kaikoura Tree Theorems: Computing the Maximum Agreement Subtree. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:48, n:2, pp:77-82 [Journal]
  6. Stefan Gärtner
    A Remark on the Regulation of k1ET0L Systems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:48, n:2, pp:83-85 [Journal]
  7. Donald D. Chinn, Rakesh K. Sinha
    Bounds on Sample Space Size for Matrix Product Verification. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:48, n:2, pp:87-91 [Journal]
  8. Sanjay Gupta
    On Bounded-Probability Operators and C=P. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:48, n:2, pp:93-98 [Journal]
  9. Stefan Voß
    Worst-Case Performance of Some Heuristics for Steiner's Problem in Directed Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:48, n:2, pp:99-105 [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