gis94.html
Click here to view the file
or
click here to download the file
File contents
<html><head><title>2. ACM-GIS 1995: Gaithersburg, Maryland</title><link href="../../../dblp.css" rel="stylesheet" type="text/css" /></head><body> <table width="100%"><tr><td align="left"><a href="../../index.html"><img alt="dblp.uni-trier.de" src="../../Logo.gif" border=0 height=60 width=170></a></td> <td align="right"><a href="http://www.uni-trier.de"><img alt="www.uni-trier.de" src="../../logo_universitaet-trier.gif" border=0 height=48 width=215></a></td></tr></table> <h1>2. <a href="index.html">ACM-GIS</a> 1994: Gaithersburg, Maryland</h1> <a href="../../indices/a-tree/p/Pissinou:Niki.html">Niki Pissinou</a>, <a href="../../indices/a-tree/m/Makki:Kia.html">Kia Makki</a> (Eds.): Proceedings of the Second ACM Workshop on Advances in Geographic Information Systems, ACM Press, ISBN 0-89791-750-2, 1994 <ul> <li><a name="ArefS94" href="../../indices/a-tree/a/Aref:Walid_G=.html">Walid G. Aref</a>, <a href="../../indices/a-tree/s/Samet:Hanan.html">Hanan Samet</a>: A Cost Model for Query Optimization Using R-Trees. 0- <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/gis/ArefS94">BibTeX</a></font> <li><a name="Henrich94" href="../../indices/a-tree/h/Henrich:Andreas.html">Andreas Henrich</a>: A Distance Scan Algorithm for Spatial Access Structures. 136-143 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/gis/Henrich94">BibTeX</a></font> </ul><p><div class="footer"> <a href="../../index.html">Home</a> | <a href="../indexa.html">Conferences</a> | <a href="../../journals/index.html">Journals</a> | <a href="../../series/index.html">Series</a> | <a href="../../about/faq.html">FAQ</a> — Search: <a href="http://dblp.l3s.de">Faceted</a> | <a href="http://dblp.mpi-inf.mpg.de/dblp-mirror/index.php">Complete</a> | <a href="../../indices/a-tree/index.html">Author</a></div> <small><a href="../../copyright.html">Copyright ©</a> Sat May 16 23:13:34 2009 by <a href="http://www.informatik.uni-trier.de/~ley/addr.html">Michael Ley</a> (<a href="mailto:ley@uni-trier.de">ley@uni-trier.de</a>)</small></p></body></html>




