default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrancis Zane
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2005
[j7]Ramamohan Paturi, Pavel Pudlák, Michael E. Saks, Francis Zane:
An improved exponential-time algorithm for k-SAT. J. ACM 52(3): 337-364 (2005)- 2003
- [j6]Marcus K. Weldon, Francis Zane:
The economics of fiber to the home revisited. Bell Labs Tech. J. 8(1): 181-206 (2003) - 2001
- [j5]Russell Impagliazzo
, Ramamohan Paturi, Francis Zane:
Which Problems Have Strongly Exponential Complexity? J. Comput. Syst. Sci. 63(4): 512-530 (2001) - 2000
- [j4]Ramamohan Paturi, Michael E. Saks, Francis Zane:
Exponential lower bounds for depth three Boolean circuits. Comput. Complex. 9(1): 1-15 (2000) - [j3]Francis Zane, Philippe J. Marchand, Ramamohan Paturi, Sadik C. Esener:
Scalable Network Architectures Using the Optical Transpose Interconnection System (OTIS). J. Parallel Distributed Comput. 60(5): 521-538 (2000) - 1999
- [j2]Ramamohan Paturi, Pavel Pudlák, Francis Zane:
Satisfiability Coding Lemma. Chic. J. Theor. Comput. Sci. 1999 (1999) - 1998
- [j1]Ramamohan Paturi, Francis Zane:
Dimension of Projections in Boolean Functions. SIAM J. Discret. Math. 11(4): 624-632 (1998)
Conference and Workshop Papers
- 2012
- [c13]Leonardo Giusti, Xerxes P. Kotval, Amelia Schladow, Nicholas Wallen, Francis Zane, Federico Casalegno:
Workspace configurations: setting the stage for remote collaboration on physical tasks. NordiCHI 2012: 351-360 - 2011
- [c12]Senthil Kumar, Sreedal Menon, Francis Zane:
Sharing rectangular objects in a video conference. ACM Multimedia 2011: 965-968 - 2003
- [c11]Girija J. Narlikar, Anindya Basu, Francis Zane:
CoolCAMs: Power-Efficient TCAMs for Forwarding Engines. INFOCOM 2003: 42-52 - [c10]Anupam Gupta, Francis Zane:
Counting inversions in lists. SODA 2003: 253-254 - 2002
- [c9]Matthew Andrews, F. Bruce Shepherd, Aravind Srinivasan, Peter Winkler, Francis Zane:
Clustering and Server Selection using Passive Monitoring. INFOCOM 2002: 1717-1725 - 2001
- [c8]Girija J. Narlikar, Francis Zane:
Performance modeling for fast IP lookups. SIGMETRICS/Performance 2001: 1-12 - 2000
- [c7]Francis Zane:
Efficient Watermark Detection and Collusion Security. Financial Cryptography 2000: 21-32 - [c6]Sanjeev Khanna, Francis Zane:
Watermarking maps: hiding information in structured data. SODA 2000: 596-605 - 1998
- [c5]Lesley R. Matheson, Stephen G. Mitchell, Talal Shamoon, Robert Endre Tarjan, Francis Zane:
Robustness and Security of Digital Watermarks. Financial Cryptography 1998: 227-240 - [c4]Ramamohan Paturi, Pavel Pudlák, Michael E. Saks, Francis Zane:
An Improved Exponential-Time Algorithm for k-SAT. FOCS 1998: 628-637 - [c3]Russell Impagliazzo, Ramamohan Paturi, Francis Zane:
Which Problems Have Strongly Exponential Complexity? FOCS 1998: 653-663 - 1997
- [c2]Ramamohan Paturi, Pavel Pudlák, Francis Zane:
Satisfiability Coding Lemma. FOCS 1997: 566-574 - [c1]Ramamohan Paturi, Michael E. Saks, Francis Zane:
Exponential Lower Bounds for Depth 3 Boolean Circuits. STOC 1997: 86-91
Reference Works
- 2016
- [r2]Ramamohan Paturi, Pavel Pudlák, Michael E. Saks, Francis Zane:
Backtracking Based k-SAT Algorithms. Encyclopedia of Algorithms 2016: 170-174 - 2008
- [r1]Ramamohan Paturi, Pavel Pudlák, Michael E. Saks, Francis Zane:
Backtracking Based k-SAT Algorithms. Encyclopedia of Algorithms 2008
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
