0022-0000

Journal of Computer and System Sciences (JCSS) - Volume 69, Issue 3 论文列表

本期论文列表
C2 - Ed. Board

Special issue: 35th Annual ACM Symposium on Theory of Computing

Random knapsack in expected polynomial time

Integer priority queues with decrease key in constant time and the single source shortest paths problem

Testing subgraphs in directed graphs

Optimal oblivious routing in polynomial time

Exponential lower bound for 2-query locally decodable codes via a quantum argument

Learning functions of k relevant variables

Cell-probe lower bounds for the partial match problem

Classical complexity and quantum entanglement

A tight bound on approximating arbitrary metrics by tree metrics

Papers to Appear

C4 - TOC