The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Benny Chor: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Benny Chor, Charles E. Leiserson, Ronald L. Rivest, James B. Shearer
    An application of number theory to the organization of raster-graphics memory. [Citation Graph (4, 0)][DBLP]
    J. ACM, 1986, v:33, n:1, pp:86-104 [Journal]
  2. Shai Ben-David, Benny Chor, Oded Goldreich, Michael Luby
    On the Theory of Average Case Complexity (abstract). [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1989, pp:36- [Conf]
  3. Reuven Bar-Yehuda, Benny Chor, Eyal Kushilevitz
    Privacy, Additional Information, and Communication. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1990, pp:55-65 [Conf]
  4. Jianer Chen, Benny Chor, Mike Fellows, Xiuzhen Huang, David W. Juedes, Iyad A. Kanj, Ge Xia
    Tight Lower Bounds for Certain Parameterized NP-Hard Problems. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2004, pp:150-160 [Conf]
  5. Amos Beimel, Benny Chor
    Universally Ideal Secret Sharing Schemes (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1992, pp:183-195 [Conf]
  6. Amos Beimel, Benny Chor
    Interaction in Key Distribution Schemes (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1993, pp:444-455 [Conf]
  7. Amos Beimel, Benny Chor
    Secret Sharing with Public Reconstruction (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1995, pp:353-366 [Conf]
  8. Benny Chor, Amos Fiat, Moni Naor
    Tracing Traitors. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1994, pp:257-270 [Conf]
  9. Benny Chor, Oded Goldreich, Shafi Goldwasser
    The Bit Security of Modular Squaring Given Partial Factorization of the Modulos. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1985, pp:448-457 [Conf]
  10. Benny Chor, Eyal Kushilevitz
    Secret Sharing Over Infinite Domains (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1989, pp:299-306 [Conf]
  11. Benny Chor, Ronald L. Rivest
    A Knapsack Type Public Key Cryptosystem Based On Arithmetic in Finite Fields. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1984, pp:54-65 [Conf]
  12. Benny Chor, Oded Goldreich
    RSA/Rabin Least Significant Bits are 1/2 + 1/(poly(log N)) Secure. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1984, pp:303-313 [Conf]
  13. Benny Chor, Madhu Sudan
    A Geometric Approach to Betweenness. [Citation Graph (0, 0)][DBLP]
    ESA, 1995, pp:227-237 [Conf]
  14. Werner Alexi, Benny Chor, Oded Goldreich, Claus-Peter Schnorr
    RSA/Rabin Bits are 1/2 + 1/poly(log N) Secure [Citation Graph (0, 0)][DBLP]
    FOCS, 1984, pp:449-457 [Conf]
  15. Benny Chor, Oded Goldreich
    Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1985, pp:429-442 [Conf]
  16. Benny Chor, Oded Goldreich, Johan Håstad, Joel Friedman, Steven Rudich, Roman Smolensky
    The Bit Extraction Problem of t-Resilient Functions (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1985, pp:396-407 [Conf]
  17. Benny Chor, Mihály Geréb-Graus, Eyal Kushilevitz
    Private Computations Over the Integers (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:335-344 [Conf]
  18. Benny Chor, Oded Goldreich, Eyal Kushilevitz, Madhu Sudan
    Private Information Retrieval. [Citation Graph (0, 0)][DBLP]
    FOCS, 1995, pp:41-50 [Conf]
  19. Benny Chor, Shafi Goldwasser, Silvio Micali, Baruch Awerbuch
    Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1985, pp:383-395 [Conf]
  20. Benny Chor, Charles E. Leiserson, Ronald L. Rivest
    An Application of Number Theory to the Organization of Raster-Graphics Memory (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:92-99 [Conf]
  21. Benny Chor, Lior Moscovici
    Solvability in Asynchronous Environments (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:422-427 [Conf]
  22. Benny Chor, Tamir Tuller
    Maximum likelihood of evolutionary trees: hardness and approximation. [Citation Graph (0, 0)][DBLP]
    ISMB (Supplement of Bioinformatics), 2005, pp:97-106 [Conf]
  23. Benny Chor, Yuval Ishai
    On Privacy and Partition Arguments. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1996, pp:191-194 [Conf]
  24. Benny Chor, Amos Israeli, Ming Li
    On Processor Coordination Using Asynchronous Hardware. [Citation Graph (0, 0)][DBLP]
    PODC, 1987, pp:86-97 [Conf]
  25. Benny Chor, Michael Merritt, David B. Shmoys
    Simple Constant-Time Consensus Protocols in Realistic Failure Models (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 1985, pp:152-162 [Conf]
  26. Benny Chor, Lee-Bath Nelson
    Resiliency of Interactive Distributed Tasks (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 1991, pp:37-49 [Conf]
  27. Benny Chor, Lee-Bath Nelson
    Resilience of General Interactive Tasks. [Citation Graph (0, 0)][DBLP]
    PODC, 1994, pp:173-182 [Conf]
  28. Benny Chor, Michael O. Rabin
    Achieving Independence in Logarithmic Number of Rounds. [Citation Graph (0, 0)][DBLP]
    PODC, 1987, pp:260-268 [Conf]
  29. Amir Ben-Dor, Benny Chor
    On constructing radiation hybrid maps (extended abstract). [Citation Graph (0, 0)][DBLP]
    RECOMB, 1997, pp:17-26 [Conf]
  30. David Burstein, Igor Ulitsky, Tamir Tuller, Benny Chor
    Information Theoretic Approaches to Whole Genome Phylogenies. [Citation Graph (0, 0)][DBLP]
    RECOMB, 2005, pp:283-295 [Conf]
  31. Amir Ben-Dor, Benny Chor, Dan Graur, Ron Ophir, Dan Pelleg
    From four-taxon trees to phylogenies (preliminary report): the case of mammalian evolution. [Citation Graph (0, 0)][DBLP]
    RECOMB, 1998, pp:9-19 [Conf]
  32. Amir Ben-Dor, Benny Chor, Richard M. Karp, Zohar Yakhini
    Discovering local structure in gene expression data: the order-preserving submatrix problem. [Citation Graph (0, 0)][DBLP]
    RECOMB, 2002, pp:49-57 [Conf]
  33. Benny Chor, Michael D. Hendy, Barbara R. Holland, David Penny
    Multiple maxima of likelihood in phylogenetic trees: an analytic approach. [Citation Graph (0, 0)][DBLP]
    RECOMB, 2000, pp:108-117 [Conf]
  34. Benny Chor, Amit Khetan, Sagi Snir
    Maximum likelihood on four taxa phylogenetic trees: analytic solutions. [Citation Graph (0, 0)][DBLP]
    RECOMB, 2003, pp:76-83 [Conf]
  35. Benny Chor, Tamir Tuller
    Maximum Likelihood of Evolutionary Trees Is Hard. [Citation Graph (0, 0)][DBLP]
    RECOMB, 2005, pp:296-310 [Conf]
  36. Benny Chor, Tamir Tuller
    Biological Networks: Comparison, Conservation, and Evolutionary Trees. [Citation Graph (0, 0)][DBLP]
    RECOMB, 2006, pp:30-44 [Conf]
  37. Benny Chor
    From Quartets to Phylogenetic Trees. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 1998, pp:36-53 [Conf]
  38. Benny Chor, Brian A. Coan
    A Simple and Efficient Randomized Byzantine Agreement Algorithm. [Citation Graph (0, 0)][DBLP]
    Symposium on Reliability in Distributed Software and Database Systems, 1984, pp:98-106 [Conf]
  39. Shai Ben-David, Benny Chor, Oded Goldreich, Michael Luby
    On the Theory of Average Case Complexity [Citation Graph (0, 0)][DBLP]
    STOC, 1989, pp:204-216 [Conf]
  40. Michael Ben-Or, Benny Chor, Adi Shamir
    On the Cryptographic Security of Single RSA Bits [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:421-430 [Conf]
  41. Benny Chor, Niv Gilboa
    Computationally Private Information Retrieval (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 1997, pp:304-313 [Conf]
  42. Benny Chor, Eyal Kushilevitz
    A Zero-One Law for Boolean Privacy (extended abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1989, pp:62-72 [Conf]
  43. Louigi Addario-Berry, Benny Chor, Michael T. Hallett, Jens Lagergren, Alessandro Panconesi, Todd Wareham
    Ancestral Maximum Likelihood of Evolutionary Trees Is Hard. [Citation Graph (0, 0)][DBLP]
    WABI, 2003, pp:202-215 [Conf]
  44. Benny Chor, Michael D. Hendy, David Penny
    Analytic Solutions for Three-Taxon MLMC Trees with Variable Rates Across Sites. [Citation Graph (0, 0)][DBLP]
    WABI, 2001, pp:204-213 [Conf]
  45. Benny Chor, Tamir Tuller
    Adding Hidden Nodes to Gene Networks (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WABI, 2004, pp:123-134 [Conf]
  46. Tamir Tuller, Efrat Oron, Erez Makavy, Daniel A. Chamovitz, Benny Chor
    Time-Window Analysis of Developmental Gene Expression Data with Multiple Genetic Backgrounds. [Citation Graph (0, 0)][DBLP]
    WABI, 2005, pp:53-64 [Conf]
  47. Benny Chor, Mike Fellows, David W. Juedes
    Linear Kernels in Linear Time, or How to Save k Colors in O(n2) Steps. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:257-269 [Conf]
  48. Benny Chor, Oded Goldreich
    An Improved Parallel Algorithm for Integer GCD. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1990, v:5, n:1, pp:1-10 [Journal]
  49. Matan Gavish, Amnon Peled, Benny Chor
    Genetic code symmetry and efficient design of GC-constrained coding sequences. [Citation Graph (0, 0)][DBLP]
    Bioinformatics, 2007, v:23, n:2, pp:57-63 [Journal]
  50. Benny Chor, Netta Shani
    The Privacy of Dense Symmetric Functions. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1995, v:5, n:1, pp:43-59 [Journal]
  51. Benny Chor, Michael D. Hendy, David Penny
    Analytic solutions for three taxon ML trees with variable rates across sites. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:6-7, pp:750-758 [Journal]
  52. Benny Chor, Paul Lemke, Ziv Mador
    On the number of ordered factorizations of natural numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:214, n:1-3, pp:123-133 [Journal]
  53. Jianer Chen, Benny Chor, Mike Fellows, Xiuzhen Huang, David W. Juedes, Iyad A. Kanj, Ge Xia
    Tight lower bounds for certain parameterized NP-hard problems. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2005, v:201, n:2, pp:216-231 [Journal]
  54. Benny Chor, Yuval Ishai
    On Privacy and Partition Arguments. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2001, v:167, n:1, pp:2-9 [Journal]
  55. Benny Chor, Eyal Kushilevitz
    A Communication-Privacy Tradeoff for Modular Addition. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:45, n:4, pp:205-210 [Journal]
  56. Benny Chor, Eyal Kushilevitz, Oded Goldreich, Madhu Sudan
    Private Information Retrieval. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1998, v:45, n:6, pp:965-981 [Journal]
  57. Benny Chor, Michael Merritt, David B. Shmoys
    Simple constant-time consensus protocols in realistic failure models. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1989, v:36, n:3, pp:591-614 [Journal]
  58. Benny Chor, Tamir Tuller
    Finding a maximum likelihood tree is hard. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2006, v:53, n:5, pp:722-744 [Journal]
  59. Louigi Addario-Berry, Benny Chor, Michael T. Hallett, Jens Lagergren, Alessandro Panconesi, Todd Wareham
    Ancestral Maximum Likelihood of Evolutionary Trees Is Hard. [Citation Graph (0, 0)][DBLP]
    J. Bioinformatics and Computational Biology, 2004, v:2, n:2, pp:257-272 [Journal]
  60. Benny Chor, Oded Goldreich
    On the power of two-point based sampling. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1989, v:5, n:1, pp:96-106 [Journal]
  61. Amir Ben-Dor, Benny Chor
    On Constructing Radiation Hybrid Maps. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 1997, v:4, n:4, pp:517-534 [Journal]
  62. Amir Ben-Dor, Benny Chor, Dan Graur, Ron Ophir, Dan Pelleg
    Constructing Phylogenies from Quartets: Elucidation of Eutherian Superordinal Relationships. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 1998, v:5, n:3, pp:377-390 [Journal]
  63. Amir Ben-Dor, Benny Chor, Richard M. Karp, Zohar Yakhini
    Discovering Local Structure in Gene Expression Data: The Order-Preserving Submatrix Problem. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 2003, v:10, n:3/4, pp:373-384 [Journal]
  64. Shai Ben-David, Benny Chor, Oded Goldreich, Michael Luby
    On the Theory of Average Case Complexity. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1992, v:44, n:2, pp:193-219 [Journal]
  65. Richard Chang, Benny Chor, Oded Goldreich, Juris Hartmanis, Johan Håstad, Desh Ranjan, Pankaj Rohatgi
    The Random Oracle Hypothesis Is False. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1994, v:49, n:1, pp:24-39 [Journal]
  66. Benny Chor, Eyal Kushilevitz
    Secret Sharing Over Infinite Domains. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 1993, v:6, n:2, pp:87-95 [Journal]
  67. Benny Chor, Mihály Geréb-Graus, Eyal Kushilevitz
    On the Structure of the Privacy Hierarchy. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 1994, v:7, n:1, pp:53-60 [Journal]
  68. Werner Alexi, Benny Chor, Oded Goldreich, Claus-Peter Schnorr
    RSA and Rabin Functions: Certain Parts are as Hard as the Whole. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:2, pp:194-209 [Journal]
  69. Benny Chor, Oded Goldreich
    Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:2, pp:230-261 [Journal]
  70. Benny Chor, Mihály Geréb-Graus, Eyal Kushilevitz
    Private Computations over the Integers. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:2, pp:376-386 [Journal]
  71. Benny Chor, Amos Israeli, Ming Li
    Wait-Free Consensus Using Asynchronous Hardware. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:4, pp:701-712 [Journal]
  72. Benny Chor, Lee-Bath Nelson
    Solvability in Asynchronous Environments II: Finite Interactive Tasks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:2, pp:351-377 [Journal]
  73. Benny Chor, Mihály Geréb-Graus
    On the Influence of Single Participant in Coin Flipping Schemes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1988, v:1, n:4, pp:411-415 [Journal]
  74. Benny Chor, Eyal Kushilevitz
    A Zero-One Law for Boolean Privacy. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1991, v:4, n:1, pp:36-47 [Journal]
  75. Benny Chor, Madhu Sudan
    A Geometric Approach to Betweenness. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1998, v:11, n:4, pp:511-523 [Journal]
  76. Reuven Bar-Yehuda, Benny Chor, Eyal Kushilevitz, Alon Orlitsky
    Privacy, additional information and communication. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:6, pp:1930-1943 [Journal]
  77. Amos Beimel, Benny Chor
    Universally ideal secret-sharing schemes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1994, v:40, n:3, pp:786-794 [Journal]
  78. Amos Beimel, Benny Chor
    Communication in key distribution schemes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:1, pp:19-28 [Journal]
  79. Amos Beimel, Benny Chor
    Secret Sharing with Public Reconstruction. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1998, v:44, n:5, pp:1887-1896 [Journal]
  80. Benny Chor, Amos Fiat, Moni Naor, Benny Pinkas
    Tracing traitors. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:3, pp:893-910 [Journal]
  81. Benny Chor, Ronald L. Rivest
    A knapsack-type public key cryptosystem based on arithmetic in finite fields. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:5, pp:901-909 [Journal]
  82. Benny Chor, Brian A. Coan
    A Simple and Efficient Randomized Byzantine Agreement Algorithm. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Software Eng., 1985, v:11, n:6, pp:531-539 [Journal]
  83. Benny Chor, Michael R. Fellows, Mark A. Ragan, Igor Razgon, Frances A. Rosamond, Sagi Snir
    Connected Coloring Completion for General Graphs: Algorithms and Complexity. [Citation Graph (0, 0)][DBLP]
    COCOON, 2007, pp:75-85 [Conf]

  84. Genomic DNA k-mer Spectra: Models and Modalities. [Citation Graph (, )][DBLP]


Search in 0.198secs, Finished in 0.200secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002