Benny Chor

Available identifiers

zbMath Open chor.bennyWikidataQ102121525 ScholiaQ102121525MaRDI QIDQ582081

List of research outcomes

Publication	Date of Publication	Type
A geometric approach to betweenness	2023-05-08	Paper
A high quartet distance construction	2019-06-14	Paper
Resilience of general interactive tasks	2017-09-29	Paper
Cases in which ancestral maximum likelihood will be confusingly misleading	2017-09-08	Paper
RSA/Rabin least significant bits are $$ \tfrac{1} {2} + \tfrac{1} {{poly \left( {\log N} \right)}} $$ secure (Extended Abstract)	2017-04-10	Paper
Do tree split probabilities determine the branch lengths?	2016-07-27	Paper
Finding a maximum likelihood tree is hard	2015-12-04	Paper
Resiliency of interactive distributed tasks (extended abstracts)	2015-06-19	Paper
Connected Coloring Completion for General Graphs: Algorithms and Complexity	2009-03-06	Paper
Analytic solutions of maximum likelihood on forks of four taxa	2007-10-09	Paper
Biological Networks: Comparison, Conservation, and Evolutionary Trees	2007-08-30	Paper
Analytic solutions for three taxon ML trees with variable rates across sites	2007-04-18	Paper
Graph-Theoretic Concepts in Computer Science	2005-12-08	Paper
Research in Computational Molecular Biology	2005-11-23	Paper
Research in Computational Molecular Biology	2005-11-23	Paper
Tight lower bounds for certain parameterized NP-hard problems	2005-10-10	Paper
Private information retrieval	2005-01-25	Paper
Analytic Solutions for Three-Taxon MLMC Trees with Variable Rates Across Sites	2003-04-06	Paper
On privacy and partition arguments	2003-01-14	Paper
Tracing traitors	2002-08-15	Paper
On the number of ordered factorizations of natural numbers	2001-07-12	Paper
https://portal.mardi4nfdi.de/entity/Q4526995	2001-02-28	Paper
https://portal.mardi4nfdi.de/entity/Q4231909	2000-04-26	Paper
https://portal.mardi4nfdi.de/entity/Q4940701	2000-03-01	Paper
Secret Sharing With Public Reconstruction	1999-11-21	Paper
Solvability in Asynchronous Environments II: Finite Interactive Tasks	1999-10-28	Paper
https://portal.mardi4nfdi.de/entity/Q4247678	1999-10-19	Paper
https://portal.mardi4nfdi.de/entity/Q4318693	1999-08-29	Paper
A Geometric Approach to Betweenness	1998-09-21	Paper
https://portal.mardi4nfdi.de/entity/Q4343447	1997-12-01	Paper
https://portal.mardi4nfdi.de/entity/Q4341771	1997-07-20	Paper
https://portal.mardi4nfdi.de/entity/Q4858452	1996-07-04	Paper
Communication in key distribution schemes	1996-06-02	Paper
The privacy of dense symmetric functions	1995-08-08	Paper
Universally ideal secret-sharing schemes	1995-07-12	Paper
Private Computations over the Integers	1995-06-27	Paper
Privacy, additional information and communication	1994-10-26	Paper
The random oracle hypothesis is false	1994-10-13	Paper
On the structure of the privacy hierarchy	1994-05-26	Paper
Secret sharing over infinite domains	1993-08-29	Paper
A communication-privacy tradeoff for modular addition	1993-05-16	Paper
On the theory of average case complexity	1992-09-27	Paper
A Zero-One Law for Boolean Privacy	1991-01-01	Paper
An improved parallel algorithm for integer GCD	1990-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3471255	1990-01-01	Paper
On the power of two-point based sampling	1989-01-01	Paper
A knapsack-type public key cryptosystem based on arithmetic in finite fields	1989-01-01	Paper
Simple constant-time consensus protocols in realistic failure models	1989-01-01	Paper
Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity	1988-01-01	Paper
RSA and Rabin Functions: Certain Parts are as Hard as the Whole	1988-01-01	Paper
On the Influence of Single Participant in Coin Flipping Schemes	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3724235	1986-01-01	Paper
A Knapsack Type Public Key Cryptosystem Based On Arithmetic in Finite Fields (preliminary draft)	1985-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Benny Chor