Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

SODA
1994
ACM

favoriteEmaildiscussreport

71views Algorithms» more SODA 1994»

A Sublinear Parallel Algorithm for Stable Matching

13 years 6 months ago

A Sublinear Parallel Algorithm for Stable Matching

Download theory.stanford.edu

Tomás Feder, Nimrod Megiddo, Serge A. Plotk

Real-time Traffic

Algorithms | SODA 1994 |

claim paper

Related Content

» A Parallel Iterative Improvement Stable Matching Algorithm

» A Note on Distributed Stable Matching

» Stable RoundRobin Scheduling Algorithms for HighPerformance Input Queued Switches

» Finite Termination of Augmenting Path Algorithms in the Presence of Irrational Problem Dat...

» Learning TwoView Stereo Matching

» Sequential decision making in parallel twosided economic search

» Approximate Search Engine Optimization for Directory Service

» Adaptive channel queue routing on kary ncubes

Post Info
More Details (n/a)

Added	02 Nov 2010
Updated	02 Nov 2010
Type	Conference
Year	1994
Where	SODA
Authors	Tomás Feder, Nimrod Megiddo, Serge A. Plotkin

Comments (0)