 |
 |
Efficient Watermark Detection and Collusion Security.
Francis Zane. Proceedings of Financial Cryptography 2000.
February 2000.
|
 |
 |
Watermarking Maps: Hiding Information in Structured Data.
Sanjeev Khanna and Francis Zane. Proceedings of the 11th Annual
ACM-SIAM Symposium on Discrete Algorithms.
January 2000, San Francisco, CA. To appear.
|
 |
 |
Circuits, CNFs, and Satisfiability
Francis Zane. PhD Thesis, Dept. of Computer Science and Engineering,
UCSD. 1998.
|
 |
 |
An Improved Exponential-time Algorithm for k-SAT.
Ramamohan Paturi, Pavel Pudlak, Michael E. Saks, and Francis Zane.
Proceedings of the 39th Annual Symposium on Foundations of Computer Science.
November 1998, Palo Alto, CA. pp. 628-637.
|
 |
 |
Which Problems Have Strongly Exponential Complexity?.
Russell Impagliazzo, Ramamohan Paturi, and Francis Zane.
Proceedings of the 39th Annual Symposium on Foundations of Computer Science.
November 1998, Palo Alto, CA. pp. 653-662.
|
 |
 |
Resistance of Digital Fingerprints to Collusional Attacks.
Joe Kilian, F. Thomson Leighton, Lesley R. Matheson, Talal G. Shamoon, Robert E. Tarjan, and Francis Zane.
Proceedings of 1998 IEEE International Symposium on Information Theory.
Cambridge, MA, 16-21 August 1998. p. 271.
|
|
 |
Full version available as:
Resistance of Digital Watermarks to Collusive Attacks.
Princeton Computer Science Technical Report TR-585-98.
|
 |
 |
Robustness and Security of Digital Watermarks.
Lesley R. Matheson, Stephen G. Mitchell, Talal G. Shamoon, Robert E. Tarjan, and Francis Zane.
Proceedings of Financial Cryptography '98,
Anguilla, BWI, 23-25 February 1998.
|
 |
 |
Satisfiability Coding Lemma.
Ramamohan Paturi, Pavel Pudlak, and Francis Zane.
Chicago Journal of Theoretical Computer Science
1999. No. 11.
Conference version appeared in
Proceedings of the 38th Annual Symposium on Foundations of Computer Science.
October 1997, Miami, FL. pp. 566-574.
|
|
|
Dimension of Projections in Boolean Functions.
Ramamohan Paturi and Francis Zane.
SIAM Journal on Discrete Mathematics.
November 1998. Vol 11, No. 4. pp. 624-632.
|
 |
 |
Exponential Lower Bounds for Depth 3 Boolean Circuits.
Ramamohan Paturi, Michael E. Saks, and Francis Zane.
Proceedings of the 29th Annual ACM Symposium of Theory of Computing.
May 1997, El Paso, TX. pp. 86-91. Journal version to appear in Computational Complexity.
|
 |
 |
Scalable Network Architectures Using the Optical
Transpose Interconnection System (OTIS).
Francis Zane, Ramamohan Paturi, Philippe Marchand, and Sadik Esener.
Journal of Parallel and Distributed Computing.
May 2000, Vol. 60, No. 5. pp 521-38.
Conference version appeared in
Proceedings of the 3rd International Conference on Massively Parallel
Processing Using Optical Interconnects (MPPOI).
October 1996, Maui, HI. pp. 114-121.
|