Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Desh Ranjan
2010 – today
- 2012
[j28]Desh Ranjan, Mohammad Zubair: Vertex isoperimetric parameter of a Computation Graph. Int. J. Found. Comput. Sci. 23(4): 941- (2012)- [j27]Abhishek Biswas, Dong Si, Kamal Al-Nasr, Desh Ranjan, Mohammad Zubair, Jing He: Improved Efficiency in Cryo-EM Secondary Structure Topology Determination from Inaccurate Data. J. Bioinformatics and Computational Biology 10(3) (2012)
- [j26]Desh Ranjan, John E. Savage, Mohammad Zubair: Upper and lower I/O bounds for pebbling r-pyramids. J. Discrete Algorithms 14: 2-12 (2012)
- [c35]Kamal Al-Nasr, Lin Chen, Dong Si, Desh Ranjan, Mohammad Zubair, Jing He: Building the initial chain of the proteins through de novo modeling of the cryo-electron microscopy volume data at the medium resolutions. BCB 2012: 490-497
- 2011
- [j25]Kamal Al-Nasr, Desh Ranjan, Mohammad Zubair, Jing He: Ranking Valid Topologies of the Secondary Structure Elements Using a Constraint Graph. J. Bioinformatics and Computational Biology 9(3): 415-430 (2011)
- [c34]Abhishek Biswas, Dong Si, Kamal Al-Nasr, Desh Ranjan, Mohammad Zubair, Jing He: A Constraint Dynamic Graph Approach to Identify the Secondary Structure Topology from cryoEM Density Data in Presence of Errors. BIBM 2011: 160-163
- [c33]Desh Ranjan, John E. Savage, Mohammad Zubair: Strong I/O Lower Bounds for Binomial and FFT Computation Graphs. COCOON 2011: 134-145
- [c32]Naga Shailaja Dasari, Desh Ranjan, Mohammad Zubair: High performance implementation of planted motif problem using suffix trees. HPCS 2011: 200-206
- 2010
- [c31]Bindu Simon, Champa Sengupta-Gopalan, Pavan K. Yelavarthi, Desh Ranjan: Computational and Biological Approach to Understand the 3' UTR-Mediated Posttranscriptional Regulation of Alfalfa Cytosolic Glutamine Synthetase Genes. BICoB 2010: 103-108
- [c30]Naga Shailaja Dasari, Desh Ranjan, Zubair M: An efficient multicore implementation of planted motif problem. HPCS 2010: 9-15
- [c29]Desh Ranjan, John E. Savage, Mohammad Zubair: Upper and Lower I/O Bounds for Pebbling r-Pyramids. IWOCA 2010: 107-120
2000 – 2009
- 2009
- [c28]Brian Cloteaux, Desh Ranjan: Lower Bounds for Accessing Information on Pure Pointer Machines. FCS 2009: 103-107
- [c27]Inna Pivkina, Desh Ranjan, Jerry Lodder: Historical sources as a teaching tool. SIGCSE 2009: 401-402
- 2007
- [j24]Devdatt P. Dubhashi, Johan Jonasson, Desh Ranjan: Positive Influence and Negative Dependence. Combinatorics, Probability & Computing 16(1): 29-41 (2007)
- [c26]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
- [c25]Tieming Ji, K. Gopavarapu, Desh Ranjan, B. Vasudevan, Champa Sengupta-Gopalan, Mary O'Connell: Tools for Cis-element Recognition and Phylogenetic Tree Construction Based on Conserved Patterns. Computers and Their Applications 2007: 1-6
- 2006
- [j23]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)
- [c24]Brian Cloteaux, Desh Ranjan: Some Separation Results Between Classes of Pointer Algorithms. DCFS 2006: 232-240
- [c23]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
- 2005
- [j22]Frank Harary, Desh Ranjan: Identity orientation of complete bipartite graphs. Discrete Mathematics 290(2/3): 173-182 (2005)
- [j21]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)
- [c22]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
- 2004
- [c21]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
- [j20]Desh Ranjan, Enrico Pontelli: The Level-Ancestor problem on Pure Pointer Machines. Inf. Process. Lett. 85(5): 275-283 (2003)
- [c20]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
- [c19]Yao Wu, Enrico Pontelli, Desh Ranjan: On the Complexity of Dependent And-Parallelism in Logic Programming. ICLP 2003: 361-376
- 2002
- [j19]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)
- [j18]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)
- [c18]Enrico Pontelli, Desh Ranjan, Brook Milligan, Gopal Gupta: F-LOG: A Domain Specific Language for Solving Phylogenetic Inference Problems. CSB 2002: 9-20
- [c17]Alessandro Dal Palù, Enrico Pontelli, Desh Ranjan: An Efficient Parallel Pointer Machine Algorithm for the NCA Problem. IFIP TCS 2002: 157-168
- [c16]
- [c15]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
- [c14]Alessandro Dal Palù, Enrico Pontelli, Desh Ranjan: An Optimal Algorithm for Finding NCA on Pure Pointer Machines. SWAT 2002: 428-438
- 2001
- [c13]Juan Raymundo Iglesias, Gopal Gupta, Enrico Pontelli, Desh Ranjan, Brook Milligan: Interoperability between Bioinformatics Tools: A Logic Programming Approach. PADL 2001: 153-168
- 2000
- [j17]Desh Ranjan, Enrico Pontelli, Gopal Gupta: Data structures for order-sensitive predicates in parallel nondeterministic systems. Acta Inf. 37(1): 21-43 (2000)
- [j16]Desh Ranjan, Enrico Pontelli, Gopal Gupta, Luc Longpré: The Temporal Precedence Problem. Algorithmica 28(3): 288-306 (2000)
1990 – 1999
- 1999
- [j15]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)
- [j14]Desh Ranjan, Enrico Pontelli, Gopal Gupta: On the Complexity of Or-Parallelism. New Generation Comput. 17(3): 285-307 (1999)
- [c12]Srinivas Aluru, Desh Ranjan, Natsuhiko Futamura: A Parallel Monte Carlo Algorithm for Protein Accessible Surface Area Computation. HiPC 1999: 339-348
- 1998
- [j13]Frank Harary, Desh Ranjan: Breaking Symmetry in Complete Graphs by Orienting Edges: Asymptotic Bounds. Inf. Process. Lett. 67(5): 227-230 (1998)
- [j12]Desh Ranjan, Enrico Pontelli, Gopal Gupta: Efficient Algorithms for the Temporal Precedence Problem. Inf. Process. Lett. 68(2): 71-81 (1998)
- [j11]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)
- [j10]Devdatt P. Dubhashi, Desh Ranjan: Balls and bins: A study in negative dependence. Random Struct. Algorithms 13(2): 99-124 (1998)
- [c11]Enrico Pontelli, Desh Ranjan, Gopal Gupta: The Complexity of Late-Binding in Dynamic Object-Oriented Languages. PLILP/ALP 1998: 213-229
- 1997
- [j9]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)
- [c10]Enrico Pontelli, Desh Ranjan, Gopal Gupta: On the Complexity of Parallel Implementation of Logic Programs. FSTTCS 1997: 123-137
- 1996
- [i1]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
- [j8]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)
- [c9]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
- 1994
- [j7]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
- [j6]Desh Ranjan, Suresh Chari, Pankaj Rohatgi: Improving Known Solutions is Hard. Computational Complexity 3: 168-185 (1993)
- [j5]Desh Ranjan, Daniela Rus: A Tool for the Analysis of Manipulation. Inf. Process. Lett. 45(3): 117-121 (1993)
- [j4]Alessandro Panconesi, Desh Ranjan: Quantifiers and Approximation. Theor. Comput. Sci. 107(1): 145-163 (1993)
- [c8]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
- 1992
- [j3]Richard Chang, Suresh Chari, Desh Ranjan, Pankaj Rohatgi: Relativization: a revisionistic retrospective. Bulletin of the EATCS 47: 144-153 (1992)
- [c7]Desh Ranjan, Pankaj Rohatgi: On Randomized Reductions to Sparse Sets. Structure in Complexity Theory Conference 1992: 239-242
- [c6]Suresh Chari, Desh Ranjan, Pankaj Rohatgi: On the Complexity of Incremental Computation. MFCS 1992: 172-180
- 1991
- [j2]Desh Ranjan, Richard Chang, Juris Hartmanis: Space Bounded Computations: Review and New Separation Results. Theor. Comput. Sci. 80(2): 289-302 (1991)
- [c5]
- 1990
- [j1]Juris Hartmanis, Richard Chang, Desh Ranjan, Pankaj Rohatgi: On Unique Staisfiability and Randomized Reductions. Bulletin of the EATCS 41: 166-174 (1990)
- [c4]Alessandro Panconesi, Desh Ranjan: Quantifiers and Approximation (Abstract). Structure in Complexity Theory Conference 1990: 244
- [c3]Alessandro Panconesi, Desh Ranjan: Quantifiers and Approximation (Extended Abstract). STOC 1990: 446-456
- [c2]Juris Hartmanis, Richard Chang, Desh Ranjan, Pankaj Rohatgi: Structural Complexity Theory: recent Surprises. SWAT 1990: 1-12
1980 – 1989
- 1989
- [c1]Juris Hartmanis, Desh Ranjan: Space Bounded Computations: Review And New Separation Results. MFCS 1989: 49-66
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-01-23 20:53 CET by the dblp team