Presently *(uncategorized).

<strong>Abstract</strong> from <em>"Robust Hyperlinks Cost Just Five Words Each"</em>, Thomas A. Phelps and Robert Wilensky, Division of Computer Science, University of California, Berkeley:
<blockquote>
We propose robust hyperlinks as a solution to the problem of broken hyperlinks. A robust hyperlink is a URL augmented with a small "signature", computed from the referenced document. The signature can be submitted as a query to web search engines to locate the document. It turns out that very small signatures are sufficient to readily locate individual documents out of the many millions on the web.

Robust hyperlinks exhibit a number of desirable qualities: they can be computed and exploited automatically, are small and cheap to compute (so that it is practical to make all hyperlinks robust), do not require new server or infrastructure support, can be rolled out reasonably well in the existing URL syntax, can be used to automatically retrofit existing links to make them robust, and are easy to understand. In particular, one can start using robust hyperlinks now, as servers and web pages are mostly compatible as  is, while clients can increase their support in the future. 

Robust hyperlinks are one example of using the web to bootstrap new features onto itself.
</blockquote>
Example of Robust Hyperlink for retrieving the paper above: _("http://www.google.com/search?q=thinkinginpostscript+cityquilt+fernec+planetext+peroperties"|http://www.google.com/search?q=thinkinginpostscript+cityquilt+fernec+planetext+peroperties)

<span class="comment">[<strong>Note</strong>: the only real contra of this proposal <em>as is</em> seems its reliance on search engines (a _(centralized), little scalable solution).
-- _(MaD70)</span>

<ul class="implementations">
<li>_("Robust Software"|http://www.cs.berkeley.edu/~phelps/Robust/software.html).
</ul>

<ul class="links">
<li>_("Robust Hyperlinks and Robust Locations Home Page"|http://www.cs.berkeley.edu/~phelps/Robust/index2.html).
<li>_("Robust Linking: Robust Hyperlinks and Robust Locations"|http://elib.cs.berkeley.edu/seminar/2000/20000214.html)
<li>_("Robust Hyperlinks Cost Just Five Words Each"|http://www.cs.berkeley.edu/~phelps/Robust/papers/robust-hyperlinks.html).
<li>_("Robust Hyperlinks and Archival Intermemory"|http://external.nj.nec.com/homepages/ingemar/course/presentations/Robust%20hyperlink.ppt), a PowerPoint presentation.
</ul>

See also:
<ul class="links">
<li>_("The Multivalent Browser -- A Platform for New Ideas"|http://www.cs.berkeley.edu/~phelps/Multivalent/).
<li>_("Scalable Document Fingerprinting (Extended Abstract)"|http://www-2.cs.cmu.edu/afs/cs/user/nch/www/koala/main.html).
</ul>
