MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for authors named "Francis Zane" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

12 documents found, showing 1 through 10. Next 10 →

ATOM

Efficient Watermark Detection and Collusion Security
by Francis Zane — 2000 — in Proceedings of Financial Cryptography
…Efficient Watermark Detection and Collusion Security Francis Zane Department of Fundamental…
Cited by 7 (0 self) – Add To MetaCart

Watermarking Maps: Hiding Information in Structured Data
by Sanjeev Khanna, Francis Zane — 2000 — in Proceedings of SODA 2000. Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms
… Watermarking Maps: Hiding Information in Structured Data Sanjeev Khanna Francis Zane y…
Cited by 4 (0 self) – Add To MetaCart

CoolCAMs: Power-Efficient TCAMs for Forwarding Engines
by Francis Zane Girija, Francis Zane, Girija Narlikar, Anindya Basu — 2003 — In IEEE INFOCOM
…CoolCAMs: Power-Efficient TCAMs for Forwarding Engines Francis Zane Girija Narlikar Anindya Basu…
Add To MetaCart

Scalable Network Architectures Using The Optical Transpose Interconnection System (OTIS)
by Francis Zane, Philippe Marchand, Ramamohan Paturi, Sadik Esener — 1996
… Zane, Philippe Marchand, Ramamohan Paturi, and Sadik Esener University of California, San Diego…
Cited by 29 (0 self) – Add To MetaCart

Satisfiability Coding Lemma
by Ramamohan Paturi, Pavel Pudlák, Francis Zane — 1997 — In Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, FOCS’97
…Satisfiability Coding Lemma Ramamohan Paturi y , Pavel Pudlak , and Francis Zane y Abstract…
Cited by 52 (5 self) – Add To MetaCart

Which Problems Have Strongly Exponential Complexity?
by Russell Impagliazzo, Ramamohan Paturi, Francis Zane — 1998 — Journal of Computer and System Sciences
… University of California, San Diego Francis Zane Bell Laboratories, Lucent Technologies Abstract For several…
Cited by 46 (2 self) – Add To MetaCart

Exponential Lower Bounds for Depth 3 Boolean Circuits
by Ramamohan Paturi, Michael E. Saks, Francis Zane — 1997
… , and Francis Zane z Abstract We consider the class S k 3 of unbounded fan-in depth-3 boolean circuits…
Cited by 12 (5 self) – Add To MetaCart

Clustering and Server Selection using Passive Monitoring
by Matthew Andrews, Bruce Shepherd, Aravind Srinivasan, Peter Winkler, Francis Zane — 2002 — In Proc. IEEE INFOCOM 2002
… Srinivasan Peter Winkler Francis Zane Abstract We consider the problem of client assignment in a distributed…
Cited by 19 (0 self) – Add To MetaCart

An Improved Exponential-time Algorithm for k-SAT
by Ramamohan Paturi, Pavel Pudlák, Michael E. Saks, Francis Zane — 1998
… E. Saks z , and Francis Zane x Abstract We propose and analyze a simple new randomized algorithm…
Cited by 67 (3 self) – Add To MetaCart

Clustering and Server Selection using Passive Monitoring
by Matthew Andrews Bruce, Bruce Shepherd, Aravind Srinivasan, Peter Winkler, Francis Zane — 2002 — In Proc. IEEE INFOCOM 2002
… ∗ , Aravind Srinivasan † , Peter Winkler ∗ , Francis Zane ∗ Abstract— We consider the problem of client…
Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB