Searching for authors named "Desh Ranjan" – sorted by Relevance.
-
Introduction Counting Triangulations of a Convex Polygon
- Introduction Counting Triangulations of a Convex Polygon Desh Ranjan ∗† In a 1751 letter
- Add To MetaCart
-
The Circuit Subfunction Relations are Σ p 2-complete
- The Circuit Subfunction Relations are Σ p 2-complete Bernd Borchert Desh Ranjan Abstract We show
- Add To MetaCart
-
Balls and Bins: A Study in Negative Dependence
- Dubhashi Desh Ranjan BRICS Report Series RS-96-25 ISSN 0909-0878 July 1996 Copyright c fl 1996, BRICS
- Cited by 18 (2 self) – Add To MetaCart
-
On IP = PSPACE and Theorems with Narrow Proofs
- On IP = PSPACE and Theorems with Narrow Proofs Juris Hartmanis Richard Chang y Desh Ranjan z
- Add To MetaCart
-
On the Complexity of Or-Parallelism
- On the Complexity of Or-Parallelism 1 On the Complexity of Or-Parallelism Desh RANJAN and Enrico
- Cited by 8 (8 self) – Add To MetaCart
-
Space Bounded Computations: Review And New Separation Results
- Space Bounded Computations: Review And New Separation Results Desh Ranjan Richard Chang Juris
- Cited by 3 (0 self) – Add To MetaCart
-
Negative Dependence Through the FKG Inequality
- Dubhashi Volker Priebe Desh Ranjan BRICS Report Series RS-96-27 ISSN 0909-0878 July 1996 Copyright c fl
- Cited by 1 (1 self) – Add To MetaCart
-
On IP=PSPACE and theorems with narrow proofs
- On IP = PSPACE and Theorems with Narrow Proofs ∗ Juris Hartmanis Richard Chang † Desh Ranjan
- Cited by 1 (0 self) – Add To MetaCart
-
A Project in Algorithms based on a Primary Historical Source about Catalan Numbers
- Pengelley Dept. Math. Sci. New Mexico State University Las Cruces, NM 88003 davidp@(email omitted); Desh Ranjan Dept
- Cited by 1 (1 self) – Add To MetaCart
-
Efficient parallel algorithms for solvent accessible surface area of proteins
- ∗ , Srinivas Aluru, Member, IEEE † , Desh Ranjan ‡ , and Bhanu Hariharan § Abstract We present faster
- Cited by 2 (1 self) – Add To MetaCart

