Skip to search formSkip to main contentSkip to account menu

Journal of Computer and System Sciences

Known as: JCSS 
The Journal of Computer and System Sciences (JCSS) is a peer-reviewed scientific journal in the field of computer science. JCSS is published by… 
Wikipedia (opens in a new tab)

Related topics

Related topics

36 relations
ACC0Aanderaa–Karp–Rosenberg conjectureApex graphBeap

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Conditional Disclosure of Secrets and d-Uniform Secret Sharing with Constant Information Rate
Consider the following secret-sharing problem. Your goal is to distribute a long file s between n servers such that (d − 1… 
2016
2016
CILAMCE 2016 Proceedings of the XXXVII Iberian Latin-American Congress on Computational Methods in Engineering
Resumo: O Perfilômetro inercial é um equipamento de medição utilizado para a obtenção de perfis de pista. É formado a partir da… 
2010
2010
On the Power of Randomized Reductions and the Checkability of SAT
We prove new results regarding the complexity of various complexity classes under randomized oracle reductions. We first prove… 
2006
2006
Finding the Plateau in an Aggregated Time Series
Given d input time series, an aggregated series can be formed by aggregating the d values at each time position. It is often… 
2003
2003
The Round-Complexity of Black-Box Concurrent Zero-Knowledge
Zero-knowledge proof systems are interactive protocols that enable one party, called the prover, to convince another party… 
2002
2002
Reliability Analysis of a Steel Frame
A steel frame with haunches is designed according to Eurocodes. The frame is exposed to self-weight, snow, and wind actions… 
2002
2002
Wiccap Data Model: Mapping Physical Websites to Logical Views
Information sources over the WWW contain a large amount of data organized according to different interests and values. Thus, it… 
1996
1996
Learning to be Competent
The thesis presents a new approach for the study of competent cognitive behavior. The approach, learning to be competent… 
1995
1995
The Complexity of the Morphism Equivalence Problem for Context-Free Languages
1981
1981
Program logic without binding is decidable
When the "binding mechanisms" of assignment, quantification, and procedure definition are removed from a conventional first order… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)