筛选条件 共查询到42条结果
排序方式
Lattice-based unidirectional infinite-use proxy re-signatures with private re-signature key

期刊: JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2021; 120 ()

In a proxy re-signature scheme, a semi-trusted proxy can convert Alice's (also called as delegatee's) signature into Bob's (also called as delegator's......

Editorial - Special issue on Concurrency Theory (CONCUR 2018)

期刊: JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2021; 119 ()

This special issue contains the revised and extended versions of selected contributions that were presented at the 29th International Conference on Co......

Lattice-based weak-key analysis on single-server outsourcing protocols of modular exponentiations and basic countermeasures

期刊: JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2021; 121 ()

We investigate the problem of securely outsourcing the modular exponentiations in cryptography to an untrusted server, and analyze the security and th......

Understanding PPA-completeness

期刊: JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2021; 115 ()

We show that computation of the SPERNER problem is PPA-complete on the Mobius band under proper boundary conditions, settling a long term open problem......

Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs

期刊: JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2021; 115 ()

Edge fault-tolerance of interconnection network is of significant important to the design and maintenance of multiprocessor systems. A connected graph......

E quivalence checking of quantum finite-state machines

期刊: JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2021; 116 ()

In this paper, we introduce the model of quantum Mealy machines and study the equivalence checking and minimisation problems of them. Two efficient al......

A 4/3-approximation algorithm for the Maximum Internal Spanning Tree Problem

期刊: JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2021; 118 ()

In this paper, we study the Maximum Internal Spanning Tree Problem (MIST). Given an undirected simple graph G, the task for the Maximum Internal Spann......

Pushing the Online Boolean Matrix-vector Multiplication conjecture off-line and identifying its easy cases

期刊: JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2021; 118 ()

Henzinger et al. posed the so-called Online Boolean Matrix-vector Multiplication (OMv) conjecture and showed that it implies tight hardness results fo......

Minimizing the operation cost of distributed green data centers with energy storage under carbon capping

期刊: JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2021; 118 ()

The expensive cost and intermittent availability of renewable energy bring great challenges to its efficient utilization in green data centers. In thi......

A 1.375-approximation algorithm for unsigned translocation sorting

期刊: JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2020; 113 ()

Translocation has been long learned as a basic operation to rearrange the structure of a genome. Translocation sorting asks to find a shortest sequenc......

An elastic and resiliency defense against DDoS attacks on the critical DNS authoritative infrastructure

期刊: JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2019; 99 ()

The critical DNS authoritative infrastructure is increasingly targeted by DDoS attacks in recent years. This paper proposes a novel mitigating solutio......

JIF:1.13

Colouring square-free graphs without long induced paths

期刊: JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2019; 106 ()

The complexity of COLOURING is fully understood for H-free graphs, but there are still major complexity gaps if two induced subgraphs H-1 and H-2 are ......

JIF:1.13

Gaussian-Gamma collaborative filtering: A hierarchical Bayesian model for recommender systems

期刊: JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2019; 102 ()

The traditional collaborative filtering (CF) suffers from two key challenges, namely, the normal assumption that it is not robust, and it is difficult......

JIF:1.13

Optimal separation in exact query complexities for Simon's problem

期刊: JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2018; 97 ()

Simon's problem is one of the most important problems demonstrating the power of quantum computers. In this paper, we propose another exact quantum al......

JIF:1.13

A parameterized algorithm for the Maximum Agreement Forest problem on multiple rooted multifurcating trees

期刊: JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2018; 97 ()

The Maximum Agreement Forest problem has been extensively studied in phylogenetics. Most previous work is on two binary phylogenetic trees. In this pa......

JIF:1.13

共42条页码: 1/3页15条/页