default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSaugata Basu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j39]Saugata Basu, Ali Mohammad Nezhad
:
On the complexity of analyticity in semi-definite optimization. Adv. Appl. Math. 156: 102670 (2024)- [j38]Saugata Basu, Sarah Percival:
Efficient Computation of a Semi-Algebraic Basis of the First Homology Group of a Semi-Algebraic Set. Discret. Comput. Geom. 72(2): 622-664 (2024) - [j37]Saugata Basu, Negin Karisani:
Computing the Homology Functor on Semi-algebraic Maps and Diagrams. Discret. Comput. Geom. 72(4): 1437-1462 (2024) - [j36]Saugata Basu, Nathanael Cox:
Harmonic Persistent Homology. SIAM J. Appl. Algebra Geom. 8(1): 189-224 (2024) - 2023
- [j35]Saugata Basu, Negin Karisani:
Persistent Homology of Semialgebraic Sets. SIAM J. Appl. Algebra Geom. 7(3): 651-684 (2023) - [c23]Saugata Basu, Hamidreza Amini Khorasgani, Hemanta K. Maji, Hai H. Nguyen:
Randomized Functions with High Round Complexity. TCC (1) 2023: 319-348 - [i30]Saugata Basu, Laxmi Parida:
Quantum Analog of Shannon's Lower Bound Theorem. CoRR abs/2308.13091 (2023) - 2022
- [j34]Saugata Basu, Nathanael Cox, Sarah Percival:
On the Reeb Spaces of Definable Maps. Discret. Comput. Geom. 68(2): 372-405 (2022) - [j33]Saugata Basu, Cordian Riener:
Vandermonde Varieties, Mirrored Spaces, and the Cohomology of Symmetric Semi-algebraic Sets. Found. Comput. Math. 22(5): 1395-1462 (2022) - [j32]Saugata Basu, Ali Mohammad Nezhad:
On the Central Path of Semidefinite Optimization: Degree and Worst-Case Convergence Rate. SIAM J. Appl. Algebra Geom. 6(2): 299-318 (2022) - [c22]Saugata Basu, Hamidreza Amini Khorasgani, Hemanta K. Maji, Hai H. Nguyen:
Geometry of Secure Two-party Computation. FOCS 2022: 1035-1044 - [i29]Saugata Basu, Negin Karisani, Laxmi Parida:
Sequents, barcodes, and homology. CoRR abs/2208.01450 (2022) - 2021
- [c21]Saugata Basu, Nathanael Cox:
Harmonic Persistent Homology (extended abstract). FOCS 2021: 1112-1123 - [i28]Negin Karisani, Daniel E. Platt, Saugata Basu, Laxmi Parida:
Inferring COVID-19 Biological Pathways from Clinical Phenotypes via Topological Analysis. CoRR abs/2101.07417 (2021) - [i27]Saugata Basu, Antonio Lerario:
Hausdorff approximations and volume of tubes of singular algebraic sets. CoRR abs/2104.05053 (2021) - 2020
- [c20]Sayan Mandal, Aldo Guzmán-Sáenz, Niina Haiminen, Saugata Basu, Laxmi Parida:
A Topological Data Analysis Approach on Predicting Phenotypes from Gene Expression Data. AlCoB 2020: 178-187
2010 – 2019
- 2019
- [j31]Aldo Guzmán-Sáenz, Niina Haiminen, Saugata Basu, Laxmi Parida:
Signal enrichment with strain-level resolution in metagenomes using topological data analysis. BMC Genom. 20(S2) (2019) - 2018
- [j30]Saugata Basu, Anthony Rizzie:
Multi-degree Bounds on the Betti Numbers of Real Varieties and Semi-algebraic Sets and Applications. Discret. Comput. Geom. 59(3): 553-620 (2018) - [c19]Saugata Basu, Filippo Utro, Laxmi Parida:
Essential Simplices in Persistent Homology and Subtle Admixture Detection. WABI 2018: 14:1-14:10 - [i26]Saugata Basu, Nathanael Cox, Sarah Percival:
On the Reeb spaces of definable maps. CoRR abs/1804.00605 (2018) - 2016
- [j29]Daniel E. Platt, Saugata Basu, Pierre A. Zalloua, Laxmi Parida:
Characterizing redescriptions using persistent homology to isolate genetic pathways contributing to pathogenesis. BMC Syst. Biol. 10(S-1): 10 (2016) - [j28]Saugata Basu, Martín Sombra:
Polynomial Partitioning on Varieties of Codimension Two and Point-Hypersurface Incidences in Four Dimensions. Discret. Comput. Geom. 55(1): 158-184 (2016) - [i25]Saugata Basu, Cordian Riener:
Efficient algorithms for computing the Euler-Poincaré characteristic of symmetric semi-algebraic sets. CoRR abs/1608.06828 (2016) - [i24]Saugata Basu, Cordian Riener:
On the equivariant Betti numbers of symmetric semi-algebraic sets: vanishing, bounds and algorithms. CoRR abs/1610.04946 (2016) - [i23]Saugata Basu, M. Umut Isik:
Categorical Complexity. CoRR abs/1610.07737 (2016) - [i22]Saugata Basu, Orit E. Raz:
An o-minimal Szemerédi-Trotter theorem. CoRR abs/1611.07362 (2016) - 2015
- [j27]Saugata Basu:
A Complexity Theory of Constructible Functions and Sheaves. Found. Comput. Math. 15(1): 199-279 (2015) - [c18]Laxmi Parida, Filippo Utro, Deniz Yörükoglu, Anna Paola Carrieri, David Kuhn, Saugata Basu:
Topological Signatures for Population Admixture. RECOMB 2015: 261-275 - [i21]Saugata Basu, Cordian Riener:
On the isotypic decomposition of cohomology modules of symmetric semi-algebraic sets: polynomial bounds on multiplicities. CoRR abs/1503.00138 (2015) - [i20]Saugata Basu, Anthony Rizzie:
Multi-degree bounds on the Betti numbers of real varieties and semi-algebraic sets and applications. CoRR abs/1507.03958 (2015) - 2014
- [j26]Saugata Basu, Marie-Françoise Roy:
Divide and Conquer Roadmap for Algebraic Sets. Discret. Comput. Geom. 52(2): 278-343 (2014) - [j25]Saugata Basu, Marie-Françoise Roy, Mohab Safey El Din, Éric Schost:
A Baby Step-Giant Step Roadmap Algorithm for General Algebraic Sets. Found. Comput. Math. 14(6): 1117-1172 (2014) - [i19]Saugata Basu, Martín Sombra:
Polynomial partitioning on varieties and point-hypersurface incidences in four dimensions. CoRR abs/1406.2144 (2014) - [i18]Saugata Basu:
Algorithms in Real Algebraic Geometry: A Survey. CoRR abs/1409.1534 (2014) - 2013
- [j24]Saugata Basu, Andrei Gabrielov, Nicolai N. Vorobjov Jr.:
A Helly-Type Theorem for Semi-monotone Sets and Monotone Maps. Discret. Comput. Geom. 50(4): 857-864 (2013) - [i17]Saugata Basu, Laxmi Parida:
Spectral Sequences, Exact Couples and Persistent Homology of filtrations. CoRR abs/1308.0801 (2013) - [i16]Saugata Basu:
A complexity theory of constructible functions and sheaves. CoRR abs/1309.5905 (2013) - [i15]Saugata Basu, Cordian Riener:
Bounding the equivariant Betti numbers and computing the generalized Euler-Poincaré characteristic of symmetric semi-algebraic sets. CoRR abs/1312.6582 (2013) - 2012
- [j23]Sal Barone, Saugata Basu:
Refined Bounds on the Number of Connected Components of Sign Conditions on a Variety. Discret. Comput. Geom. 47(3): 577-597 (2012) - [j22]Saugata Basu:
A Complex Analogue of Toda's Theorem. Found. Comput. Math. 12(3): 327-362 (2012) - [i14]Saugata Basu, Marie-Françoise Roy, Mohab Safey El Din, Éric Schost:
A baby step-giant step roadmap algorithm for general algebraic sets. CoRR abs/1201.6439 (2012) - 2011
- [i13]Sal Barone, Saugata Basu:
Refined bounds on the number of connected components of sign conditions on a variety. CoRR abs/1104.0636 (2011) - 2010
- [j21]Saugata Basu, Thierry Zell:
Polynomial Hierarchy, Betti Numbers, and a Real Analogue of Toda's Theorem. Found. Comput. Math. 10(4): 429-454 (2010) - [j20]Saugata Basu, Marie-Françoise Roy:
Bounding the radii of balls meeting every connected component of semi-algebraic sets. J. Symb. Comput. 45(12): 1270-1279 (2010)
2000 – 2009
- 2009
- [j19]Saugata Basu, Richard Pollack, Marie-Françoise Roy:
An asymptotically tight bound on the number of semi-algebraically connected components of realizable sign conditions. Comb. 29(5): 523-546 (2009) - [c17]Saugata Basu, Thierry Zell:
Polynomial Hierarchy, Betti Numbers and a Real Analogue of Toda's Theorem. FOCS 2009: 73-82 - [i12]Saugata Basu, Richard Leroy, Marie-Françoise Roy:
A bound on the minimum of a real positive polynomial over the standard simplex. CoRR abs/0902.3304 (2009) - [i11]Saugata Basu, Marie-Françoise Roy:
Bounding the radii of balls meeting every connected component of semi-algebraic sets. CoRR abs/0911.1340 (2009) - [i10]Saugata Basu:
A complex analogue of Toda's Theorem. CoRR abs/0912.2652 (2009) - [i9]Saugata Basu:
A complex analogue of Toda's Theorem. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [j18]Saugata Basu, Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton:
Polynomials that Sign Represent Parity and Descartes' Rule of Signs. Comput. Complex. 17(3): 377-406 (2008) - [j17]Saugata Basu, Thierry Zell:
On Projections of Semi-Algebraic Sets Defined by Few Quadratic Inequalities. Discret. Comput. Geom. 39(1-3): 100-122 (2008) - [j16]Saugata Basu, Michael Kettner:
A Sharper Estimate on the Betti Numbers of Sets Defined by Quadratic Inequalities. Discret. Comput. Geom. 39(4): 734-746 (2008) - [j15]Saugata Basu:
On the Number of Topological Types Occurring in a Parameterized Family of Arrangements. Discret. Comput. Geom. 40(4): 481-503 (2008) - [j14]Saugata Basu:
Computing the Top Betti Numbers of Semialgebraic Sets Defined by Quadratic Inequalities in Polynomial Time. Found. Comput. Math. 8(1): 45-80 (2008) - [j13]Saugata Basu:
Errata for Computing the Top Betti Numbers of Semialgebraic Sets Defined by Quadratic Inequalities in Polynomial Time. Found. Comput. Math. 8(1): 81-95 (2008) - [j12]Saugata Basu, Richard Pollack, Marie-Françoise Roy:
Computing the First Betti Number of a Semi-Algebraic Set. Found. Comput. Math. 8(1): 97-136 (2008) - [i8]Saugata Basu, Thierry Zell:
Polynomial hierarchy, Betti numbers and a real analogue of Toda's theorem. CoRR abs/0812.1200 (2008) - 2007
- [c16]Saugata Basu:
Combinatorial complexity in O-minimal geometry. STOC 2007: 47-56 - [i7]Saugata Basu:
Algorithmic Semi-algebraic Geometry and Topology -- Recent Progress and Open Problems. CoRR abs/0708.2854 (2007) - [i6]Saugata Basu, Dmitrii V. Pasechnik, Marie-Françoise Roy:
Betti numbers of semi-algebraic sets defined by partly quadratic systems of polynomials. CoRR abs/0708.3522 (2007) - 2006
- [j11]Saugata Basu:
Efficient algorithm for computing the Euler-Poincaré characteristic of a semi-algebraic set defined by few quadratic inequalities. Comput. Complex. 15(3): 236-251 (2006) - [j10]Saugata Basu:
Computing the first few Betti numbers of semi-algebraic sets in single exponential time. J. Symb. Comput. 41(10): 1125-1154 (2006) - [i5]Saugata Basu:
Efficient algorithm for computing the Euler-Poincaré characteristic of a semi-algebraic set defined by few quadratic inequalities. CoRR abs/cs/0605082 (2006) - [i4]Saugata Basu, Richard Pollack, Marie-Françoise Roy:
Computing the First Betti Numberand Describing the Connected Components of Semi-algebraic Sets. CoRR abs/math/0603248 (2006) - [i3]Saugata Basu, Richard Pollack, Marie-Françoise Roy:
An asymptotically tight bound on the number of connected components of realizable sign conditions. CoRR abs/math/0603256 (2006) - [i2]Saugata Basu:
Computing the Top Betti Numbers of Semi-algebraic Sets Defined by Quadratic Inequalities in Polynomial Time. CoRR abs/math/0603262 (2006) - [i1]Saugata Basu:
Computing the First Few Betti Numbers of Semi-algebraic Sets in Single Exponential Time. CoRR abs/math/0603263 (2006) - 2005
- [j9]Saugata Basu, Richard Pollack, Marie-Françoise Roy:
Computing the euler-poincaré characteristics of sign conditions. Comput. Complex. 14(1): 53-71 (2005) - [c15]Saugata Basu, Michael Kettner:
Computing the Betti Numbers of Arrangements in Practice. CASC 2005: 13-31 - [c14]Saugata Basu, Richard Pollack, Marie-Françoise Roy:
Computing the first Betti number and the connected components of semi-algebraic sets. STOC 2005: 304-312 - [c13]Saugata Basu:
Polynomial time algorithm for computing the top Betti numbers of semi-algebraic sets defined by quadratic inequalities. STOC 2005: 313-322 - 2004
- [c12]Saugata Basu, Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton:
Polynomials That Sign Represent Parity and Descartes Rule of Signs. CCC 2004: 223-235 - [c11]Saugata Basu, Raghavan Dhandapani, Richard Pollack:
On the Realizable Weaving Patterns of Polynomial Curves in R3. GD 2004: 36-42 - 2003
- [j8]Saugata Basu:
The Combinatorial and Topological Complexity of a Single Cell. Discret. Comput. Geom. 29(1): 41-59 (2003) - [j7]Saugata Basu:
Different Bounds on the Different Betti Numbers of Semi-Algebraic Sets. Discret. Comput. Geom. 30(1): 65-85 (2003) - [j6]Saugata Basu:
Computing the Betti numbers of arrangements via spectral sequences. J. Comput. Syst. Sci. 67(2): 244-262 (2003) - 2002
- [c10]Saugata Basu:
Computing the betti numbers of arrangements. STOC 2002: 712-720 - 2001
- [c9]Saugata Basu:
Different bounds on the different Betti numbers of semi-algebraic sets. SCG 2001: 288-292 - [e1]Saugata Basu, Laureano González-Vega:
Algorithmic and Quantitative Aspects of Real Algebraic Geometry in Mathematics and Computer Science, Proceedings of a DIMACS Workshop, Piscataway, NJ, USA, March 12-16, 2001. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 60, DIMACS/AMS 2001, ISBN 0-8218-2863-0 [contents]
1990 – 1999
- 1999
- [j5]Saugata Basu:
On Bounding the Betti Numbers and Computing the Euler Characteristic of Semi-Algebraic Sets. Discret. Comput. Geom. 22(1): 1-18 (1999) - [j4]Saugata Basu:
New Results on Quantifier Elimination over Real Closed Fields and Applications to Constraint Databases. J. ACM 46(4): 537-555 (1999) - 1998
- [c8]Saugata Basu:
On the Combinatorial and Topological Complexity of a Single Cell. FOCS 1998: 606-616 - [c7]Saugata Basu, Richard Pollack, Marie-Françoise Roy:
Complexity of Computing Semi-Algebraic Descriptions of the Connected Components of a Semi-Algebraic Set. ISSAC 1998: 25-29 - 1997
- [j3]Saugata Basu, Richard Pollack, Marie-Françoise Roy:
On Computing a Set of Points Meeting Every Cell Defined by a Family of Polynomials on a Variety. J. Complex. 13(1): 28-37 (1997) - [c6]Saugata Basu:
An Improved Algorithm for Quantifier Elimination Over Real Closed Fields. FOCS 1997: 56-65 - [c5]Saugata Basu:
Uniform Quantifier Elimination and Constraint Query Processing. ISSAC 1997: 21-27 - 1996
- [b1]Saugata Basu:
Algorithms in Semi-Algabraic Geometry. New York University, USA, 1996 - [j2]Saugata Basu, Richard Pollack, Marie-Françoise Roy:
On the Combinatorial and Algebraic Complexity of Quantifier Elimination. J. ACM 43(6): 1002-1045 (1996) - [c4]Saugata Basu, Richard Pollack, Marie-Françoise Roy:
Computing Roadmaps of Semi-Algebraic Sets (Extended Abstract). STOC 1996: 168-173 - [c3]Saugata Basu:
On Bounding the Betti Numbers and Computing the Euler Characteristic of Semi-Algebraic Sets. STOC 1996: 408-417 - 1994
- [j1]Dipanwita Roy Chowdhury, Saugata Basu, Idranil Sen Gupta, Parimal Pal Chaudhuri:
Design of CAECC-Cellular Automata Based Error Correcting Code. IEEE Trans. Computers 43(6): 759-764 (1994) - [c2]Saugata Basu, Richard Pollack, Marie-Françoise Roy:
On the Combinatorial and Algebraic Complexity of Quantifier Elimination. FOCS 1994: 632-641 - 1992
- [c1]Dipanwita Roy Chowdhury, Saugata Basu, Idranil Sen Gupta, Parimal Pal Chaudhuri:
A Novel Scheme for Designing Error Correcting Codes Using Cellular Automata. VLSI Design 1992: 133-136
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:
