How to search history

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

How to search history

Source

Information and Control archive
Volume 64 , Issue 1-3 (Jan./Feb./March 1985) table of contents

Pages: 77 - 99

Year of Publication: 1985

ISSN:0019-9958

Author

Bernard Chazelle

Brown Univ., Providence, RI

Publisher

Academic Press Professional, Inc. San Diego, CA, USA

Bibliometrics

Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Citation Count: 25

Additional Information:

cited by index terms review collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	10.1016/S0019-9958(85)80045-0

CITED BY 25

	Haim Kaplan , Robert E. Tarjan, Purely functional, real-time deques with catenation, Journal of the ACM (JACM), v.46 n.5, p.577-603, Sept. 1999
	Haim Kaplan , Robert E. Tarjan, Purely functional representations of catenable sorted lists, Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, p.202-211, May 22-24, 1996, Philadelphia, Pennsylvania, United States
	K L Clarkson, Further applications of random sampling to computational geometry, Proceedings of the eighteenth annual ACM symposium on Theory of computing, p.414-423, May 28-30, 1986, Berkeley, California, United States
	Yuntao Cui , Junyang Weng, A Learning-Based Prediction-and-Verification Segmentation Scheme for Hand Sign Image Sequence, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.21 n.8, p.798-804, August 1999
	C. Monma , M. Paterson , S. Suri , F. Yao, Computing Euclidean maximum spanning trees, Proceedings of the fourth annual symposium on Computational geometry, p.241-251, June 06-08, 1988, Urbana-Champaign, Illinois, United States
	Xiaojun Shen , Qing Hu, Approximate submatrix matching problems, Proceedings of the 1992 ACM/SIGAPP symposium on Applied computing: technological challenges of the 1990's, p.993-999, March 1992, Kansas City, Missouri, United States
	Otfried Schwarzkopf, Ray shooting in convex polytopes, Proceedings of the eighth annual symposium on Computational geometry, p.286-295, June 10-12, 1992, Berlin, Germany
	H. Edelsbrunner, An acyclicity theorem for cell complexes in d dimensions, Proceedings of the fifth annual symposium on Computational geometry, p.145-151, June 05-07, 1989, Saarbruchen, West Germany
	T. Tamassia , J. S. Vitter, Optimal cooperative search in fractional cascaded data structures, Proceedings of the second annual ACM symposium on Parallel algorithms and architectures, p.307-316, July 02-06, 1990, Island of Crete, Greece
	Adam L. Buchsbaum , Robert E. Tarjan, Confluently persistent deques via data structuaral bootstrapping, Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms, p.155-164, January 25-27, 1993, Austin, Texas, United States
	Amos Fiat , Haim Kaplan, Making data structures confluently persistent, Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, p.537-546, January 07-09, 2001, Washington, D.C., United States
	Haim Kaplan , Robert E. Tarjan, Persistent lists with catenation via recursive slow-down, Proceedings of the twenty-seventh annual ACM symposium on Theory of computing, p.93-102, May 29-June 01, 1995, Las Vegas, Nevada, United States
	T. V. Lakshman , D. Stiliadis, High-speed policy-based packet forwarding using efficient multi-dimensional range matching, ACM SIGCOMM Computer Communication Review, v.28 n.4, p.203-214, Oct. 1998
	Franz Aurenhammer, Voronoi diagrams—a survey of a fundamental geometric data structure, ACM Computing Surveys (CSUR), v.23 n.3, p.345-405, Sept. 1991
	J R Driscoll , N Sarnak , D D Sleator , R E Tarjan, Making data structures persistent, Proceedings of the eighteenth annual ACM symposium on Theory of computing, p.109-121, May 28-30, 1986, Berkeley, California, United States
	Giuseppe Liotta , France P. Preparata , Roberto Tamassia, Robust proximity queries: an illustration of degree-driven algorithm design, Proceedings of the thirteenth annual symposium on Computational geometry, p.156-165, June 04-06, 1997, Nice, France
	Mikhail J. Atallah , Michael T. Goodrich , S. Rao Kosaraju, Parallel algorithms for evaluating sequences of set-manipulation operations, Journal of the ACM (JACM), v.41 n.6, p.1049-1088, Nov. 1994
	James R. Driscoll , Daniel D. K. Sleator , Robert E. Tarjan, Fully persistent lists with catenation, Journal of the ACM (JACM), v.41 n.5, p.943-959, Sept. 1994
	Allan Borodin , Rafail Ostrovsky , Yuval Rabani, Subquadratic approximation algorithms for clustering problems in high dimensional spaces, Proceedings of the thirty-first annual ACM symposium on Theory of computing, p.435-444, May 01-04, 1999, Atlanta, Georgia, United States
	Peter L. Williams, Visibility-ordering meshed polyhedra, ACM Transactions on Graphics (TOG), v.11 n.2, p.103-126, April 1992
	David Dobkin , Subhash Suri, Maintenance of geometric extrema ∈ , Journal of the ACM (JACM), v.38 n.2, p.275-298, April 1991
	James R. Driscoll , Daniel D. K. Sleator , Robert E. Tarjan, Fully persistent lists with catenation, Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms, p.89-99, January 28-30, 1991, San Francisco, California, United States
	Allan Borodin , Rafail Ostrovsky , Yuval Rabani, Subquadratic Approximation Algorithms for Clustering Problems in High Dimensional Spaces, Machine Learning, v.56 n.1-3, p.153-167
	Vassilis J. Tsotras , B. Gopinath , George W. Hart, Efficient Management of Time-Evolving Databases, IEEE Transactions on Knowledge and Data Engineering, v.7 n.4, p.591-608, August 1995
	Amos Fiat , Haim Kaplan, Making data structures confluently persistent, Journal of Algorithms, v.48 n.1, p.16-58, August 2003

INDEX TERMS

Classification:
E. Data
E.1 DATA STRUCTURES
Subjects: Trees

F. Theory of Computation
F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
F.2.2 Nonnumerical Algorithms and Problems
Subjects: Geometrical problems and computations; Sorting and searching

General Terms:
Algorithms, Theory

REVIEW

"Thomas Rainer Michael Fischer : Reviewer"

The author defines a new data structure called canal tree, which is essentially a binary tree capable of remembering the situation it held at previous times. Its use is demonstrated by presenting algorithms for several problems in three-dimensio more...

Collaborative Colleagues:

Bernard Chazelle: colleagues

Adobe Acrobat

QuickTime

Windows Media Player

Real Player