Sublinear-time parallel algorithms for matching and related problems

Authors:
A. V. Goldberg;S. A. Plotkin;P. M. Vaidya
Affiliations:
Dept. of Comput. Sci., Stanford Univ., CA, USA;-;-
Venue:
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Year:
1988

Citing 0
Cited 2

An adjustable linear time parallel algorithm for maximum weight bipartite matching

Information Processing Letters
Parallel algorithms for the assignment and minimum-cost flow problems

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

A simple construction for a pseudorandom bit generator is presented. It stretches a short string of truly random bits into a long string that looks random to any algorithm from a complexity class C (e.g. P, NC, PSPACE, etc.), using an arbitrary function ...