The SCEAS System
| |||||||

## Search the dblp DataBase
Saugata Basu:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Saugata Basu, Michael Kettner
**Computing the Betti Numbers of Arrangements in Practice.**[Citation Graph (0, 0)][DBLP] CASC, 2005, pp:13-31 [Conf] - Saugata Basu, Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton
**Polynomials That Sign Represent Parity and Descartes Rule of Signs.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2004, pp:223-235 [Conf] - Saugata Basu
**Different bounds on the different Betti numbers of semi-algebraic sets.**[Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 2001, pp:288-292 [Conf] - Saugata Basu
**An Improved Algorithm for Quantifier Elimination Over Real Closed Fields.**[Citation Graph (0, 0)][DBLP] FOCS, 1997, pp:56-65 [Conf] - Saugata Basu
**On the Combinatorial and Topological Complexity of a Single Cell.**[Citation Graph (0, 0)][DBLP] FOCS, 1998, pp:606-616 [Conf] - Saugata Basu, Richard Pollack, Marie-Françoise Roy
**On the Combinatorial and Algebraic Complexity of Quantifier Elimination**[Citation Graph (0, 0)][DBLP] FOCS, 1994, pp:632-641 [Conf] - Saugata Basu, Raghavan Dhandapani, Richard Pollack
**On the Realizable Weaving Patterns of Polynomial Curves in R**[Citation Graph (0, 0)][DBLP]^{3}. Graph Drawing, 2004, pp:36-42 [Conf] - Saugata Basu
**Uniform Quantifier Elimination and Constraint Query Processing.**[Citation Graph (0, 0)][DBLP] ISSAC, 1997, pp:21-27 [Conf] - Saugata Basu, Richard Pollack, Marie-Françoise Roy
**Complexity of Computing Semi-Algebraic Descriptions of the Connected Components of a Semi-Algebraic Set.**[Citation Graph (0, 0)][DBLP] ISSAC, 1998, pp:25-29 [Conf] - Saugata Basu
**Computing the betti numbers of arrangements.**[Citation Graph (0, 0)][DBLP] STOC, 2002, pp:712-720 [Conf] - Saugata Basu
**Polynomial time algorithm for computing the top Betti numbers of semi-algebraic sets defined by quadratic inequalities.**[Citation Graph (0, 0)][DBLP] STOC, 2005, pp:313-322 [Conf] - Saugata Basu
**On Bounding the Betti Numbers and Computing the Euler Characteristic of Semi-Algebraic Sets.**[Citation Graph (0, 0)][DBLP] STOC, 1996, pp:408-417 [Conf] - Saugata Basu, Richard Pollack, Marie-Françoise Roy
**Computing the first Betti number and the connected components of semi-algebraic sets.**[Citation Graph (0, 0)][DBLP] STOC, 2005, pp:304-312 [Conf] - Saugata Basu, Richard Pollack, Marie-Françoise Roy
**Computing Roadmaps of Semi-Algebraic Sets (Extended Abstract).**[Citation Graph (0, 0)][DBLP] STOC, 1996, pp:168-173 [Conf] - Saugata Basu
**Efficient algorithm for computing the Euler-Poincaré characteristic of a semi-algebraic set defined by few quadratic inequalities.**[Citation Graph (0, 0)][DBLP] Computational Complexity, 2006, v:15, n:3, pp:236-251 [Journal] - Saugata Basu, Richard Pollack, Marie-Françoise Roy
**Computing the euler-poincaré characteristics of sign conditions.**[Citation Graph (0, 0)][DBLP] Computational Complexity, 2005, v:14, n:1, pp:53-71 [Journal] - Saugata Basu
**The Combinatorial and Topological Complexity of a Single Cell.**[Citation Graph (0, 0)][DBLP] Discrete & Computational Geometry, 2003, v:29, n:1, pp:41-59 [Journal] - Saugata Basu
**Different Bounds on the Different Betti Numbers of Semi-Algebraic Sets.**[Citation Graph (0, 0)][DBLP] Discrete & Computational Geometry, 2003, v:30, n:1, pp:65-85 [Journal] - Saugata Basu
**On Bounding the Betti Numbers and Computing the Euler Characteristic of Semi-Algebraic Sets.**[Citation Graph (0, 0)][DBLP] Discrete & Computational Geometry, 1999, v:22, n:1, pp:1-18 [Journal] - Saugata Basu
**New Results on Quantifier Elimination over Real Closed Fields and Applications to Constraint Databases.**[Citation Graph (0, 0)][DBLP] J. ACM, 1999, v:46, n:4, pp:537-555 [Journal] - Saugata Basu, Richard Pollack, Marie-Françoise Roy
**On the Combinatorial and Algebraic Complexity of Quantifier Elimination.**[Citation Graph (0, 0)][DBLP] J. ACM, 1996, v:43, n:6, pp:1002-1045 [Journal] - 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.**[Citation Graph (0, 0)][DBLP] J. Complexity, 1997, v:13, n:1, pp:28-37 [Journal] - Saugata Basu
**Computing the Betti numbers of arrangements via spectral sequences.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2003, v:67, n:2, pp:244-262 [Journal] - Saugata Basu
**Computing the first few Betti numbers of semi-algebraic sets in single exponential time.**[Citation Graph (0, 0)][DBLP] J. Symb. Comput., 2006, v:41, n:10, pp:1125-1154 [Journal] - Dipanwita Roy Chowdhury, Saugata Basu, Idranil Sen Gupta, Parimal Pal Chaudhuri
**Design of CAECC-Cellular Automata Based Error Correcting Code.**[Citation Graph (0, 0)][DBLP] IEEE Trans. Computers, 1994, v:43, n:6, pp:759-764 [Journal] - Saugata Basu
**Combinatorial complexity in O-minimal geometry.**[Citation Graph (0, 0)][DBLP] STOC, 2007, pp:47-56 [Conf] - Saugata Basu, Richard Pollack, Marie-Françoise Roy
**Computing the First Betti Numberand Describing the Connected Components of Semi-algebraic Sets**[Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal] - Saugata Basu, Richard Pollack, Marie-Françoise Roy
**An asymptotically tight bound on the number of connected components of realizable sign conditions**[Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal] - Saugata Basu
**Computing the Top Betti Numbers of Semi-algebraic Sets Defined by Quadratic Inequalities in Polynomial Time**[Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal] - Saugata Basu
**Computing the First Few Betti Numbers of Semi-algebraic Sets in Single Exponential Time**[Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal] - Saugata Basu
**Efficient algorithm for computing the Euler-Poincaré characteristic of a semi-algebraic set defined by few quadratic inequalities**[Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal] - Saugata Basu
**Algorithmic Semi-algebraic Geometry and Topology -- Recent Progress and Open Problems**[Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal] - Saugata Basu, Dmitrii V. Pasechnik, Marie-Françoise Roy
**Betti numbers of semi-algebraic sets defined by partly quadratic systems of polynomials**[Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal] **Polynomial Hierarchy, Betti Numbers and a Real Analogue of Toda's Theorem.**[Citation Graph (, )][DBLP]**Polynomials that Sign Represent Parity and Descartes' Rule of Signs.**[Citation Graph (, )][DBLP]**Polynomial hierarchy, Betti numbers and a real analogue of Toda's theorem**[Citation Graph (, )][DBLP]**A bound on the minimum of a real positive polynomial over the standard simplex**[Citation Graph (, )][DBLP]**Bounding the radii of balls meeting every connected component of semi-algebraic sets**[Citation Graph (, )][DBLP]**A complex analogue of Toda's Theorem**[Citation Graph (, )][DBLP]**On Projections of Semi-Algebraic Sets Defined by Few Quadratic Inequalities.**[Citation Graph (, )][DBLP]**A Sharper Estimate on the Betti Numbers of Sets Defined by Quadratic Inequalities.**[Citation Graph (, )][DBLP]**On the Number of Topological Types Occurring in a Parameterized Family of Arrangements.**[Citation Graph (, )][DBLP]
Search in 0.104secs, Finished in 0.105secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |