0022-0000

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

本期论文列表
EDITOR'S FOREWORD

Fully Parallelized Multi-prover Protocols for NEXP-Time

Better Lower Bounds for Monotone Threshold Formulas

Connected Components inO(log3/2 n) Parallel Time for the CREW PRAM

All Pairs Shortest Paths for Graphs with Small Integer Length Edges

On the Exponent of the All Pairs Shortest Path Problem

EDITOR'S FOREWORD

Breaking theΘ(n log2 n) Barrier for Sorting with Faults

A Spectrum of Time–Space Trade-offs for Undirecteds-tConnectivity

The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear Equations

Efficient Out-of-Core Algorithms for Linear Relaxation Using Blocking Covers

When Can We Sort ino(n log n) Time?

Learning an Intersection of a Constant Number of Halfspaces over a Uniform Distribution