| 2009 |
|---|
| 51 | EE | Inna Pivkina,
Desh Ranjan,
Jerry Lodder:
Historical sources as a teaching tool.
SIGCSE 2009: 401-402 |
| 2007 |
|---|
| 50 | EE | Tieming Ji,
Desh Ranjan,
Jeanne Curry,
Mary O'Connell:
Computational Identification of Cis-regulatory Elements Associated with Pungency of Chili Peppers.
BIBE 2007: 1188-1192 |
| 49 | | Tieming Ji,
K. Gopavarapu,
Desh Ranjan,
B. Vasudevan,
C. S. Gopalan,
Mary O'Connell:
Tools for Cis-element Recognition and Phylogenetic Tree Construction Based on Conserved Patterns.
Computers and Their Applications 2007: 1-6 |
| 48 | EE | Devdatt P. Dubhashi,
Johan Jonasson,
Desh Ranjan:
Positive Influence and Negative Dependence.
Combinatorics, Probability & Computing 16(1): 29-41 (2007) |
| 2006 |
|---|
| 47 | EE | David Pengelley,
Inna Pivkina,
Desh Ranjan,
Karen Villaverde:
A project in algorithms based on a primary historical source about catalan numbers.
SIGCSE 2006: 318-322 |
| 46 | EE | Alessandro Dal Palù,
Enrico Pontelli,
Desh Ranjan:
Sequential and parallel algorithms for the NCA problem on pure pointer machines.
Theor. Comput. Sci. 352(1-3): 108-135 (2006) |
| 2005 |
|---|
| 45 | EE | Yao Wu,
Enrico Pontelli,
Desh Ranjan:
Computational Issues in Exploiting Dependent And-Parallelism in Logic Programming: Leftness Detection in Dynamic Search Trees.
LPAR 2005: 79-94 |
| 44 | EE | Frank Harary,
Desh Ranjan:
Identity orientation of complete bipartite graphs.
Discrete Mathematics 290(2/3): 173-182 (2005) |
| 43 | EE | Enrico Pontelli,
Desh Ranjan:
A Simple Optimal Solution for the Temporal Precedence Problem on Pure Pointer Machines.
Theory Comput. Syst. 38(1): 115-130 (2005) |
| 2004 |
|---|
| 42 | EE | Jing He,
Desh Ranjan,
Wen Jiang,
Wah Chiu,
Michael F. Schmid:
Detecting Local Symmetry Axis in 3-dimensional Virus Structures.
APBC 2004: 265-270 |
| 2003 |
|---|
| 41 | EE | Tran Cao Son,
Enrico Pontelli,
Desh Ranjan,
Brook Milligan,
Gopal Gupta:
An Agent-based Domain Specific Framework for Rapid Prototyping of Applications in Evolutionary Biology.
DALT 2003: 76-96 |
| 40 | EE | Yao Wu,
Enrico Pontelli,
Desh Ranjan:
On the Complexity of Dependent And-Parallelism in Logic Programming.
ICLP 2003: 361-376 |
| 39 | EE | Desh Ranjan,
Enrico Pontelli:
The Level-Ancestor problem on Pure Pointer Machines.
Inf. Process. Lett. 85(5): 275-283 (2003) |
| 2002 |
|---|
| 38 | EE | Enrico Pontelli,
Desh Ranjan,
Brook Milligan,
Gopal Gupta:
F-LOG: A Domain Specific Language for Solving Phylogenetic Inference Problems.
CSB 2002: 9-20 |
| 37 | | Alessandro Dal Palù,
Enrico Pontelli,
Desh Ranjan:
An Efficient Parallel Pointer Machine Algorithm for the NCA Problem.
IFIP TCS 2002: 157-168 |
| 36 | EE | Enrico Pontelli,
Desh Ranjan:
Ancestor Problems on Pure Pointer Machines.
LATIN 2002: 263-277 |
| 35 | EE | Gopal Gupta,
Hai-Feng Guo,
Arthur I. Karshmer,
Enrico Pontelli,
Juan Raymundo Iglesias,
Desh Ranjan,
Brook Milligan,
Nayana Datta,
Omar El-Khatib,
Mohammed Noamany,
Xinhong Zhou:
Semantics-Based Filtering: Logic Programming's Killer App?
PADL 2002: 82-100 |
| 34 | EE | Alessandro Dal Palù,
Enrico Pontelli,
Desh Ranjan:
An Optimal Algorithm for Finding NCA on Pure Pointer Machines.
SWAT 2002: 428-438 |
| 33 | | Enrico Pontelli,
Desh Ranjan,
Alessandro Dal Palù:
An optimal data structure to handle dynamic environments in non-deterministic computations.
Comput. Lang. 28(2): 181-201 (2002) |
| 32 | EE | Natsuhiko Futamura,
Srinivas Aluru,
Desh Ranjan,
Bhanu Hariharan:
Efficient Parallel Algorithms for Solvent Accessible Surface Area of Proteins.
IEEE Trans. Parallel Distrib. Syst. 13(6): 544-555 (2002) |
| 2001 |
|---|
| 31 | EE | Juan Raymundo Iglesias,
Gopal Gupta,
Enrico Pontelli,
Desh Ranjan,
Brook Milligan:
Interoperability between Bioinformatics Tools: A Logic Programming Approach.
PADL 2001: 153-168 |
| 2000 |
|---|
| 30 | EE | Desh Ranjan,
Enrico Pontelli,
Gopal Gupta:
Data structures for order-sensitive predicates in parallel nondeterministic systems.
Acta Inf. 37(1): 21-43 (2000) |
| 29 | EE | Desh Ranjan,
Enrico Pontelli,
Gopal Gupta,
Luc Longpré:
The Temporal Precedence Problem.
Algorithmica 28(3): 288-306 (2000) |
| 1999 |
|---|
| 28 | | Srinivas Aluru,
Desh Ranjan,
Natsuhiko Futamura:
A Parallel Monte Carlo Algorithm for Protein Accessible Surface Area Computation.
HiPC 1999: 339-348 |
| 27 | | Enrico Pontelli,
Desh Ranjan,
Gopal Gupta:
Complexity Analysis of Late Binding in Dynamic Object-Oriented Languages
Journal of Functional and Logic Programming 1999(Special Issue 2): (1999) |
| 26 | | Desh Ranjan,
Enrico Pontelli,
Gopal Gupta:
On the Complexity of Or-Parallelism.
New Generation Comput. 17(3): 285-307 (1999) |
| 1998 |
|---|
| 25 | EE | Enrico Pontelli,
Desh Ranjan,
Gopal Gupta:
The Complexity of Late-Binding in Dynamic Object-Oriented Languages.
PLILP/ALP 1998: 213-229 |
| 24 | EE | Frank Harary,
Desh Ranjan:
Breaking Symmetry in Complete Graphs by Orienting Edges: Asymptotic Bounds.
Inf. Process. Lett. 67(5): 227-230 (1998) |
| 23 | EE | Desh Ranjan,
Enrico Pontelli,
Gopal Gupta:
Efficient Algorithms for the Temporal Precedence Problem.
Inf. Process. Lett. 68(2): 71-81 (1998) |
| 22 | | Devdatt P. Dubhashi,
Desh Ranjan:
Balls and bins: A study in negative dependence.
Random Struct. Algorithms 13(2): 99-124 (1998) |
| 21 | EE | Bernd Borchert,
Desh Ranjan,
Frank Stephan:
On the Computational Complexity of Some Classical Equivalence Relations on Boolean Functions.
Theory Comput. Syst. 31(6): 679-693 (1998) |
| 1997 |
|---|
| 20 | EE | Enrico Pontelli,
Desh Ranjan,
Gopal Gupta:
On the Complexity of Parallel Implementation of Logic Programs.
FSTTCS 1997: 123-137 |
| 19 | EE | Tetsuo Asano,
Desh Ranjan,
Thomas Roos,
Emo Welzl,
Peter Widmayer:
Space-Filling Curves and Their Use in the Design of Geometric Data Structures.
Theor. Comput. Sci. 181(1): 3-15 (1997) |
| 1996 |
|---|
| 18 | EE | Bernd Borchert,
Desh Ranjan,
Frank Stephan:
On the Computational Complexity of some Classical Equivalence Relations on Boolean Functions
Electronic Colloquium on Computational Complexity (ECCC) 3(33): (1996) |
| 1995 |
|---|
| 17 | | Tetsuo Asano,
Desh Ranjan,
Thomas Roos,
Emo Welzl,
Peter Widmayer:
Space Filling Curves and Their Use in the Design of Geometric Data Structures.
LATIN 1995: 36-48 |
| 16 | EE | Hing Leung,
Desh Ranjan,
Héctor J. Hernández,
D. T. Tang,
Agustin González:
A Simple Proof on the Decidability of Equivalence Between Recursive and Nonrecursive Datalog Programs.
Inf. Process. Lett. 55(5): 279-282 (1995) |
| 1994 |
|---|
| 15 | | Richard Chang,
Benny Chor,
Oded Goldreich,
Juris Hartmanis,
Johan Håstad,
Desh Ranjan,
Pankaj Rohatgi:
The Random Oracle Hypothesis Is False.
J. Comput. Syst. Sci. 49(1): 24-39 (1994) |
| 1993 |
|---|
| 14 | | Devdatt P. Dubhashi,
Kurt Mehlhorn,
Desh Ranjan,
Christian Thiel:
Searching, Sorting and Randomised Algorithms for Central Elements and Ideal Counting in Posets.
FSTTCS 1993: 436-443 |
| 13 | | Desh Ranjan,
Suresh Chari,
Pankaj Rohatgi:
Improving Known Solutions is Hard.
Computational Complexity 3: 168-185 (1993) |
| 12 | | Desh Ranjan,
Daniela Rus:
A Tool for the Analysis of Manipulation.
Inf. Process. Lett. 45(3): 117-121 (1993) |
| 11 | | Alessandro Panconesi,
Desh Ranjan:
Quantifiers and Approximation.
Theor. Comput. Sci. 107(1): 145-163 (1993) |
| 1992 |
|---|
| 10 | | Suresh Chari,
Desh Ranjan,
Pankaj Rohatgi:
On the Complexity of Incremental Computation.
MFCS 1992: 172-180 |
| 9 | | Desh Ranjan,
Pankaj Rohatgi:
On Randomized Reductions to Sparse Sets.
Structure in Complexity Theory Conference 1992: 239-242 |
| 8 | | Richard Chang,
Suresh Chari,
Desh Ranjan,
Pankaj Rohatgi:
Relativization: a revisionistic retrospective.
Bulletin of the EATCS 47: 144-153 (1992) |
| 1991 |
|---|
| 7 | | Desh Ranjan,
Suresh Chari,
Pankaj Rohatgi:
Improving Known Solutions is Hard.
ICALP 1991: 381-392 |
| 6 | | Desh Ranjan,
Richard Chang,
Juris Hartmanis:
Space Bounded Computations: Review and New Separation Results.
Theor. Comput. Sci. 80(2): 289-302 (1991) |
| 1990 |
|---|
| 5 | | Alessandro Panconesi,
Desh Ranjan:
Quantifiers and Approximation (Extended Abstract)
STOC 1990: 446-456 |
| 4 | | Juris Hartmanis,
Richard Chang,
Desh Ranjan,
Pankaj Rohatgi:
Structural Complexity Theory: recent Surprises.
SWAT 1990: 1-12 |
| 3 | | Alessandro Panconesi,
Desh Ranjan:
Quantifiers and Approximation (Abstract).
Structure in Complexity Theory Conference 1990: 244 |
| 2 | | Juris Hartmanis,
Richard Chang,
Desh Ranjan,
Pankaj Rohatgi:
On Unique Staisfiability and Randomized Reductions.
Bulletin of the EATCS 41: 166-174 (1990) |
| 1989 |
|---|
| 1 | | Juris Hartmanis,
Desh Ranjan:
Space Bounded Computations: Review And New Separation Results.
MFCS 1989: 49-66 |
