The SCEAS System
Navigation Menu

Journals in DBLP

Comput. J.
2006, volume: 49, number: 3

  1. Fairouz Kamareddine
    Capsule Reviews. [Citation Graph (0, 0)][DBLP]
    Comput. J., 2006, v:49, n:3, pp:255-257 [Journal]
  2. Mehmet Savsar, Fawaz S. Al-Anzi
    Reliability of Data Allocation on a Centralized Service Configuration with Distributed Servers. [Citation Graph (0, 0)][DBLP]
    Comput. J., 2006, v:49, n:3, pp:258-267 [Journal]
  3. Alain Cournier, Stéphane Devismes, Franck Petit, Vincent Villain
    Snap-Stabilizing Depth-First Search on Arbitrary Networks. [Citation Graph (0, 0)][DBLP]
    Comput. J., 2006, v:49, n:3, pp:268-280 [Journal]
  4. Apostolos N. Papadopoulos, Alexandros Nanopoulos, Yannis Manolopoulos
    Processing Distance Join Queries with Constraints. [Citation Graph (0, 0)][DBLP]
    Comput. J., 2006, v:49, n:3, pp:281-296 [Journal]
  5. Moses Reuven, Yair Wiseman
    Medium-Term Scheduler as a Solution for the Thrashing Effect. [Citation Graph (0, 0)][DBLP]
    Comput. J., 2006, v:49, n:3, pp:297-309 [Journal]
  6. Goichiro Hanaoka, Junji Shikata, Yumiko Hanaoka, Hideki Imai
    Unconditionally Secure Anonymous Encryption and Group Authentication. [Citation Graph (0, 0)][DBLP]
    Comput. J., 2006, v:49, n:3, pp:310-321 [Journal]
  7. Javier Herranz
    Deterministic Identity-Based Signatures for Partial Aggregation. [Citation Graph (0, 0)][DBLP]
    Comput. J., 2006, v:49, n:3, pp:322-330 [Journal]
  8. Karnig Derderian, Robert M. Hierons, Mark Harman, Qiang Guo
    Automated Unique Input Output Sequence Generation for Conformance Testing of FSMs. [Citation Graph (0, 0)][DBLP]
    Comput. J., 2006, v:49, n:3, pp:331-344 [Journal]
  9. Per Martin-Löf
    100 years of Zermelo's axiom of choice: what was the problem with it? [Citation Graph (0, 0)][DBLP]
    Comput. J., 2006, v:49, n:3, pp:345-350 [Journal]
  10. James F. Korsh
    Skarbek's Algorithm for t-Ary Trees. [Citation Graph (0, 0)][DBLP]
    Comput. J., 2006, v:49, n:3, pp:351-357 [Journal]
  11. Sung Eun Bae, Tadao Takaoka
    Improved Algorithms for the K-Maximum Subarray Problem. [Citation Graph (0, 0)][DBLP]
    Comput. J., 2006, v:49, n:3, pp:358-374 [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