The SCEAS System
Navigation Menu

Journals in DBLP

Inf. Process. Lett.
1993, volume: 47, number: 1

  1. Sivan Toledo
    Approximate Parametric Searching. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:47, n:1, pp:1-4 [Journal]
  2. Boris Teia
    A Lower Bound for Randomized List Update Algorithms. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:47, n:1, pp:5-9 [Journal]
  3. Pierluigi Crescenzi, Riccardo Silvestri
    A Note on the Descriptive Complexity of Maximization. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:47, n:1, pp:11-15 [Journal]
  4. Olumide Owolabi
    Efficient Pattern Searching Over Large Dictionaries. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:47, n:1, pp:17-21 [Journal]
  5. John Hershberger
    A Faster Algorithm for the Two-Center Decision Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:47, n:1, pp:23-29 [Journal]
  6. Michael Meskes, Jörg Noack
    The Generalized Supplementary Magic-Sets Transformation for Stratified Datalog. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:47, n:1, pp:31-41 [Journal]
  7. Wen-Huei Chen, Chuan Yi Tang
    A 2.|E|-Bit Distributed Algorithm for the Directed Euler Trail Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:47, n:1, pp:43-49 [Journal]
  8. Dany Breslauer, Livio Colussi, Laura Toniolo
    Tight Comparison Bounds for the String Prefix-Matching Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:47, n:1, pp:51-57 [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