We consider the problem of coding planar graphs by binary strings. Depending on whether O(1)-time queries for adjacency and degree are supported, we present three sets of coding schemes which all take linear time for encoding and decoding. The encoding lengths are significantly shorter than the previously known results in each case. 1 I n t r o d u c t i o n This paper investigates the problem ...

with illustrations by Ernest (Craige, M1.D. Wherein certatin principles governing screening tests for case finding in the general I)oulation .are (definedl and the heart disease case finding. studies in Boston atre eval-uatedl. HE comb)ined experience from mass surveys for such (liseases as tubherculosis, diabetes, syphilis, cancer and heart disease has madle it possible to define in a prelimi-...

[1] Based upon the authors’ questioning of the existence of the C2v intermediate, we have reviewed our evidence for the existence of this state. It now appears that this state was in fact an artifact of our calculation [Yung et al., 2004], and was a saddle point rather than a true minimum. Our desire to provide a timely response to this criticism has kept us from determining exactly what minimu...

The 1980's saw rapid and exciting development of techniques for proving lower bounds in circuit complexity. This pace has slowed recently, and there has even been work indicating that quite di erent proof techniques must be employed to advance beyond the current frontier of circuit lower bounds. Although this has engendered pessimism in some quarters, there have in fact been many positive devel...

Many societal challenges at the beginning of the 21st century lead to an apparent and growing need for functional materials and novel ways of materials synthesis and assembly. Rising to the challenge, the utilization of small, self-assembling building blocks for the bottom-up construction of new types of polymers and nanostructures has enjoyed increasing popularity among materials researchers i...