Journals in DBLP

J. UCS
2005, volume: 11, number: 6

1. Hermann A. Maurer
   Managing Editor's Column. [Citation Graph (0, 0)][DBLP]
   J. UCS, 2005, v:11, n:6, pp:803-803 [Journal]
   
2. Alireza Bagheri, Mohammadreza Razzazi
   How to Draw Free Trees Inside Bounded Simple Polygons. [Citation Graph (0, 0)][DBLP]
   J. UCS, 2005, v:11, n:6, pp:804-829 [Journal]
   
3. Vasilis Delis, Christos Makris, Spyros Sioutas
   A Provably Efficient Computational Model For Approximate Spatiotemporal Retrieval. [Citation Graph (0, 0)][DBLP]
   J. UCS, 2005, v:11, n:6, pp:830-849 [Journal]
   
4. Michele Di Santo, Franco Frattolillo
   Time Costs in Actor Computations. [Citation Graph (0, 0)][DBLP]
   J. UCS, 2005, v:11, n:6, pp:850-873 [Journal]
   
5. Nabaway El-Ramly, A. S. Habib, Omar S. Essa, Hani M. Harb
   Analysis, Design, and Performance Evaluation of MS-RTCP: More Scalable Scheme for the Real-Time Control Protocol. [Citation Graph (0, 0)][DBLP]
   J. UCS, 2005, v:11, n:6, pp:874-897 [Journal]
   
6. Moheb R. Girgis
   Automatic Test Data Generation for Data Flow Testing Using a Genetic Algorithm. [Citation Graph (0, 0)][DBLP]
   J. UCS, 2005, v:11, n:6, pp:898-915 [Journal]
   
7. Fei He, Lerong Cheng, Guowu Yang, Xiaoyu Song, Ming Gu, Jia-Guang Sun
   On Theoretical Upper Bounds for Routing Estimation. [Citation Graph (0, 0)][DBLP]
   J. UCS, 2005, v:11, n:6, pp:916-925 [Journal]
   
8. Josef Kolbitsch
   Fine-Grained Transclusions of Multimedia Documents in HTML. [Citation Graph (0, 0)][DBLP]
   J. UCS, 2005, v:11, n:6, pp:926-943 [Journal]
   
9. Vladimír Kutálek, Václav Dvorák
   On Complexity of Collective Communications on a Fat Cube Topology. [Citation Graph (0, 0)][DBLP]
   J. UCS, 2005, v:11, n:6, pp:944-961 [Journal]
   
10. Aamer Nadeem, Muhammad Jaffar-Ur Rehman
    TESTAF: A Test Automation Framework for Class Testing using Object-Oriented Formal Specifications. [Citation Graph (0, 0)][DBLP]
    J. UCS, 2005, v:11, n:6, pp:962-985 [Journal]
    
11. Lan Nguyen, Reihaneh Safavi-Naini, Kaoru Kurosawa
    A Provably Secure and Effcient Verifiable Shuffle based on a Variant of the Paillier Cryptosystem. [Citation Graph (0, 0)][DBLP]
    J. UCS, 2005, v:11, n:6, pp:986-1010 [Journal]
    
12. Domenico Rosaci
    Exploiting Agent Ontologies in B2C Virtual Marketplaces. [Citation Graph (0, 0)][DBLP]
    J. UCS, 2005, v:11, n:6, pp:1011-1039 [Journal]
    
13. Palash Sarkar
    Domain Extenders for UOWHF: A Finite Binary Tree Algorithm. [Citation Graph (0, 0)][DBLP]
    J. UCS, 2005, v:11, n:6, pp:1040-1053 [Journal]
    
14. Marjan Sirjani, Ali Movaghar, Amin Shali, Frank S. de Boer
    Model Checking, Automated Abstraction, and Compositional Verification of Rebeca Models. [Citation Graph (0, 0)][DBLP]
    J. UCS, 2005, v:11, n:6, pp:1054-1082 [Journal]
    
15. Jia Yang, Ulrich Speidel
    A Fast T-decomposition Algorithm. [Citation Graph (0, 0)][DBLP]
    J. UCS, 2005, v:11, n:6, pp:1083-1101 [Journal]
    
16. E. A. Zanaty, Moheb R. Girgis
    Collect the Fitted Surfaces Into Complex Based On C₀ Continuity. [Citation Graph (0, 0)][DBLP]
    J. UCS, 2005, v:11, n:6, pp:1102-1114 [Journal]
    
17. Belhassen Zouari
    A Structure Causality Relation for Liveness Characterisation in Petri Nets. [Citation Graph (0, 0)][DBLP]
    J. UCS, 2005, v:11, n:6, pp:1115-1133 [Journal]