Saugata Basu

According to our database1, Saugata Basu authored at least 67 papers between 1992 and 2022.

Collaborative distances:
  • Dijkstra number2 of two.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2022
On the Central Path of Semidefinite Optimization: Degree and Worst-Case Convergence Rate.
SIAM J. Appl. Algebra Geom., 2022

Sequents, barcodes, and homology.
CoRR, 2022

2021
Hausdorff approximations and volume of tubes of singular algebraic sets.
CoRR, 2021

Inferring COVID-19 Biological Pathways from Clinical Phenotypes via Topological Analysis.
CoRR, 2021

Harmonic Persistent Homology (extended abstract).
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020
A Topological Data Analysis Approach on Predicting Phenotypes from Gene Expression Data.
Proceedings of the Algorithms for Computational Biology, 2020

2019
Signal enrichment with strain-level resolution in metagenomes using topological data analysis.
BMC Genom., 2019

2018
Multi-degree Bounds on the Betti Numbers of Real Varieties and Semi-algebraic Sets and Applications.
Discret. Comput. Geom., 2018

On the Reeb spaces of definable maps.
CoRR, 2018

Essential Simplices in Persistent Homology and Subtle Admixture Detection.
Proceedings of the 18th International Workshop on Algorithms in Bioinformatics, 2018

2016
Polynomial Partitioning on Varieties of Codimension Two and Point-Hypersurface Incidences in Four Dimensions.
Discret. Comput. Geom., 2016

An o-minimal Szemerédi-Trotter theorem.
CoRR, 2016

On the equivariant Betti numbers of symmetric semi-algebraic sets: vanishing, bounds and algorithms.
CoRR, 2016

Efficient algorithms for computing the Euler-Poincaré characteristic of symmetric semi-algebraic sets.
CoRR, 2016

Categorical Complexity.
CoRR, 2016

Characterizing redescriptions using persistent homology to isolate genetic pathways contributing to pathogenesis.
BMC Syst. Biol., 2016

2015
A Complexity Theory of Constructible Functions and Sheaves.
Found. Comput. Math., 2015

On the isotypic decomposition of cohomology modules of symmetric semi-algebraic sets: polynomial bounds on multiplicities.
CoRR, 2015

Topological Signatures for Population Admixture.
Proceedings of the Research in Computational Molecular Biology, 2015

2014
A Baby Step-Giant Step Roadmap Algorithm for General Algebraic Sets.
Found. Comput. Math., 2014

Divide and Conquer Roadmap for Algebraic Sets.
Discret. Comput. Geom., 2014

Polynomial partitioning on varieties and point-hypersurface incidences in four dimensions.
CoRR, 2014

Algorithms in Real Algebraic Geometry: A Survey.
CoRR, 2014

2013
A Helly-Type Theorem for Semi-monotone Sets and Monotone Maps.
Discret. Comput. Geom., 2013

Bounding the equivariant Betti numbers and computing the generalized Euler-Poincaré characteristic of symmetric semi-algebraic sets.
CoRR, 2013

Spectral Sequences, Exact Couples and Persistent Homology of filtrations.
CoRR, 2013

2012
A Complex Analogue of Toda's Theorem.
Found. Comput. Math., 2012

Refined Bounds on the Number of Connected Components of Sign Conditions on a Variety.
Discret. Comput. Geom., 2012

2010
Bounding the radii of balls meeting every connected component of semi-algebraic sets.
J. Symb. Comput., 2010

Polynomial Hierarchy, Betti Numbers, and a Real Analogue of Toda's Theorem.
Found. Comput. Math., 2010

2009
A bound on the minimum of a real positive polynomial over the standard simplex
CoRR, 2009

An asymptotically tight bound on the number of semi-algebraically connected components of realizable sign conditions.
Comb., 2009

2008
Computing the First Betti Number of a Semi-Algebraic Set.
Found. Comput. Math., 2008

