Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
28
click to vote
SODA
1994
ACM
favorite
Email
discuss
report
71
views
Algorithms
»
more
SODA 1994
»
A Sublinear Parallel Algorithm for Stable Matching
13 years 10 months ago
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
more »
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)
Researcher Info
Algorithms Study Group
Computer Vision