Francis Zane

According to our database1, Francis Zane authored at least 19 papers between 1997 and 2016.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2016
Backtracking Based <i>k</i>-SAT Algorithms.
Encyclopedia of Algorithms, 2016

2012
Workspace configurations: setting the stage for remote collaboration on physical tasks.
Proceedings of the Nordic Conference on Human-Computer Interaction, 2012

2011
Sharing rectangular objects in a video conference.
Proceedings of the 19th International Conference on Multimedia 2011, Scottsdale, AZ, USA, November 28, 2011

2008
Backtracking Based k-SAT Algorithms.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

2005
An improved exponential-time algorithm for <i>k</i>-SAT.
J. ACM, 2005

2003
The economics of fiber to the home revisited.
Bell Labs Tech. J., 2003

Counting inversions in lists.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

CoolCAMs: Power-Efficient TCAMs for Forwarding Engines.
Proceedings of the Proceedings IEEE INFOCOM 2003, The 22nd Annual Joint Conference of the IEEE Computer and Communications Societies, San Franciso, CA, USA, March 30, 2003

2002
Clustering and Server Selection using Passive Monitoring.
Proceedings of the Proceedings IEEE INFOCOM 2002, 2002

2001
Which Problems Have Strongly Exponential Complexity?
J. Comput. Syst. Sci., 2001

Performance modeling for fast IP lookups.
Proceedings of the Joint International Conference on Measurements and Modeling of Computer Systems, 2001

2000
Scalable Network Architectures Using the Optical Transpose Interconnection System (OTIS).
J. Parallel Distributed Comput., 2000

Exponential lower bounds for depth three Boolean circuits.
Comput. Complex., 2000

Watermarking maps: hiding information in structured data.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Efficient Watermark Detection and Collusion Security.
Proceedings of the Financial Cryptography, 2000

1999
Satisfiability Coding Lemma.
Chic. J. Theor. Comput. Sci., 1999

1998
Dimension of Projections in Boolean Functions.
SIAM J. Discret. Math., 1998

Robustness and Security of Digital Watermarks.
Proceedings of the Financial Cryptography, 1998

1997
Exponential Lower Bounds for Depth 3 Boolean Circuits.
Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997


  Loading...