The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Francis Zane: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Lesley R. Matheson, Stephen G. Mitchell, Talal Shamoon, Robert Endre Tarjan, Francis Zane
    Robustness and Security of Digital Watermarks. [Citation Graph (0, 0)][DBLP]
    Financial Cryptography, 1998, pp:227-240 [Conf]
  2. Francis Zane
    Efficient Watermark Detection and Collusion Security. [Citation Graph (0, 0)][DBLP]
    Financial Cryptography, 2000, pp:21-32 [Conf]
  3. Russell Impagliazzo, Ramamohan Paturi, Francis Zane
    Which Problems Have Strongly Exponential Complexity? [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:653-663 [Conf]
  4. Ramamohan Paturi, Pavel Pudlák, Michael E. Saks, Francis Zane
    An Improved Exponential-Time Algorithm for k-SAT. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:628-637 [Conf]
  5. Ramamohan Paturi, Pavel Pudlák, Francis Zane
    Satisfiability Coding Lemma. [Citation Graph (0, 0)][DBLP]
    FOCS, 1997, pp:566-574 [Conf]
  6. Matthew Andrews, F. Bruce Shepherd, Aravind Srinivasan, Peter Winkler, Francis Zane
    Clustering and Server Selection using Passive Monitoring. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2002, pp:- [Conf]
  7. Girija J. Narlikar, Anindya Basu, Francis Zane
    CoolCAMs: Power-Efficient TCAMs for Forwarding Engines. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2003, pp:- [Conf]
  8. Girija J. Narlikar, Francis Zane
    Performance modeling for fast IP lookups. [Citation Graph (0, 0)][DBLP]
    SIGMETRICS/Performance, 2001, pp:1-12 [Conf]
  9. Anupam Gupta, Francis Zane
    Counting inversions in lists. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:253-254 [Conf]
  10. Sanjeev Khanna, Francis Zane
    Watermarking maps: hiding information in structured data. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:596-605 [Conf]
  11. Ramamohan Paturi, Michael E. Saks, Francis Zane
    Exponential Lower Bounds for Depth 3 Boolean Circuits. [Citation Graph (0, 0)][DBLP]
    STOC, 1997, pp:86-91 [Conf]
  12. Marcus K. Weldon, Francis Zane
    The economics of fiber to the home revisited. [Citation Graph (0, 0)][DBLP]
    Bell Labs Technical Journal, 2003, v:8, n:1, pp:181-206 [Journal]
  13. Ramamohan Paturi, Michael E. Saks, Francis Zane
    Exponential lower bounds for depth three Boolean circuits. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2000, v:9, n:1, pp:1-15 [Journal]
  14. Ramamohan Paturi, Pavel Pudlák, Francis Zane
    Satisfiability Coding Lemma. [Citation Graph (0, 0)][DBLP]
    Chicago J. Theor. Comput. Sci., 1999, v:1999, n:, pp:- [Journal]
  15. Ramamohan Paturi, Pavel Pudlák, Michael E. Saks, Francis Zane
    An improved exponential-time algorithm for k-SAT. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2005, v:52, n:3, pp:337-364 [Journal]
  16. Russell Impagliazzo, Ramamohan Paturi, Francis Zane
    Which Problems Have Strongly Exponential Complexity? [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2001, v:63, n:4, pp:512-530 [Journal]
  17. Francis Zane, Philippe J. Marchand, Ramamohan Paturi, Sadik C. Esener
    Scalable Network Architectures Using the Optical Transpose Interconnection System (OTIS). [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2000, v:60, n:5, pp:521-538 [Journal]
  18. Ramamohan Paturi, Francis Zane
    Dimension of Projections in Boolean Functions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1998, v:11, n:4, pp:624-632 [Journal]

Search in 0.004secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002