| Publication | Date of Publication | Type |
|---|
A geometric approach to betweenness
Lecture Notes in Computer Science | 2023-05-08 | Paper |
A high quartet distance construction
Annals of Combinatorics | 2019-06-14 | Paper |
Resilience of general interactive tasks
Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing - PODC '94 | 2017-09-29 | Paper |
Cases in which ancestral maximum likelihood will be confusingly misleading
Journal of Theoretical Biology | 2017-09-08 | Paper |
RSA/Rabin least significant bits are $$ \tfrac{1} {2} + \tfrac{1} {{poly \left( {\log N} \right)}} $$ secure (Extended Abstract)
Advances in cryptology. Proceedings of CRYPTO '84 (a workshop on the theory and application of cryptographic techniques held at the University of California, Santa Barbara, August 19--22, 1984) | 2017-04-10 | Paper |
Do tree split probabilities determine the branch lengths?
Journal of Theoretical Biology | 2016-07-27 | Paper |
Finding a maximum likelihood tree is hard
Journal of the ACM | 2015-12-04 | Paper |
Resiliency of interactive distributed tasks (extended abstracts)
Proceedings of the tenth annual ACM symposium on Principles of distributed computing - PODC '91 | 2015-06-19 | Paper |
Connected Coloring Completion for General Graphs: Algorithms and Complexity
Lecture Notes in Computer Science | 2009-03-06 | Paper |
Analytic solutions of maximum likelihood on forks of four taxa
Mathematical Biosciences | 2007-10-09 | Paper |
Biological Networks: Comparison, Conservation, and Evolutionary Trees
Lecture Notes in Computer Science | 2007-08-30 | Paper |
Analytic solutions for three taxon ML trees with variable rates across sites
Discrete Applied Mathematics | 2007-04-18 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2005-12-08 | Paper |
Research in Computational Molecular Biology
Lecture Notes in Computer Science | 2005-11-23 | Paper |
Research in Computational Molecular Biology
Lecture Notes in Computer Science | 2005-11-23 | Paper |
Tight lower bounds for certain parameterized NP-hard problems
Information and Computation | 2005-10-10 | Paper |
Private information retrieval
Journal of the ACM | 2005-01-25 | Paper |
Analytic Solutions for Three-Taxon MLMC Trees with Variable Rates Across Sites
Lecture Notes in Computer Science | 2003-04-06 | Paper |
On privacy and partition arguments
Information and Computation | 2003-01-14 | Paper |
Tracing traitors
IEEE Transactions on Information Theory | 2002-08-15 | Paper |
On the number of ordered factorizations of natural numbers
Discrete Mathematics | 2001-07-12 | Paper |
| scientific article; zbMATH DE number 1559546 (Why is no real title available?) | 2001-02-28 | Paper |
| scientific article; zbMATH DE number 1261806 (Why is no real title available?) | 2000-04-26 | Paper |
| scientific article; zbMATH DE number 1406785 (Why is no real title available?) | 2000-03-01 | Paper |
Secret Sharing With Public Reconstruction
IEEE Transactions on Information Theory | 1999-11-21 | Paper |
Solvability in Asynchronous Environments II: Finite Interactive Tasks
SIAM Journal on Computing | 1999-10-28 | Paper |
| scientific article; zbMATH DE number 1302377 (Why is no real title available?) | 1999-10-19 | Paper |
| scientific article; zbMATH DE number 708805 (Why is no real title available?) | 1999-08-29 | Paper |
A Geometric Approach to Betweenness
SIAM Journal on Discrete Mathematics | 1998-09-21 | Paper |
| scientific article; zbMATH DE number 1031004 (Why is no real title available?) | 1997-12-01 | Paper |
| scientific article; zbMATH DE number 1024077 (Why is no real title available?) | 1997-07-20 | Paper |
| scientific article; zbMATH DE number 826066 (Why is no real title available?) | 1996-07-04 | Paper |
Communication in key distribution schemes
IEEE Transactions on Information Theory | 1996-06-02 | Paper |
The privacy of dense symmetric functions
Computational Complexity | 1995-08-08 | Paper |
Universally ideal secret-sharing schemes
IEEE Transactions on Information Theory | 1995-07-12 | Paper |
Private Computations over the Integers
SIAM Journal on Computing | 1995-06-27 | Paper |
Privacy, additional information and communication
IEEE Transactions on Information Theory | 1994-10-26 | Paper |
The random oracle hypothesis is false
Journal of Computer and System Sciences | 1994-10-13 | Paper |
On the structure of the privacy hierarchy
Journal of Cryptology | 1994-05-26 | Paper |
Secret sharing over infinite domains
Journal of Cryptology | 1993-08-29 | Paper |
A communication-privacy tradeoff for modular addition
Information Processing Letters | 1993-05-16 | Paper |
On the theory of average case complexity
Journal of Computer and System Sciences | 1992-09-27 | Paper |
A Zero-One Law for Boolean Privacy
SIAM Journal on Discrete Mathematics | 1991-01-01 | Paper |
An improved parallel algorithm for integer GCD
Algorithmica | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4138842 (Why is no real title available?) | 1990-01-01 | Paper |
On the power of two-point based sampling
Journal of Complexity | 1989-01-01 | Paper |
A knapsack-type public key cryptosystem based on arithmetic in finite fields
IEEE Transactions on Information Theory | 1989-01-01 | Paper |
Simple constant-time consensus protocols in realistic failure models
Journal of the ACM | 1989-01-01 | Paper |
Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
SIAM Journal on Computing | 1988-01-01 | Paper |
On the Influence of Single Participant in Coin Flipping Schemes
SIAM Journal on Discrete Mathematics | 1988-01-01 | Paper |
RSA and Rabin Functions: Certain Parts are as Hard as the Whole
SIAM Journal on Computing | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 3954815 (Why is no real title available?) | 1986-01-01 | Paper |
A Knapsack Type Public Key Cryptosystem Based On Arithmetic in Finite Fields (preliminary draft)
Advances in cryptology. Proceedings of CRYPTO '84 (a workshop on the theory and application of cryptographic techniques held at the University of California, Santa Barbara, August 19--22, 1984) | 1985-01-01 | Paper |
