- 24 I. Schiermeyer. Solving 3-satis ability in less than 1:579n steps. In E. Borger, G. Jager, H. Kleine Buning, and S. Martini, editors, Computer Science Logic
- ISIT 1998, Cambridge, MA, USA, August 16 August 21 Resistance of Digital Watermarks to Collusive Attacks
- Satisfiability Coding Lemma Ramamohan Paturiy
- Exponential Lower Bounds for Depth 3 Boolean Circuits Ramamohan Paturi, Michael E. Saksy, and Francis Zanez
- Scalable Network Architectures Using The Optical Transpose Interconnection System (OTIS)
- Scalable Network Architectures Using The Optical Transpose Interconnection System (OTIS)
- An Improved Exponentialtime Algorithm for kSAT Ramamohan Paturi , Pavel Pudlak y ,
- contradicting the ;p-unpredictability of S with re-spect to W.
- Resistance of Digital Watermarks to Collusive Attacks
- Which Problems Have Strongly Exponential Complexity? Russell Impagliazzo
- Satisfiability Coding Lemma Ramamohan Paturi y , Pavel Pudlak \Lambda , and Francis Zane y
- Exponential Lower Bounds for Depth 3 Boolean Circuits Ramamohan Paturi \Lambda , Michael E. Saks y , and Francis Zane z
- Efficient Watermark Detection and Collusion Francis Zane
- Which Problems Have Strongly Exponential Complexity? Russell Impagliazzo , Ramamohan Paturi y
- ISIT 1998, Cambridge, MA, USA, August 16 --August 21 Resistance of Digital Watermarks to Collusive Attacks
- An Improved Exponential-time Algorithm for -SAT Ramamohan Paturi
- [24] I. Schiermeyer. Solving 3satisfiability in less than 1:579 n steps. In E. Borger, G. Jager, H. Kleine Buning, and S. Martini, editors, Computer Science Logic
- Robustness and Security of Digital Watermarks Lesley R. Matheson Stephen G. Mitchell1 Talal G. Shamoon
- Robustness and Security of Digital Watermarks Lesley R. Matheson Stephen G. Mitchell 1 Talal G. Shamoon
- contradicting the (fl; p)unpredictability of S with re spect to W .
