Sciweavers

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

30

STOC
2006
ACM

favoriteEmaildiscussreport

166views Algorithms» more STOC 2006»

The Santa Claus problem

14 years 11 months ago

The Santa Claus problem

Download research.microsoft.com

The Santa Claus problem is an interesting exercise in concurrent programming which has been used in a comparison of the concurrency mechanisms of Ada and Java. We present a simple solution to the problem in Polyphonic C , an extension of C with new concurrency constructs based on the Join calculus.

Nikhil Bansal, Maxim Sviridenko

Real-time Traffic

Algorithms | Concurrency Mechanisms | Santa Claus Problem | STOC 2006 |

claim paper

Related Content

» Solving the Santa Claus Problem a Comparison of Various Concurrent Programming Techniques

» Santa Claus Meets Hypergraph Matchings

» Santa Claus Schedules Jobs on Unrelated Machines

» A General Framework for Designing Approximation Schemes for Combinatorial Optimization Pro...

» Solving the artificial ant on the Santa Fe trail problem in 20 696 fitness evaluations

» The Secret Santa Problem

» A Tractable Class of Abduction Problems

» Applying a Traffic Lights Evolutionary Optimization Technique to a Real Case Las Ramblas A...

» CGP visits the Santa Fe trail effects of heuristics on GP

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2006
Where	STOC
Authors	Nikhil Bansal, Maxim Sviridenko

Comments (0)