default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGorav Jindal
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c14]Markus Bläser, Julian Dörfler, Gorav Jindal:
PosSLP and Sum of Squares. FSTTCS 2024: 13:1-13:18- [c13]Pranjal Dutta, Fulvio Gesmundo, Christian Ikenmeyer, Gorav Jindal, Vladimir Lysikov
:
Homogeneous Algebraic Complexity Theory and Algebraic Formulas. ITCS 2024: 43:1-43:23 - [c12]Peter Bürgisser, Gorav Jindal:
On the Hardness of PosSLP. SODA 2024: 1872-1886 - [c11]Pranjal Dutta, Fulvio Gesmundo, Christian Ikenmeyer, Gorav Jindal, Vladimir Lysikov:
Fixed-Parameter Debordering of Waring Rank. STACS 2024: 30:1-30:15 - [i16]Pranjal Dutta, Fulvio Gesmundo, Christian Ikenmeyer, Gorav Jindal, Vladimir Lysikov:
Fixed-parameter debordering of Waring rank. CoRR abs/2401.07631 (2024) - [i15]Gorav Jindal, Joël Ouaknine:
On the Counting Complexity of the Skolem Problem. CoRR abs/2403.00098 (2024) - [i14]Markus Bläser, Julian Dörfler, Gorav Jindal:
PosSLP and Sum of Squares. CoRR abs/2403.00115 (2024) - 2023
- [c10]Gorav Jindal, Louis Gaillard:
On the Order of Power Series and the Sum of Square Roots Problem. ISSAC 2023: 354-362 - [i13]Louis Gaillard, Gorav Jindal:
On the Order of Power Series and the Sum of Square Roots Problem. CoRR abs/2304.13605 (2023) - [i12]Peter Bürgisser, Gorav Jindal:
On the Hardness of PosSLP. CoRR abs/2307.08008 (2023) - [i11]Pranjal Dutta, Fulvio Gesmundo, Christian Ikenmeyer, Gorav Jindal, Vladimir Lysikov:
Homogeneous Algebraic Complexity Theory and Algebraic Formulas. CoRR abs/2311.17019 (2023) - 2022
- [i10]Pranjal Dutta, Fulvio Gesmundo, Christian Ikenmeyer, Gorav Jindal, Vladimir Lysikov:
Border complexity via elementary symmetric polynomials. CoRR abs/2211.07055 (2022) - [i9]Pranjal Dutta, Fulvio Gesmundo, Christian Ikenmeyer, Gorav Jindal, Vladimir Lysikov:
Border complexity via elementary symmetric polynomials. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [c9]Pranjal Dutta, Gorav Jindal, Anurag Pandey, Amit Sinhababu:
Arithmetic Circuit Complexity of Division and Truncation. CCC 2021: 25:1-25:36 - [i8]Pranjal Dutta, Gorav Jindal, Anurag Pandey, Amit Sinhababu:
Arithmetic Circuit Complexity of Division and Truncation. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [c8]Gorav Jindal, Anurag Pandey, Himanshu Shukla, Charilaos Zisopoulos:
How many zeros of a random sparse polynomial are real? ISSAC 2020: 273-280
2010 – 2019
- 2019
- [b1]Gorav Jindal:
On approximate polynomial identy testing and real root finding. Saarland University, Germany, 2019 - [c7]Markus Bläser, Gorav Jindal:
On the Complexity of Symmetric Polynomials. ITCS 2019: 47:1-47:14 - [c6]Vishwas Bhargava, Markus Bläser, Gorav Jindal, Anurag Pandey:
A Deterministic PTAS for the Algebraic Rank of Bounded Degree Polynomials. SODA 2019: 647-661 - [i7]Gorav Jindal, Anurag Pandey, Himanshu Shukla, Charilaos Zisopoulos:
How many zeros of a random sparse polynomial are real? CoRR abs/1911.02540 (2019) - 2018
- [j1]Markus Bläser, Gorav Jindal, Anurag Pandey:
A Deterministic PTAS for the Commutative Rank of Matrix Spaces. Theory Comput. 14(1): 1-21 (2018) - [c5]Markus Bläser, Christian Ikenmeyer, Gorav Jindal, Vladimir Lysikov:
Generalized matrix completion and algebraic natural proofs. STOC 2018: 1193-1206 - [i6]Markus Bläser, Christian Ikenmeyer, Gorav Jindal, Vladimir Lysikov:
Generalized Matrix Completion and Algebraic Natural Proofs. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [c4]Gorav Jindal, Pavel Kolev, Richard Peng, Saurabh Sawlani:
Density Independent Algorithms for Sparsifying k-Step Random Walks. APPROX-RANDOM 2017: 14:1-14:17 - [c3]Markus Bläser, Gorav Jindal, Anurag Pandey:
Greedy Strikes Again: A Deterministic PTAS for Commutative Rank of Matrix Spaces. CCC 2017: 33:1-33:16 - [c2]Gorav Jindal, Michael Sagraloff:
Efficiently Computing Real Roots of Sparse Polynomials. ISSAC 2017: 229-236 - [i5]Gorav Jindal, Pavel Kolev, Richard Peng, Saurabh Sawlani:
Density Independent Algorithms for Sparsifying k-Step Random Walks. CoRR abs/1702.06110 (2017) - [i4]Gorav Jindal, Michael Sagraloff:
Efficiently Computing Real Roots of Sparse Polynomials. CoRR abs/1704.06979 (2017) - 2016
- [i3]Markus Bläser, Gorav Jindal, Anurag Pandey:
Greedy Strikes Again: A Deterministic PTAS for Commutative Rank of Matrix Spaces. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [i2]Gorav Jindal, Pavel Kolev:
Faster Spectral Sparsification of Laplacian and SDDM Matrix Polynomials. CoRR abs/1507.07497 (2015) - 2014
- [c1]Markus Bläser, Gorav Jindal:
A new deterministic algorithm for sparse multivariate polynomial interpolation. ISSAC 2014: 51-58 - 2012
- [i1]Thatchaphol Saranurak, Gorav Jindal:
Subtraction makes computing integers faster. CoRR abs/1212.2549 (2012)
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 2025-01-20 23:02 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:
