Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Related topics

Related topics

36 relations
ACC0Aanderaa–Karp–Rosenberg conjectureApex graphBeap
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
Journal of Computer and System Sciences Special Issue on Query Answering on Graph-Structured Data
 
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Derandomizing the Ahlswede-Winter matrix-valued Chernoff bound using pessimistic estimators, and applications
Ahlswede and Winter (IEEE Trans. Inf. Th. 2002) introduced a Chernoff bound for matrix-valued random variables, which is a non… Expand
Is this relevant?
Highly Cited
2006
Highly Cited
2006
On the severity of Braess's Paradox: Designing networks for selfish users is hard
We consider a directed network in which every edge possesses a latency function that specifies the time needed to traverse the… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
DATALOG with Constraints: A Foundation for Trust Management Languages
Trust management (TM) is a promising approach for authorization and access control in distributed systems, based on signed… Expand
Is this relevant?
Highly Cited
2001
Highly Cited
2001
TAX: A Tree Algebra for XML
Querying XML has been the subject of much recent investigation. A formal bulk algebra is essential for applying database-style… Expand
Is this relevant?
Highly Cited
1999
Highly Cited
1999
The Joint Committee on Structural Safety (JCSS) Probabilistic Model Code for New and Existing Structures
 
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Unsupervised Models for Named Entity Classification
This paper discusses the use of unlabeled examples for the problem of named entity classification. A large number of rules is… Expand
  • table 1
  • table 2
  • figure 3
Is this relevant?
Highly Cited
1991
Highly Cited
1991
Statistical Zero-Knowledge Languages can be Recognized in Two Rounds
Abstract Recently, a hierarchy of probabilistic complexity classes generalizing NP has emerged in the work of Babai [2… Expand
Is this relevant?
Highly Cited
1988
Highly Cited
1988
How easy is local search? Journal of Computer and System Sciences
 
Is this relevant?
Highly Cited
1987
Highly Cited
1987
A practical scheme for non-interactive verifiable secret sharing
  • P. Feldman
  • 28th Annual Symposium on Foundations of Computer…
  • 1987
    • Corpus ID: 16283693
This paper presents an extremely efficient, non-interactive protocol for verifiable secret sharing. Verifiable secret sharing… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE