The SCEAS System
Navigation Menu

Journals in DBLP

Inf. Process. Lett.
2006, volume: 97, number: 4

  1. Pak Ching Li, Michel Toulouse
    Variations of the maximum leaf spanning tree problem for bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:97, n:4, pp:129-132 [Journal]
  2. Travis Gagie
    Compressing probability distributions. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:97, n:4, pp:133-137 [Journal]
  3. Zhenming Chen, Evanthia Papadopoulou, Jinhui Xu
    Robustness of k-gon Voronoi diagram construction. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:97, n:4, pp:138-145 [Journal]
  4. Zheng Sun, Tian-Ming Bu
    On discretization methods for approximating optimal paths in regions with direction-dependent costs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:97, n:4, pp:146-152 [Journal]
  5. Hossein Ghodosi, Rahim Zaare-Nahandi
    Comments on the 'm out of n oblivious transfer'. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:97, n:4, pp:153-155 [Journal]
  6. Mohammad Taghi Hajiaghayi, Harald Räcke
    An O(sqrt(n))-approximation algorithm for directed sparsest cut. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:97, n:4, pp:156-160 [Journal]
  7. Neal Lesh, Michael Mitzenmacher
    BubbleSearch: A simple heuristic for improving priority-based greedy algorithms. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:97, n:4, pp:161-169 [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