Content of Issue 6
DOI: 10.3217/jucs-011-06
|
| Managing Editor's Column |
H. Maurer |
803 |
| How to Draw Free Trees Inside Bounded Simple Polygons |
A. Bagheri, M. Razzazi |
804 |
| A Provably Efficient Computational Model For Approximate Spatiotemporal Retrieval |
V. Delis, C. Makris, S. Sioutas |
830 |
| Time Costs in Actor Computations |
M. Di Santo, F. Frattolillo |
850 |
| Analysis, Design, and Performance Evaluation of MS-RTCP: More Scalable Scheme for the Real-Time Control Protocol |
N. A. Elramly, A. S. Habib, O. S. Essa, H. M. Harb |
874 |
| Automatic Test Data Generation for Data Flow Testing Using a Genetic Algorithm |
M. R. Girgis |
898 |
| On Theoretical Upper Bound for Routing Estimation |
F. He, G. Yang, L. Cheng, X. Song, M. Gu, J. Sun |
916 |
| Fine-Grained Transclusions of Multimedia Documents in HTML |
J. Kolbitsch |
926 |
| On Complexity of Collective Communications on a Fat Cube Topology |
V. Kutálek, V. Dvořák |
944 |
| TESTAF: A Test Automation Framework for Class Testing using Object-Oriented Formal Specifications |
A. Nadeem, M. Jaffar-ur-Rehman |
962 |
| A Provably Secure and Efficient Verifiable Shuffle based on a Variant of the Paillier Cryptosystem |
L. Nguyen, R. Safavi-Naini, K. Kurosawa |
986 |
| Exploiting Agent Ontologies in B2C Virtual Marketplaces |
D. Rosaci |
1011 |
| Domain Extenders for UOWHF: A Finite Binary Tree Algorithm |
P. Sarkar |
1040 |
| Model Checking, Automated Abstraction, and Compositional Verification of Rebeca Models |
M. Sirjani, A. Movaghar, A. Shali, F. S. de Boer |
1054 |
| A Fast T-decomposition Algorithm |
J. Yang, U. Speidel |
1083 |
| Collect the Fitted Surfaces into Complex Based on C0 Continuity |
E. A. Zanaty, M. R. Girgis |
1102 |
