Publication | Closed Access
Disks, Balls, and Walls: Analysis of a Combinatorial Game
18
Citations
0
References
1989
Year
Computational Complexity TheoryEngineeringCombinatorial GameGame TheoryComputational ComplexityComputational Game TheoryP Versus Np ProblemDiscrete MathematicsCombinatorial OptimizationGame DesignMechanism DesignComputer ScienceGamesCombinatorial MethodTheory Of ComputingComputational ScienceImage Size AdditionalBusinessAlgorithmic Game TheoryRamsey Theory
Click to increase image sizeClick to decrease image size Additional informationNotes on contributorsRichard AndersonRichard Anderson received his Ph.D. from Stanford University in 1986. He is now an Assistant Professor of Computer Science at the University of Washington.László LovászLászló Lovász received his Dr. Rher. Nat. degree from the Eötvös Loránd University in Budapest in 1971. Currently he is Professor of Computer Science at the Eötvös Loránd University and at Princeton University.Peter ShorPeter Shor received his Ph.D. from MIT in 1985. He is currently working at AT & T Bell Labs in Murray Hill. He has most recently been doing research in computational geometry.Joel SpencerJoel Spencer is Professor of Mathematics and Computer Science at the Courant Institute. His research interests are in combinatorial analysis, particularly Ramsey theory and the probabilistic method.Eva TardosEva Tardos received her degree from Eötvös University in Budapest. She is currently an Assistant Professor of Applied Mathematics at Massachusetts Institute of Technology.Shmuel WinogradShmuel Winograd received his Ph.D in mathematics from NYU in 1968. He is currently the Director of the Mathematical Sciences Department at IBM, T. J. Watson Research Center.