( en | de | ru )

 

Disambiguation of "Mehta, Ruta"

Author of the publication

copydeleteadd this publication to your clipboard
CLS: New Problems and Completeness.

, , , and . CoRR, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Edward Tibayungwa Rutayungwa

Divya Deepak Mehta

Genome-wide association study to search for SNPs affecting gene expression in a general population. TU München, (2009)

Christina Ruta

Ruta Bilkeviciute

Ruta Jasaityte

 

Other publications of authors with the same name

Constant rank bimatrix games are PPAD-hard.. STOC, page 545-554. ACM, (2014)Rank-1 bimatrix games: a homeomorphism and a polynomial time algorithm., , , and . STOC, page 195-204. ACM, (2011)A New Class of Combinatorial Markets with Covering Constraints: Algorithms and Applications., , , , and . SODA, page 2311-2325. SIAM, (2018)Constant Rank Two-Player Games are PPAD-hard.. SIAM J. Comput., 47 (5): 1858-1887 (2018)Nash Equilibria in Fisher Market., , , , and . SAGT, volume 6386 of Lecture Notes in Computer Science, page 30-41. Springer, (2010)On the PTAS for Maximin Shares in an Indivisible Mixed Manna., , and . AAAI, page 5523-5530. AAAI Press, (2021)Nash Equilibrium Computation in Resource Allocation Games., and . AAMAS, page 1953-1955. International Foundation for Autonomous Agents and Multiagent Systems Richland, SC, USA / ACM, (2018)Maximizing Profit with Convex Costs in the Random-order Model., , and . ICALP, volume 107 of LIPIcs, page 71:1-71:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Sum-of-squares meets nash: lower bounds for finding any equilibrium., and . STOC, page 1241-1248. ACM, (2018)Prophet Inequalities for Cost Minimization., and . CoRR, (2022)