The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Dekel Tsur: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Dekel Tsur
    Tight Bounds for String Reconstruction Using Substring Queries. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2005, pp:448-459 [Conf]
  2. Amihood Amir, Oren Kapah, Dekel Tsur
    Faster Two Dimensional Pattern Matching with Rotations. [Citation Graph (0, 0)][DBLP]
    CPM, 2004, pp:409-419 [Conf]
  3. Carmit Hazay, Moshe Lewenstein, Dekel Tsur
    Two Dimensional Parameterized Matching. [Citation Graph (0, 0)][DBLP]
    CPM, 2005, pp:266-279 [Conf]
  4. Ron Y. Pinter, Oleg Rokhlenko, Dekel Tsur, Michal Ziv-Ukelson
    Approximate Labelled Subtree Homeomorphism. [Citation Graph (0, 0)][DBLP]
    CPM, 2004, pp:59-73 [Conf]
  5. Dekel Tsur, Stephen Tanner, Ebrahim Zandi, Vineet Bafna, Pavel A. Pevzner
    Identification of Post-Translational Modifications via Blind Search of Mass-Spectra. [Citation Graph (0, 0)][DBLP]
    CSB, 2005, pp:157-166 [Conf]
  6. Dekel Tsur
    Sequencing by Hybridization in Few Rounds. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:506-516 [Conf]
  7. Martin Farach-Colton, Gad M. Landau, Süleyman Cenk Sahinalp, Dekel Tsur
    Optimal Spaced Seeds for Faster Approximate String Matching. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:1251-1262 [Conf]
  8. Ron Shamir, Dekel Tsur
    Faster subtree isomorphism. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1997, pp:126-131 [Conf]
  9. Nuno Bandeira, Dekel Tsur, Ari Frank, Pavel A. Pevzner
    A New Approach to Protein Identification. [Citation Graph (0, 0)][DBLP]
    RECOMB, 2006, pp:363-378 [Conf]
  10. Ron Shamir, Dekel Tsur
    Large scale sequencing by hybridization. [Citation Graph (0, 0)][DBLP]
    RECOMB, 2001, pp:269-277 [Conf]
  11. Ron Shamir, Dekel Tsur
    The Maximum Subforest Problem: Approximation and Exact Algorithms (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:394-399 [Conf]
  12. Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat, Dekel Tsur
    Efficient One Dimensional Real Scaled Matching. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2004, pp:1-9 [Conf]
  13. Ron Shamir, Dekel Tsur
    Improved Algorithms for the Random Cluster Graph Model. [Citation Graph (0, 0)][DBLP]
    SWAT, 2002, pp:230-239 [Conf]
  14. Dekel Tsur
    Bounds for Resquencing by Hybridization. [Citation Graph (0, 0)][DBLP]
    WABI, 2003, pp:498-511 [Conf]
  15. Dekel Tsur
    Optimal Probing Patterns for Sequencing by Hybridization. [Citation Graph (0, 0)][DBLP]
    WABI, 2006, pp:366-375 [Conf]
  16. Baruch Awerbuch, Yossi Azar, Yossi Richter, Dekel Tsur
    Tradeoffs in Worst-Case Equilibria. [Citation Graph (0, 0)][DBLP]
    WAOA, 2003, pp:41-52 [Conf]
  17. Ron Shamir, Roded Sharan, Dekel Tsur
    Cluster Graph Modification Problems. [Citation Graph (0, 0)][DBLP]
    WG, 2002, pp:379-390 [Conf]
  18. Ron Shamir, Roded Sharan, Dekel Tsur
    Cluster graph modification problems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:144, n:1-2, pp:173-182 [Journal]
  19. Dekel Tsur
    Tree-edges deletion problems with bounded diameter obstruction sets. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:10, pp:1275-1293 [Journal]
  20. Shirley Halevy, Oded Lachish, Ilan Newman, Dekel Tsur
    Testing Orientation Properties [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:153, pp:- [Journal]
  21. Ron Shamir, Dekel Tsur
    Faster Subtree Isomorphism. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1999, v:33, n:2, pp:267-280 [Journal]
  22. Ron Shamir, Dekel Tsur
    Large Scale Sequencing by Hybridization. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 2002, v:9, n:2, pp:413-428 [Journal]
  23. Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat, Dekel Tsur
    Efficient one-dimensional real scaled matching. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2007, v:5, n:2, pp:205-211 [Journal]
  24. Gilles Didier, Thomas Schmidt, Jens Stoye, Dekel Tsur
    Character sets of strings. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2007, v:5, n:2, pp:330-340 [Journal]
  25. Baruch Awerbuch, Yossi Azar, Yossi Richter, Dekel Tsur
    Tradeoffs in worst-case equilibria. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:361, n:2-3, pp:200-209 [Journal]
  26. Dekel Tsur
    Sequencing by hybridization with errors: handling longer sequences. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:332, n:1-3, pp:559-566 [Journal]
  27. Amihood Amir, Oren Kapah, Dekel Tsur
    Faster two-dimensional pattern matching with rotations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:368, n:3, pp:196-204 [Journal]
  28. Shirley Halevy, Oded Lachish, Ilan Newman, Dekel Tsur
    Testing Properties of Constraint-Graphs. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2007, pp:264-277 [Conf]
  29. Yonatan Aumann, Moshe Lewenstein, Noa Lewenstein, Dekel Tsur
    Finding Witnesses by Peeling. [Citation Graph (0, 0)][DBLP]
    CPM, 2007, pp:28-39 [Conf]
  30. Gad M. Landau, Dekel Tsur, Oren Weimann
    Indexing a Dictionary for Subset Matching Queries. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2007, pp:195-204 [Conf]
  31. Amihood Amir, Tzvika Hartman, Oren Kapah, B. Riva Shalom, Dekel Tsur
    Generalized LCS. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2007, pp:50-61 [Conf]
  32. Martin Farach-Colton, Gad M. Landau, Süleyman Cenk Sahinalp, Dekel Tsur
    Optimal spaced seeds for faster approximate string matching. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2007, v:73, n:7, pp:1035-1044 [Journal]
  33. Dekel Tsur
    Improved scheduling in rings. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2007, v:67, n:5, pp:531-535 [Journal]

  34. Indexing a Dictionary for Subset Matching Queries. [Citation Graph (, )][DBLP]


  35. Fast Algorithms for Computing Tree LCS. [Citation Graph (, )][DBLP]


  36. Fast RNA Structure Alignment for Crossing Input Structures. [Citation Graph (, )][DBLP]


  37. Sparse RNA Folding: Time and Space Efficient Algorithms. [Citation Graph (, )][DBLP]


  38. Reducing the Worst Case Running Times of a Family of RNA and CFG Problems, Using Valiant's Approach. [Citation Graph (, )][DBLP]


  39. Testing Properties of Constraint-Graphs. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002