Errata for Computing the Top Betti Numbers of Semialgebraic Sets Defined by Quadratic Inequalities in Polynomial Time.
Found. Comput. Math., 2008

Computing the Top Betti Numbers of Semialgebraic Sets Defined by Quadratic Inequalities in Polynomial Time.
Found. Comput. Math., 2008

On Projections of Semi-Algebraic Sets Defined by Few Quadratic Inequalities.
Discret. Comput. Geom., 2008

A Sharper Estimate on the Betti Numbers of Sets Defined by Quadratic Inequalities.
Discret. Comput. Geom., 2008

On the Number of Topological Types Occurring in a Parameterized Family of Arrangements.
Discret. Comput. Geom., 2008

Polynomials that Sign Represent Parity and Descartes' Rule of Signs.
Comput. Complex., 2008

2007
Betti numbers of semi-algebraic sets defined by partly quadratic systems of polynomials
CoRR, 2007

Algorithmic Semi-algebraic Geometry and Topology -- Recent Progress and Open Problems
CoRR, 2007

Combinatorial complexity in O-minimal geometry.
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

2006
Computing the first few Betti numbers of semi-algebraic sets in single exponential time.
J. Symb. Comput., 2006

Computing the Top Betti Numbers of Semi-algebraic Sets Defined by Quadratic Inequalities in Polynomial Time
CoRR, 2006

An asymptotically tight bound on the number of connected components of realizable sign conditions
CoRR, 2006

Computing the First Betti Numberand Describing the Connected Components of Semi-algebraic Sets
CoRR, 2006

Efficient algorithm for computing the Euler-Poincaré characteristic of a semi-algebraic set defined by few quadratic inequalities.
Comput. Complex., 2006

2005
Computing the euler-poincaré characteristics of sign conditions.
Comput. Complex., 2005

Computing the first Betti number and the connected components of semi-algebraic sets.
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

Polynomial time algorithm for computing the top Betti numbers of semi-algebraic sets defined by quadratic inequalities.
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

Computing the Betti Numbers of Arrangements in Practice.
Proceedings of the Computer Algebra in Scientific Computing, 8th International Workshop, 2005

2004
On the Realizable Weaving Patterns of Polynomial Curves in R<sup>3</sup>.
Proceedings of the Graph Drawing, 12th International Symposium, 2004

2003
Computing the Betti numbers of arrangements via spectral sequences.
J. Comput. Syst. Sci., 2003

Different Bounds on the Different Betti Numbers of Semi-Algebraic Sets.
Discret. Comput. Geom., 2003

The Combinatorial and Topological Complexity of a Single Cell.
Discret. Comput. Geom., 2003

2002
Computing the betti numbers of arrangements.
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

1999
New Results on Quantifier Elimination over Real Closed Fields and Applications to Constraint Databases.
J. ACM, 1999

On Bounding the Betti Numbers and Computing the Euler Characteristic of Semi-Algebraic Sets.
Discret. Comput. Geom., 1999

1998
Complexity of Computing Semi-Algebraic Descriptions of the Connected Components of a Semi-Algebraic Set.
Proceedings of the 1998 International Symposium on Symbolic and Algebraic Computation, 1998

1997
On Computing a Set of Points Meeting Every Cell Defined by a Family of Polynomials on a Variety.
J. Complex., 1997

Uniform Quantifier Elimination and Constraint Query Processing.
Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation, 1997

An Improved Algorithm for Quantifier Elimination Over Real Closed Fields.
Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

1996
Algorithms in Semi-Algabraic Geometry.
PhD thesis, 1996

On the Combinatorial and Algebraic Complexity of Quantifier Elimination.
J. ACM, 1996

Computing Roadmaps of Semi-Algebraic Sets (Extended Abstract).
Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

1994
Design of CAECC-Cellular Automata Based Error Correcting Code.
IEEE Trans. Computers, 1994

1992
A Novel Scheme for Designing Error Correcting Codes Using Cellular Automata.
Proceedings of the Fifth International Conference on VLSI Design, 1992


  Loading...