default search action
Bharat Adsul
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c15]Bharat Adsul
, Paul Gastin
An expressively complete local past propositional dynamic logic over Mazurkiewicz traces and its applications. LICS 2024: 2:1-2:13 - [i18]Bharat Adsul, Paul Gastin, Shantanu Kulkarni, Pascal Weil:
Propositional dynamic logic and asynchronous cascade decompositions for regular trace languages. CoRR abs/2405.11308 (2024) - [i17]Bharat Adsul, Nehul Jain:
Non-deterministic asynchronous automata games and their undecidability. CoRR abs/2410.04420 (2024) - 2023
- [j6]Bharat Adsul, Saptarshi Sarkar, A. V. Sreejith:
Algebraic characterizations and block product decompositions for first order logic and its infinitary quantifier extensions over countable words. J. Comput. Syst. Sci. 136: 302-326 (2023) - [i16]Bharat Adsul, Milind A. Sohoni, K. V. Subrahmanyam:
Orbit closures, stabilizer limits and intermediate G-varieties. CoRR abs/2309.15816 (2023) - 2022
- [j5]Bharat Adsul, Paul Gastin
Asynchronous wreath product and cascade decompositions for concurrent behaviours. Log. Methods Comput. Sci. 18(2) (2022) - [c14]Bharat Adsul, Paul Gastin, Saptarshi Sarkar, Pascal Weil:
Propositional Dynamic Logic and Asynchronous Cascade Decompositions for Regular Trace Languages. CONCUR 2022: 28:1-28:19 - [i15]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) - 2021
- [j4]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) - [c13]Bharat Adsul, Saptarshi Sarkar, A. V. Sreejith:
First-Order Logic and Its Infinitary Quantifier Extensions over Countable Words. FCT 2021: 39-52 - [i14]Bharat Adsul, Paul Gastin, Saptarshi Sarkar, Pascal Weil:
Asynchronous wreath product and cascade decompositions for concurrent behaviours. CoRR abs/2105.10897 (2021) - [i13]Bharat Adsul, Saptarshi Sarkar, A. V. Sreejith:
First-Order logic and its Infinitary Quantifier Extensions over Countable Words. CoRR abs/2107.01468 (2021) - 2020
- [c12]Bharat Adsul, Paul Gastin
Wreath/Cascade Products and Related Decomposition Results for the Concurrent Setting of Mazurkiewicz Traces. CONCUR 2020: 19:1-19:17 - [i12]Bharat Adsul, Paul Gastin, Saptarshi Sarkar, Pascal Weil:
Wreath/cascade products and related decomposition results for the concurrent setting of Mazurkiewicz traces (extended version). CoRR abs/2007.07940 (2020)
2010 – 2019
- 2019
- [c11]Bharat Adsul, Saptarshi Sarkar, A. V. Sreejith:
Block products for algebras over countable words and applications to logic. LICS 2019: 1-13 - 2018
- [i11]Bharat Adsul, Jugal Garg, Ruta Mehta, Milind A. Sohoni, Bernhard von Stengel:
Fast Algorithms for Rank-1 Bimatrix Games. CoRR abs/1812.04611 (2018) - 2016
- [j3]Abhisekh Sankaran, Bharat Adsul, Supratik Chakraborty
A generalization of the Łoś-Tarski preservation theorem. Ann. Pure Appl. Log. 167(3): 189-210 (2016) - [j2]Bharat Adsul, Jinesh Machchhar, Milind A. Sohoni:
Incorporating Sharp Features in the General Solid Sweep Framework. Comput. Graph. Forum 35(5): 21-31 (2016) - 2014
- [j1]Bharat Adsul, Jinesh Machchhar, Milind A. Sohoni:
Local and global analysis of parametric solid sweeps. Comput. Aided Geom. Des. 31(6): 294-316 (2014) - [c10]Abhisekh Sankaran, Bharat Adsul, Supratik Chakraborty
A Generalization of the Łoś-Tarski Preservation Theorem over Classes of Finite Structures. MFCS (1) 2014: 474-485 - [i10]Abhisekh Sankaran, Bharat Adsul, Supratik Chakraborty:
A Generalization of the Łoś-Tarski Preservation Theorem over Classes of Finite Structures. CoRR abs/1401.5953 (2014) - [i9]Bharat Adsul, Jinesh Machchhar, Milind A. Sohoni:
A Computational Framework for Boundary Representation of Solid Sweeps. CoRR abs/1404.0119 (2014) - [i8]Bharat Adsul, Jinesh Machchhar, Milind A. Sohoni:
Incorporating Sharp Features in the General Solid Sweep Framework. CoRR abs/1405.7457 (2014) - 2013
- [i7]Abhisekh Sankaran, Bharat Adsul, Supratik Chakraborty:
Generalizations of the Los-Tarski Preservation Theorem. CoRR abs/1302.4350 (2013) - [i6]Bharat Adsul, Jinesh Machchhar, Milind A. Sohoni:
Local and Global Analysis of Parametric Solid Sweeps. CoRR abs/1305.7351 (2013) - 2012
- [c9]Abhisekh Sankaran, Bharat Adsul, Vivek Madan, Pritish Kamath, Supratik Chakraborty
Preservation under Substructures modulo Bounded Cores. WoLLIC 2012: 291-305 - [i5]Bharat Adsul, Jinesh Machchhar, Milind A. Sohoni:
A procedural framework and mathematical analysis for solid sweeps. CoRR abs/1204.0908 (2012) - [i4]Abhisekh Sankaran, Bharat Adsul, Vivek Madan, Pritish Kamath, Supratik Chakraborty:
Preservation under Substructures modulo Bounded Cores. CoRR abs/1205.1358 (2012) - 2011
- [c8]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
- [c7]Bharat Adsul, Ch. Sobhan Babu, Jugal Garg, Ruta Mehta, Milind A. Sohoni:
A Simplex-Like Algorithm for Fisher Markets. SAGT 2010: 18-29 - [c6]Bharat Adsul, Ch. Sobhan Babu, Jugal Garg, Ruta Mehta, Milind A. Sohoni:
Nash Equilibria in Fisher Market. SAGT 2010: 30-41 - [i3]Bharat Adsul, Ch. Sobhan Babu, Jugal Garg, Ruta Mehta, Milind A. Sohoni:
Nash equilibria in Fisher market. CoRR abs/1002.4832 (2010) - [i2]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)
2000 – 2009
- 2009
- [i1]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) - 2005
- [c5]Bharat Adsul, Madhavan Mukund, K. Narayan Kumar, Vasumathi Narayanan:
Causal Closure for MSC Languages. FSTTCS 2005: 335-347 - 2004
- [c4]Bharat Adsul, Milind A. Sohoni:
Asynchronous Automata-Theoretic Characterization of Aperiodic Trace Languages. FSTTCS 2004: 84-96 - 2002
- [c3]Bharat Adsul, Milind A. Sohoni:
Local Normal Forms for Logics over Traces. FSTTCS 2002: 47-58 - [c2]Bharat Adsul, Milind A. Sohoni:
Complete and Tractable Local Linear Time Temporal Logics over Traces. ICALP 2002: 926-937 - 2000
- [c1]Bharat Adsul, Aranyak Mehta, Milind A. Sohoni:
Keeping Track of the Latest Gossip in Shared Memory Systems. FSTTCS 2000: 477-488
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-11-13 23:44 CET 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: