Milind A. Sohoni

K. V. Subrahmanyam

CoRR, 2023

2022

Geometric Complexity Theory - Lie Algebraic Methods for Projective Limits of Stable Points.

[BibT_eX]

[DOI]

K. V. Subrahmanyam

CoRR, 2022

Computing for climate resilience in agriculture.

[BibT_eX]

[DOI]

Commun. ACM, 2022

2021

Fast Algorithms for Rank-1 Bimatrix Games.

[BibT_eX]

[DOI]

Oper. Res., 2021

2016

Incorporating Sharp Features in the General Solid Sweep Framework.

[BibT_eX]

[DOI]

Comput. Graph. Forum, 2016

2015

A Complementary Pivot Algorithm for Market Equilibrium under Separable, Piecewise-Linear Concave Utilities.

[BibT_eX]

[DOI]

SIAM J. Comput., 2015

2014

A Computational Framework for Boundary Representation of Solid Sweeps.

[BibT_eX]

[DOI]

CoRR, 2014

Local and global analysis of parametric solid sweeps.

[BibT_eX]

[DOI]

Comput. Aided Geom. Des., 2014

2013

Exchange Markets: Strategy Meets Supply-Awareness - (Abstract).

[BibT_eX]

[DOI]

Ruta Mehta

Proceedings of the Web and Internet Economics - 9th International Conference, 2013

Towards Polynomial Simplex-Like Algorithms for Market Equlibria.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

2012

A procedural framework and mathematical analysis for solid sweeps

[BibT_eX]

[DOI]

CoRR, 2012

A complementary pivot algorithm for markets under separable, piecewise-linear concave utilities.

[BibT_eX]

[DOI]

Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

2011

Rank-1 bimatrix games: a homeomorphism and a polynomial time algorithm.

[BibT_eX]

[DOI]

Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

2010

Rank-1 Bi-matrix Games: A Homeomorphism and a Polynomial Time Algorithm

[BibT_eX]

[DOI]

CoRR, 2010

Nash Equilibria in Fisher Market.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - Third International Symposium, 2010

A Simplex-Like Algorithm for Fisher Markets.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - Third International Symposium, 2010

2009

Quantum deformations of the restriction of GLmn(C)-modules to GLm(C) × GLn(C)

[BibT_eX]

[DOI]

K. V. Subrahmanyam

CoRR, 2009

2008

Geometric Complexity Theory II: Towards Explicit Obstructions for Embeddings among Class Varieties.

[BibT_eX]

[DOI]

SIAM J. Comput., 2008

2007

Geometric Complexity Theory IV: quantum group for the Kronecker problem

[BibT_eX]

[DOI]

CoRR, 2007

Geometric Complexity Theory: Introduction

[BibT_eX]

[DOI]

CoRR, 2007

2005

A theory of regular MSC languages.

[BibT_eX]

[DOI]

Inf. Comput., 2005

Geometric Complexity III: on deciding positivity of Littlewood-Richardson coefficients

[BibT_eX]

[DOI]

CoRR, 2005

A geometric invariant-based framework for the analysis of protein conformational space.

[BibT_eX]

[DOI]

Bioinform., 2005

2004

Asynchronous Automata-Theoretic Characterization of Aperiodic Trace Languages.

[BibT_eX]

[DOI]

Proceedings of the FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 2004

2003

Fast image transforms using diophantine methods.

[BibT_eX]

[DOI]

Sharat Chandran

Ananth K. Potty

IEEE Trans. Image Process., 2003

Bounded time-stamping in message-passing systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

2002

Removal of blends from boundary representation models.

[BibT_eX]

[DOI]

Rahul Rajadhyaksha

Proceedings of the Seventh ACM Symposium on Solid Modeling and Applications, 2002

Reconstruction of feature volumes and feature suppression.

[BibT_eX]

[DOI]

Proceedings of the Seventh ACM Symposium on Solid Modeling and Applications, 2002

Complete and Tractable Local Linear Time Temporal Logics over Traces.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

Local Normal Forms for Logics over Traces.

[BibT_eX]

[DOI]

Proceedings of the FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science, 2002

2001

Geometric Complexity Theory I: An Approach to the P vs. NP and Related Problems.

[BibT_eX]

[DOI]

SIAM J. Comput., 2001

A graph-based framework for feature recognition.

[BibT_eX]

[DOI]

Vinay Kulkarni

Proceedings of the Sixth ACM Symposium on Solid Modeling and Applications, 2001

Blend recognition algorithm and applications.

[BibT_eX]

[DOI]

Gershon Elber

Proceedings of the Sixth ACM Symposium on Solid Modeling and Applications, 2001

2000

Keeping Track of the Latest Gossip in Shared Memory Systems.

[BibT_eX]

[DOI]

Aranyak Mehta

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 2000

Synthesizing Distributed Finite-State Systems from MSCs.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2000, 2000

1999

Rapid Mixing of Some Linear Matroids and Other Combinatorial Objects.

[BibT_eX]

[DOI]

Graphs Comb., 1999

1998

Robust Asynchronous Protocols Are Finite-State.

[BibT_eX]

[DOI]

Jaikumar Radhakrishnan

Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

Towards a Characterisation of Finite-State Message-Passing Systems.

[BibT_eX]

[DOI]

Jaikumar Radhakrishnan

Proceedings of the Advances in Computing Science, 1998

1997

Keeping Track of the Latest Gossip in a Distributed System.

[BibT_eX]

[DOI]

Distributed Comput., 1997

1995

Keeping Track of the Latest Gossip in Message-Passing Systems.

[BibT_eX]

[DOI]

Proceedings of the International Workshop on Structures in Concurrency Theory, 1995

Determinizing Büchi Asnchronous Automata.

[BibT_eX]

[DOI]

Nils Klarlund

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1995

1994

Determinizing Asynchronous Automata.

[BibT_eX]

[DOI]

Nils Klarlund

Proceedings of the Automata, Languages and Programming, 21st International Colloquium, 1994

1993

Keeping Track of the Latest Gossip: Bounded Time-Stamps Suffice.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1993

1990

An Algorithm for Load Balancing in Multiprocessor Systems.

[BibT_eX]

[DOI]

Michael C. Loui