The following pages link to Benny Chor (Q582081):
Displayed 50 items.
- An improved parallel algorithm for integer GCD (Q582082) (← links)
- Analytic solutions for three taxon ML trees with variable rates across sites (Q876473) (← links)
- On the power of two-point based sampling (Q1120201) (← links)
- On the theory of average case complexity (Q1190984) (← links)
- A communication-privacy tradeoff for modular addition (Q1209990) (← links)
- Secret sharing over infinite domains (Q1261017) (← links)
- On the structure of the privacy hierarchy (Q1324758) (← links)
- The random oracle hypothesis is false (Q1333397) (← links)
- The privacy of dense symmetric functions (Q1842776) (← links)
- On privacy and partition arguments (Q1854427) (← links)
- On the number of ordered factorizations of natural numbers (Q1972137) (← links)
- Analytic solutions of maximum likelihood on forks of four taxa (Q2382386) (← links)
- Cases in which ancestral maximum likelihood will be confusingly misleading (Q2402545) (← links)
- A high quartet distance construction (Q2421310) (← links)
- Tight lower bounds for certain parameterized NP-hard problems (Q2568440) (← links)
- Do tree split probabilities determine the branch lengths? (Q2630308) (← links)
- RSA/Rabin least significant bits are $$ \tfrac{1} {2} + \tfrac{1} {{poly \left( {\log N} \right)}} $$ secure (Extended Abstract) (Q2974489) (← links)
- Private information retrieval (Q3158526) (← links)
- Finding a maximum likelihood tree is hard (Q3455214) (← links)
- (Q3471255) (← links)
- Biological Networks: Comparison, Conservation, and Evolutionary Trees (Q3596287) (← links)
- Connected Coloring Completion for General Graphs: Algorithms and Complexity (Q3608833) (← links)
- A Knapsack Type Public Key Cryptosystem Based On Arithmetic in Finite Fields (preliminary draft) (Q3689091) (← links)
- (Q3724235) (← links)
- Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity (Q3787911) (← links)
- RSA and Rabin Functions: Certain Parts are as Hard as the Whole (Q3787913) (← links)
- A knapsack-type public key cryptosystem based on arithmetic in finite fields (Q3816016) (← links)
- On the Influence of Single Participant in Coin Flipping Schemes (Q3826116) (← links)
- Simple constant-time consensus protocols in realistic failure models (Q3830798) (← links)
- A Geometric Approach to Betweenness (Q4210221) (← links)
- (Q4231909) (← links)
- (Q4247678) (← links)
- Solvability in Asynchronous Environments II: Finite Interactive Tasks (Q4268886) (← links)
- Privacy, additional information and communication (Q4307471) (← links)
- (Q4318693) (← links)
- (Q4341771) (← links)
- (Q4343447) (← links)
- (Q4526995) (← links)
- Tracing traitors (Q4545764) (← links)
- Secret Sharing With Public Reconstruction (Q4701164) (← links)
- Analytic Solutions for Three-Taxon MLMC Trees with Variable Rates Across Sites (Q4801154) (← links)
- Private Computations over the Integers (Q4834387) (← links)
- Universally ideal secret-sharing schemes (Q4838633) (← links)
- (Q4858452) (← links)
- Communication in key distribution schemes (Q4879986) (← links)
- (Q4940701) (← links)
- Resiliency of interactive distributed tasks (extended abstracts) (Q5255804) (← links)
- Resilience of general interactive tasks (Q5361407) (← links)
- Research in Computational Molecular Biology (Q5706872) (← links)
- Research in Computational Molecular Biology (Q5706873) (← links)