Pushkar S. Joglekar

According to our database1, Pushkar S. Joglekar authored at least 19 papers between 2008 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Multivariate to Bivariate Reduction for Noncommutative Polynomial Factorization.
Electron. Colloquium Comput. Complex., 2023

2022
Matrix Polynomial Factorization via Higman Linearization.
Electron. Colloquium Comput. Complex., 2022

On Efficient Noncommutative Polynomial Factorization via Higman Linearization.
Electron. Colloquium Comput. Complex., 2022

Performance Measurement of Prostate Gland Segmentation Approaches in Transrectal Ultrasound and Magnetic Resonance Images.
Proceedings of the Joint Proceedings of the Workshop on Computer Vision and Machine Learning for Healthcare (CVMLH 2022) and the Workshop on Technological Innovations in Education and Knowledge Dissemination (WTEK 2022) Co-located with TOOTILL 100 - 6th International Conference on Computing Sciences (ICCS 2022), Hybrid Event, Chennai, India, April 22, 2022

2021
Urdu & Hindi Poetry Generation using Neural Networks.
CoRR, 2021

2019
Randomized Polynomial-Time Identity Testing for Noncommutative Circuits.
Theory Comput., 2019

2017
On Weak-Space Complexity over Complex Numbers.
Electron. Colloquium Comput. Complex., 2017

2016
Towards a new perspective on context based citation index of research articles.
Scientometrics, 2016

Identity Testing for +-Regular Noncommutative Arithmetic Circuits.
Electron. Colloquium Comput. Complex., 2016

2015
On the expressive power of read-once determinants.
Electron. Colloquium Comput. Complex., 2015

Noncommutative Valiant's Classes: Structure and Complete Problems.
Electron. Colloquium Comput. Complex., 2015

On the Complexity of Noncommutative Polynomial Factorization.
Electron. Colloquium Comput. Complex., 2015

2009
On Lower Bounds for Constant Width Arithmetic Circuits.
Electron. Colloquium Comput. Complex., 2009

Arithmetic Circuit Size, Identity Testing, and Finite Automata.
Electron. Colloquium Comput. Complex., 2009

Arithmetic Circuits, Monomial Algebras and Finite Automata.
Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

Arithmetic Circuits and the Hadamard Product of Polynomials.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2009

2008
Lattice Problems, Gauge Functions and Parameterized Algorithms
CoRR, 2008

Algorithmic Problems for Metrics on Permutation Groups.
Proceedings of the SOFSEM 2008: Theory and Practice of Computer Science, 2008

Some Sieving Algorithms for Lattice Problems.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2008


  Loading...