default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMilind A. Sohoni
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
[j14]Hemant Belsare, Milind A. Sohoni, Rahul Gokhale, Pooja Prasad, Asim R. P., Chirag Marathe, Parth Gupta, Shubhada Sali, Swapnil Patil, Sudhanshu Deshmukh:
Computing for climate resilience in agriculture. Commun. ACM 65(11): 74-79 (2022)- 2021
- [j13]Bharat Adsul, Jugal Garg, Ruta Mehta, Milind A. Sohoni, Bernhard von Stengel
:
Fast Algorithms for Rank-1 Bimatrix Games. Oper. Res. 69(2): 613-631 (2021) - 2016
- [j12]Bharat Adsul, Jinesh Machchhar, Milind A. Sohoni:
Incorporating Sharp Features in the General Solid Sweep Framework. Comput. Graph. Forum 35(5): 21-31 (2016) - 2015
- [j11]Jugal Garg, Ruta Mehta, Milind A. Sohoni, Vijay V. Vazirani:
A Complementary Pivot Algorithm for Market Equilibrium under Separable, Piecewise-Linear Concave Utilities. SIAM J. Comput. 44(6): 1820-1847 (2015) - 2014
- [j10]Bharat Adsul, Jinesh Machchhar, Milind A. Sohoni:
Local and global analysis of parametric solid sweeps. Comput. Aided Geom. Des. 31(6): 294-316 (2014) - 2008
- [j9]Ketan Mulmuley, Milind A. Sohoni:
Geometric Complexity Theory II: Towards Explicit Obstructions for Embeddings among Class Varieties. SIAM J. Comput. 38(3): 1175-1206 (2008) - 2005
- [j8]Ashish V. Tendulkar, Milind A. Sohoni, Babatunde Ogunnaike, Pramod P. Wangikar:
A geometric invariant-based framework for the analysis of protein conformational space. Bioinform. 21(18): 3622-3628 (2005) - [j7]Jesper G. Henriksen, Madhavan Mukund, K. Narayan Kumar, Milind A. Sohoni, P. S. Thiagarajan:
A theory of regular MSC languages. Inf. Comput. 202(1): 1-38 (2005) - 2003
- [j6]Madhavan Mukund, K. Narayan Kumar, Milind A. Sohoni:
Bounded time-stamping in message-passing systems. Theor. Comput. Sci. 290(1): 221-239 (2003) - [j5]Sharat Chandran, Ananth K. Potty, Milind A. Sohoni:
Fast image transforms using diophantine methods. IEEE Trans. Image Process. 12(6): 678-684 (2003) - 2001
- [j4]Ketan Mulmuley, Milind A. Sohoni:
Geometric Complexity Theory I: An Approach to the P vs. NP and Related Problems. SIAM J. Comput. 31(2): 496-526 (2001) - 1999
- [j3]Milind A. Sohoni:
Rapid Mixing of Some Linear Matroids and Other Combinatorial Objects. Graphs Comb. 15(1): 93-107 (1999) - 1997
- [j2]Madhavan Mukund, Milind A. Sohoni:
Keeping Track of the Latest Gossip in a Distributed System. Distributed Comput. 10(3): 137-148 (1997) - 1990
- [j1]Michael C. Loui, Milind A. Sohoni:
An Algorithm for Load Balancing in Multiprocessor Systems. Inf. Process. Lett. 35(5): 223-228 (1990)
Conference and Workshop Papers
- 2013
- [c22]Jugal Garg, Ruta Mehta, Milind A. Sohoni, Nisheeth K. Vishnoi:
Towards Polynomial Simplex-Like Algorithms for Market Equlibria. SODA 2013: 1226-1242 - [c21]Ruta Mehta, Milind A. Sohoni:
Exchange Markets: Strategy Meets Supply-Awareness - (Abstract). WINE 2013: 361-362 - 2012
- [c20]Jugal Garg, Ruta Mehta, Milind A. Sohoni, Vijay V. Vazirani:
A complementary pivot algorithm for markets under separable, piecewise-linear concave utilities. STOC 2012: 1003-1016 - 2011
- [c19]Bharat Adsul, Jugal Garg, Ruta Mehta, Milind A. Sohoni:
Rank-1 bimatrix games: a homeomorphism and a polynomial time algorithm. STOC 2011: 195-204 - 2010
- [c18]Bharat Adsul, Ch. Sobhan Babu, Jugal Garg, Ruta Mehta, Milind A. Sohoni:
A Simplex-Like Algorithm for Fisher Markets. SAGT 2010: 18-29 - [c17]Bharat Adsul, Ch. Sobhan Babu, Jugal Garg, Ruta Mehta, Milind A. Sohoni:
Nash Equilibria in Fisher Market. SAGT 2010: 30-41 - 2004
- [c16]Bharat Adsul, Milind A. Sohoni:
Asynchronous Automata-Theoretic Characterization of Aperiodic Trace Languages. FSTTCS 2004: 84-96 - 2002
- [c15]Bharat Adsul, Milind A. Sohoni:
Local Normal Forms for Logics over Traces. FSTTCS 2002: 47-58 - [c14]Bharat Adsul, Milind A. Sohoni:
Complete and Tractable Local Linear Time Temporal Logics over Traces. ICALP 2002: 926-937 - [c13]Sashikumar Venkataraman, Milind A. Sohoni:
Reconstruction of feature volumes and feature suppression. Symposium on Solid Modeling and Applications 2002: 60-71 - [c12]Sashikumar Venkataraman, Milind A. Sohoni, Rahul Rajadhyaksha:
Removal of blends from boundary representation models. Symposium on Solid Modeling and Applications 2002: 83-94 - [c11]Sashikumar Venkataraman, Milind A. Sohoni:
Reconstruction of feature volumes and feature suppression. Symposium on Solid Modeling and Applications 2002: 321-328 - 2001
- [c10]Sashikumar Venkataraman, Milind A. Sohoni, Gershon Elber:
Blend recognition algorithm and applications. Symposium on Solid Modeling and Applications 2001: 99-108 - [c9]Sashikumar Venkataraman, Milind A. Sohoni, Vinay Kulkarni:
A graph-based framework for feature recognition. Symposium on Solid Modeling and Applications 2001: 194-205 - 2000
- [c8]Madhavan Mukund, K. Narayan Kumar, Milind A. Sohoni:
Synthesizing Distributed Finite-State Systems from MSCs. CONCUR 2000: 521-535 - [c7]Bharat Adsul, Aranyak Mehta, Milind A. Sohoni:
Keeping Track of the Latest Gossip in Shared Memory Systems. FSTTCS 2000: 477-488 - 1998
- [c6]Madhavan Mukund, K. Narayan Kumar, Jaikumar Radhakrishnan, Milind A. Sohoni:
Towards a Characterisation of Finite-State Message-Passing Systems. ASIAN 1998: 282-299 - [c5]Madhavan Mukund, K. Narayan Kumar, Jaikumar Radhakrishnan, Milind A. Sohoni:
Robust Asynchronous Protocols Are Finite-State. ICALP 1998: 188-199 - 1995
- [c4]Nils Klarlund, Madhavan Mukund, Milind A. Sohoni:
Determinizing Büchi Asnchronous Automata. FSTTCS 1995: 456-470 - [c3]Madhavan Mukund, K. Narayan Kumar, Milind A. Sohoni:
Keeping Track of the Latest Gossip in Message-Passing Systems. STRICT 1995: 249-263 - 1994
- [c2]Nils Klarlund, Madhavan Mukund, Milind A. Sohoni:
Determinizing Asynchronous Automata. ICALP 1994: 130-141 - 1993
- [c1]Madhavan Mukund, Milind A. Sohoni:
Keeping Track of the Latest Gossip: Bounded Time-Stamps Suffice. FSTTCS 1993: 388-399
Informal and Other Publications
- 2023
- [i14]Bharat Adsul, Milind A. Sohoni, K. V. Subrahmanyam:
Orbit closures, stabilizer limits and intermediate G-varieties. CoRR abs/2309.15816 (2023) - 2022
- [i13]Bharat Adsul, Milind A. Sohoni, K. V. Subrahmanyam:
Geometric Complexity Theory - Lie Algebraic Methods for Projective Limits of Stable Points. CoRR abs/2201.00135 (2022) - 2018
- [i12]Bharat Adsul, Jugal Garg, Ruta Mehta, Milind A. Sohoni, Bernhard von Stengel:
Fast Algorithms for Rank-1 Bimatrix Games. CoRR abs/1812.04611 (2018) - 2014
- [i11]Bharat Adsul, Jinesh Machchhar, Milind A. Sohoni:
A Computational Framework for Boundary Representation of Solid Sweeps. CoRR abs/1404.0119 (2014) - [i10]Bharat Adsul, Jinesh Machchhar, Milind A. Sohoni:
Incorporating Sharp Features in the General Solid Sweep Framework. CoRR abs/1405.7457 (2014) - 2013
- [i9]Bharat Adsul, Jinesh Machchhar, Milind A. Sohoni:
Local and Global Analysis of Parametric Solid Sweeps. CoRR abs/1305.7351 (2013) - 2012
- [i8]Bharat Adsul, Jinesh Machchhar, Milind A. Sohoni:
A procedural framework and mathematical analysis for solid sweeps. CoRR abs/1204.0908 (2012) - 2010
- [i7]Bharat Adsul, Ch. Sobhan Babu, Jugal Garg, Ruta Mehta, Milind A. Sohoni:
Nash equilibria in Fisher market. CoRR abs/1002.4832 (2010) - [i6]Bharat Adsul, Jugal Garg, Ruta Mehta, Milind A. Sohoni:
Rank-1 Bi-matrix Games: A Homeomorphism and a Polynomial Time Algorithm. CoRR abs/1010.3083 (2010) - 2009
- [i5]Bharat Adsul, Milind A. Sohoni, K. V. Subrahmanyam:
Quantum deformations of the restriction of GLmn(C)-modules to GLm(C) × GLn(C). CoRR abs/0905.0094 (2009) - 2007
- [i4]Ketan Mulmuley, Milind A. Sohoni:
Geometric Complexity Theory: Introduction. CoRR abs/0709.0746 (2007) - [i3]Ketan Mulmuley, Milind A. Sohoni:
Geometric Complexity Theory IV: quantum group for the Kronecker problem. CoRR abs/cs/0703110 (2007) - 2006
- [i2]Ketan Mulmuley, Milind A. Sohoni:
Geometric Complexity Theory II: Towards explicit obstructions for embeddings among class varieties. CoRR abs/cs/0612134 (2006) - 2005
- [i1]Ketan Mulmuley, Milind A. Sohoni:
Geometric Complexity III: on deciding positivity of Littlewood-Richardson coefficients. CoRR abs/cs/0501076 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
