Separability and one-way functions
Computational Complexity
Discrete Fixed Points: Models, Complexities, and Applications
Mathematics of Operations Research
On the complexity of the sperner lemma
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Lattice embedding of direction-preserving correspondence over integrally convex set
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
A simplicial approach for discrete fixed point theorems
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
On the power of unambiguity in alternating machines
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
On the black-box complexity of sperner's lemma
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Algorithmic Solutions for Envy-Free Cake Cutting
Operations Research
Algorithmic Solutions for Envy-Free Cake Cutting
Operations Research
| Hi-index | 0.00 |