The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Milind A. Sohoni: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Madhavan Mukund, K. Narayan Kumar, Jaikumar Radhakrishnan, Milind A. Sohoni
    Towards a Characterisation of Finite-State Message-Passing Systems. [Citation Graph (0, 0)][DBLP]
    ASIAN, 1998, pp:282-299 [Conf]
  2. Madhavan Mukund, K. Narayan Kumar, Milind A. Sohoni
    Synthesizing Distributed Finite-State Systems from MSCs. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2000, pp:521-535 [Conf]
  3. Bharat Adsul, Aranyak Mehta, Milind A. Sohoni
    Keeping Track of the Latest Gossip in Shared Memory Systems. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:477-488 [Conf]
  4. Bharat Adsul, Milind A. Sohoni
    Local Normal Forms for Logics over Traces. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2002, pp:47-58 [Conf]
  5. Bharat Adsul, Milind A. Sohoni
    Asynchronous Automata-Theoretic Characterization of Aperiodic Trace Languages. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2004, pp:84-96 [Conf]
  6. Nils Klarlund, Madhavan Mukund, Milind A. Sohoni
    Determinizing Büchi Asnchronous Automata. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1995, pp:456-470 [Conf]
  7. Madhavan Mukund, Milind A. Sohoni
    Keeping Track of the Latest Gossip: Bounded Time-Stamps Suffice. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1993, pp:388-399 [Conf]
  8. Bharat Adsul, Milind A. Sohoni
    Complete and Tractable Local Linear Time Temporal Logics over Traces. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:926-937 [Conf]
  9. Nils Klarlund, Madhavan Mukund, Milind A. Sohoni
    Determinizing Asynchronous Automata. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:130-141 [Conf]
  10. Madhavan Mukund, K. Narayan Kumar, Jaikumar Radhakrishnan, Milind A. Sohoni
    Robust Asynchronous Protocols Are Finite-State. [Citation Graph (0, 0)][DBLP]
    ICALP, 1998, pp:188-199 [Conf]
  11. Sashikumar Venkataraman, Milind A. Sohoni
    Reconstruction of feature volumes and feature suppression. [Citation Graph (0, 0)][DBLP]
    Symposium on Solid Modeling and Applications, 2002, pp:60-71 [Conf]
  12. Sashikumar Venkataraman, Milind A. Sohoni
    Reconstruction of feature volumes and feature suppression. [Citation Graph (0, 0)][DBLP]
    Symposium on Solid Modeling and Applications, 2002, pp:321-328 [Conf]
  13. Sashikumar Venkataraman, Milind A. Sohoni, Gershon Elber
    Blend recognition algorithm and applications. [Citation Graph (0, 0)][DBLP]
    Symposium on Solid Modeling and Applications, 2001, pp:99-108 [Conf]
  14. Sashikumar Venkataraman, Milind A. Sohoni, Vinay Kulkarni
    A graph-based framework for feature recognition. [Citation Graph (0, 0)][DBLP]
    Symposium on Solid Modeling and Applications, 2001, pp:194-205 [Conf]
  15. Sashikumar Venkataraman, Milind A. Sohoni, Rahul Rajadhyaksha
    Removal of blends from boundary representation models. [Citation Graph (0, 0)][DBLP]
    Symposium on Solid Modeling and Applications, 2002, pp:83-94 [Conf]
  16. Ashish V. Tendulkar, Milind A. Sohoni, Babatunde Ogunnaike, Pramod P. Wangikar
    A geometric invariant-based framework for the analysis of protein conformational space. [Citation Graph (0, 0)][DBLP]
    Bioinformatics, 2005, v:21, n:18, pp:3622-3628 [Journal]
  17. Madhavan Mukund, Milind A. Sohoni
    Keeping Track of the Latest Gossip in a Distributed System. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 1997, v:10, n:3, pp:137-148 [Journal]
  18. Jesper G. Henriksen, Madhavan Mukund, K. Narayan Kumar, Milind A. Sohoni, P. S. Thiagarajan
    A theory of regular MSC languages. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2005, v:202, n:1, pp:1-38 [Journal]
  19. Michael C. Loui, Milind A. Sohoni
    An Algorithm for Load Balancing in Multiprocessor Systems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:35, n:5, pp:223-228 [Journal]
  20. Milind A. Sohoni, Ellis Johnson, T. Bailey
    Operational airline reserve crew planning. [Citation Graph (0, 0)][DBLP]
    J. Scheduling, 2006, v:9, n:3, pp:203-221 [Journal]
  21. Ketan Mulmuley, Milind A. Sohoni
    Geometric Complexity Theory I: An Approach to the P vs. NP and Related Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:2, pp:496-526 [Journal]
  22. Madhavan Mukund, K. Narayan Kumar, Milind A. Sohoni
    Bounded time-stamping in message-passing systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:1, pp:221-239 [Journal]
  23. Sharat Chandran, Ananth K. Potty, Milind A. Sohoni
    Fast image transforms using diophantine methods. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Image Processing, 2003, v:12, n:6, pp:678-684 [Journal]
  24. Ketan Mulmuley, Milind Sohoni
    Geometric Complexity Theory IV: quantum group for the Kronecker problem [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  25. Ketan Mulmuley, Milind Sohoni
    Geometric Complexity Theory II: Towards explicit obstructions for embeddings among class varieties [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  26. Ketan Mulmuley, Milind Sohoni
    Geometric Complexity III: on deciding positivity of Littlewood-Richardson coefficients [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  27. Ketan Mulmuley, Milind Sohoni
    Geometric Complexity Theory: Introduction [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  28. Quantum deformations of the restriction of GLmn(C)-modules to GLm(C) × GLn(C) [Citation Graph (, )][DBLP]


  29. Nash equilibria in Fisher market [Citation Graph (, )][DBLP]


Search in 0.079secs, Finished in 0.081secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002