This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Introducing the New Editor-in-Chief of the IEEE Transactions on Knowledge and Data Engineering
January/February 2001 (vol. 13 no. 1)
pp. 1-2

[1] D.J. Abel and D.M. Mark, “A Comparative Analysis of Some Two-Dimensional Orderings,” Int'l J. Geographical Information Systems, vol. 4, no. 1, pp. 2131, Jan. 1990.
[2] J.J. Bartholdi and L.K. Platzman, “An O($n\log n$) Travelling Salesman Heuristic Based on Spacefilling Curves,” Operation Research Letters, vol. 1, no. 4, pp. 121125, Sept. 1982.
[3] M. Berger, Geometry II. New York: Springer-Verlag, 1987.
[4] T. Bially, “Space-Filling Curves: Their Generation and Their Application to Bandwidth Reduction,” IEEE Trans. Information Theory, vol. 15, no. 6, pp. 658664, Nov. 1969.
[5] A.R. Butz, “Convergence with Hilbert's Space Filling Curve,” J. Computer and System Sciences, vol. 3, pp. 128146, 1969.
[6] I.S. Duff, “Design Features of a Frontal Code for Solving Sparse Unsymmetric Linear Systems Out-of-Core,” SIAM J. Scientific Statistical Computing, vol. 5, no. 2, pp. 270280, June 1984.
[7] C.R. Dyer, “The Space Efficiency of Quadtrees,” Computer Graphics and Image Processing, vol. 19, no. 4, pp. 335348, Aug. 1982.
[8] C. Faloutsos, “Multiattribute Hashing Using Gray Codes,” Proc. 1986 ACM SIGMOD Conf., pp. 227238, May 1986.
[9] C. Faloutsos, “Analytical Results on the Quadtree Decomposition of Arbitrary Rectangles,” Pattern Recognition Letters, vol. 13, no. 1, pp. 3140, Jan. 1992.
[10] C. Faloutsos, H.V. Jagadish, and Y. Manolopoulos, “Analysis of the N-Dimensional Quadtree Decomposition for Arbitrary Hyperrectangles,” IEEE Trans. Knowledge and Data Eng., vol. 9, no. 3, pp. 373383, May/June 1997.
[11] C. Faloutsos and S. Roseman, “Fractals for Secondary Key Retrieval,” Proc. ACM Principles of Database Systems Conf., pp. 247252, Mar. 1989.
[12] P.J. Giblin, Graphs, Surfaces, and Homology, second ed. New York: Chapman and Hall, 1981.
[13] D. Hilbert, “Über die stetige Abbildung einer Linie auf Flächenstück,” Math. Ann., vol. 38, pp. 459460, 1891.
[14] H.V. Jagadish, “Linear Clustering of Objects with Multiple Attributes,” Proc. ACM SIGMOD Conf., pp. 332342, May 1990.
[15] H.V. Jagadish, “Spatial Search with Polyhedra,” Proc. Sixth Int'l Conf. Data Eng., pp. 311319, Feb. 1990.
[16] H.V. Jagadish, “Analysis of the Hilbert Curve for Representing Two-Dimensional Space,” Information Processing Letters, vol. 62, no. 1, pp. 1722, Apr. 1997.
[17] M. Kaddoura, C.-W. Ou, and S. Ranka, “Partitioning Unstructured Computational Graphs for Nonuniform and Adaptive Environments,” IEEE Parallel and Distributed Technology, vol. 3, no. 3, pp. 6369, Fall 1995.
[18] A. Lempel and J. Ziv, “Compression of Two-Dimensional Images,” NATO ASI Series, vol. F12, pp. 141154, June 1984.
[19] J. Orenstein, “Spatial Query Processing in an Object-Oriented Database System,” Proc. 1986 ACM SIGMOD Conf., pp. 326336, May 1986.
[20] E.A. Patrick, D.R. Anderson, and F.K. Bechtel, “Mapping MultiDimensional Space to One Dimension for Computer Output Display,” IEEE Trans. Computers, vol. 17, no. 10, pp. 949953, Oct. 1968.
[21] G. Peano, “Sur une Courbe qui Remplit Toute une Aire Plane,” Math. Ann., vol. 36, pp. 157160, 1890.
[22] R.L. Rivest, “Partial Match Retrieval Algorithms,” SIAM J. Computing, vol. 5, no. 1, pp. 1950, Mar. 1976.
[23] Y. Rong and C. Faloutsos, “Analysis of the Clustering Property of Peano Curves,” Technical Report CS-TR-2792, UMIACS-TR-91-151, Univ. of Maryland, Dec. 1991.
[24] J.B. Rothnie and T. Lozano, “Attribute Based File Organization in a Paged Memory Environment,” Comm. ACM, vol. 17, no. 2, pp. 6369, Feb. 1974.
[25] C. Ruemmler and J. Wilkes, “An Introduction to Disk Drive Modeling,” IEEE Computer, vol. 27, no. 3, pp. 1728, Mar. 1994.
[26] H. Sagan, “A Three-Dimensional Hilbert Curve,” Int'l J. Math. Ed. Science Technology, vol. 24, pp. 541545, 1993.
[27] C.A. Shaffer, “A Formula for Computing the Number of Quadtree Node Fragments Created by a Shift,” Pattern Recognition Letters, vol. 7, no. 1, pp. 4549, Jan. 1988.
[28] G.F. Simmons, Introduction to Topology and Modern Analysis. New York: McGraw-Hill Book Company, Inc., 1963.

Citation:
Farokh B. Bastani, "Introducing the New Editor-in-Chief of the IEEE Transactions on Knowledge and Data Engineering," IEEE Transactions on Knowledge and Data Engineering, vol. 13, no. 1, pp. 1-2, Jan.-Feb. 2001, doi:10.1109/TKDE.2001.10001
Usage of this product signifies your acceptance of the Terms of Use.