Bharat Adsul

According to our database, Bharat Adsul authored at least 31 papers between 2000 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

Non-deterministic asynchronous automata games and their undecidability.

Bharat Adsul, Nehul Jain

CoRR, 2024

Propositional dynamic logic and asynchronous cascade decompositions for regular trace languages.

Bharat Adsul, Paul Gastin, Shantanu Kulkarni, Pascal Weil

CoRR, 2024

An expressively complete local past propositional dynamic logic over Mazurkiewicz traces and its applications.

Bharat Adsul, Paul Gastin, Shantanu Kulkarni, Pascal Weil

Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024

2023

Algebraic characterizations and block product decompositions for first order logic and its infinitary quantifier extensions over countable words.

Bharat Adsul, Saptarshi Sarkar, A. V. Sreejith

J. Comput. Syst. Sci., 2023

Orbit closures, stabilizer limits and intermediate G-varieties.

Bharat Adsul, Milind A. Sohoni, K. V. Subrahmanyam

CoRR, 2023

2022

Asynchronous wreath product and cascade decompositions for concurrent behaviours.

Bharat Adsul, Paul Gastin, Saptarshi Sarkar, Pascal Weil

Log. Methods Comput. Sci., 2022

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

Bharat Adsul, Milind A. Sohoni, K. V. Subrahmanyam

CoRR, 2022

Propositional Dynamic Logic and Asynchronous Cascade Decompositions for Regular Trace Languages.

Bharat Adsul, Paul Gastin, Saptarshi Sarkar, Pascal Weil

Proceedings of the 33rd International Conference on Concurrency Theory, 2022

2021

Fast Algorithms for Rank-1 Bimatrix Games.

Bharat Adsul, Jugal Garg, Ruta Mehta, Milind A. Sohoni, Bernhard von Stengel

Oper. Res., 2021

First-Order Logic and Its Infinitary Quantifier Extensions over Countable Words.

Bharat Adsul, Saptarshi Sarkar, A. V. Sreejith

Proceedings of the Fundamentals of Computation Theory - 23rd International Symposium, 2021

2020

Wreath/cascade products and related decomposition results for the concurrent setting of Mazurkiewicz traces (extended version).

Bharat Adsul, Paul Gastin, Saptarshi Sarkar, Pascal Weil

CoRR, 2020

Wreath/Cascade Products and Related Decomposition Results for the Concurrent Setting of Mazurkiewicz Traces.

Bharat Adsul, Paul Gastin, Saptarshi Sarkar, Pascal Weil

Proceedings of the 31st International Conference on Concurrency Theory, 2020

2019

Block products for algebras over countable words and applications to logic.

Bharat Adsul, Saptarshi Sarkar, A. V. Sreejith

Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

2016

Incorporating Sharp Features in the General Solid Sweep Framework.

Bharat Adsul, Jinesh Machchhar, Milind A. Sohoni

Comput. Graph. Forum, 2016

A generalization of the Łoś-Tarski preservation theorem.

Abhisekh Sankaran, Bharat Adsul, Supratik Chakraborty

Ann. Pure Appl. Log., 2016

2014

A Computational Framework for Boundary Representation of Solid Sweeps.

Bharat Adsul, Jinesh Machchhar, Milind A. Sohoni

CoRR, 2014

Local and global analysis of parametric solid sweeps.

Bharat Adsul, Jinesh Machchhar, Milind A. Sohoni

Comput. Aided Geom. Des., 2014

A Generalization of the Łoś-Tarski Preservation Theorem over Classes of Finite Structures.

Abhisekh Sankaran, Bharat Adsul, Supratik Chakraborty

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

2013

Generalizations of the Los-Tarski Preservation Theorem

Abhisekh Sankaran, Bharat Adsul, Supratik Chakraborty

CoRR, 2013

2012

A procedural framework and mathematical analysis for solid sweeps

Bharat Adsul, Jinesh Machchhar, Milind A. Sohoni

CoRR, 2012

Preservation under Substructures modulo Bounded Cores.

Abhisekh Sankaran, Bharat Adsul, Vivek Madan, Pritish Kamath, Supratik Chakraborty

Proceedings of the Logic, Language, Information and Computation, 2012

2011

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

Bharat Adsul, Jugal Garg, Ruta Mehta, Milind A. Sohoni

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

2010

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

Bharat Adsul, Jugal Garg, Ruta Mehta, Milind A. Sohoni

CoRR, 2010

Nash Equilibria in Fisher Market.

Bharat Adsul, Ch. Sobhan Babu, Jugal Garg, Ruta Mehta, Milind A. Sohoni

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

A Simplex-Like Algorithm for Fisher Markets.

Bharat Adsul, Ch. Sobhan Babu, Jugal Garg, Ruta Mehta, Milind A. Sohoni

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

2009

Quantum deformations of the restriction of GL_mn(C)-modules to GL_m(C) × GL_n(C)

Bharat Adsul, Milind A. Sohoni, K. V. Subrahmanyam

CoRR, 2009

2005

Causal Closure for MSC Languages.

Bharat Adsul, Madhavan Mukund, K. Narayan Kumar, Vasumathi Narayanan

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

2004

Asynchronous Automata-Theoretic Characterization of Aperiodic Trace Languages.

Bharat Adsul, Milind A. Sohoni

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

2002

Complete and Tractable Local Linear Time Temporal Logics over Traces.

Bharat Adsul, Milind A. Sohoni

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

Local Normal Forms for Logics over Traces.

Bharat Adsul, Milind A. Sohoni

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

2000

Keeping Track of the Latest Gossip in Shared Memory Systems.

Bharat Adsul, Aranyak Mehta, Milind A. Sohoni

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