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
24
click to vote
SODA
1998
ACM
favorite
Email
discuss
report
71
views
Algorithms
»
more
SODA 1998
»
On the Distributed Complexity of Computing Maximal Matchings
13 years 11 months ago
Download
www.brics.dk
Michal Hanckowiak, Michal Karonski, Alessandro Pan
Real-time Traffic
Algorithms
|
SODA 1998
|
claim paper
Related Content
»
Maximizing throughput in wireless networks via gossiping
»
Low complexity stable scheduling algorithms for networks of input queued switches with no ...
»
Fast Deterministic Distributed Maximal Independent Set Computation on GrowthBounded Graphs
»
Stability of a framebased oldestcellfirst maximal weight matching algorithm
»
Maximally Stable Colour Regions for Recognition and Matching
»
Energy complexity of optical computations
»
Distributed scheduling policies in networks of inputqueued packet switches
»
Distributed Algorithm for Computing Formal Concepts Using MapReduce Framework
»
Fragmentary Pattern Matching Complexity Algorithms and Applications for Analyzing Classic ...
more »
Post Info
More Details (n/a)
Added
01 Nov 2010
Updated
01 Nov 2010
Type
Conference
Year
1998
Where
SODA
Authors
Michal Hanckowiak, Michal Karonski, Alessandro Panconesi
Comments
(0)
Researcher Info
Algorithms Study Group
Computer Vision