In computer science, fractional cascading is a technique to speed up a sequence of binary searches for the same value in a sequence of related dataâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2012

2012

This paper studies the distribution of avalanches in fractional cascading, linking the behavior to studies on self-organizedâ€¦Â (More)

Is this relevant?

2011

2011

- Vissarion Fisikopoulos
- ArXiv
- 2011

Range trees are multidimensional binary trees which are used to perform d-dimensional orthogonal range searching. In thisâ€¦Â (More)

Is this relevant?

2003

2003

- Qingmin Shi
- 2003

Using the notions of Q heaps and fusion trees developed by Fredman and Willard we develop a faster version of the fractionalâ€¦Â (More)

Is this relevant?

2001

2001

- Bernard Chazelle, Ding Liu
- STOC
- 2001

Given an <italic>n</italic>-edge convex subdivision of the plane, is it possible to report its <italic>k</italic> intersectionsâ€¦Â (More)

Is this relevant?

1992

1992

- Frank Dehne, Afonso Ferreira, Andrew Rau-Chaplin
- Comput. Geom.
- 1992

Dehne, F., A. Ferreira and A. Rau-Chaplin, Parallel fractional cascading on hypercube multiprocessors, Computational Geometryâ€¦Â (More)

Is this relevant?

Highly Cited

1990

Highly Cited

1990

- Kurt Mehlhorn, Stefan NÃ¤her
- Algorithmica
- 1990

The problem of searching for a key in many ordered lists arises frequently in computational geometry. Chazelle and Guibasâ€¦Â (More)

Is this relevant?

1990

1990

- Roberto Tamassia, Jeffrey Scott Vitter
- Algorithmica
- 1990

Fractional cascading is a technique designed to allow efficient sequential search in a graph with catalogs of total sizen. Theâ€¦Â (More)

Is this relevant?

Highly Cited

1987

Highly Cited

1987

- Mikhail J. Atallah, Richard B Cole, Michael T. Goodrich
- 28th Annual Symposium on Foundations of Computerâ€¦
- 1987

We present techniques for parallel divide-and-conquer, resulting in improved parallel algorithms for a number of problems. Theâ€¦Â (More)

Is this relevant?

Highly Cited

1986

Highly Cited

1986

- Bernard Chazelle, Leonidas J. Guibas
- Algorithmica
- 1986

In computational geometry many search problems and range queries can be solved by performing an iterative search for the same keyâ€¦Â (More)

Is this relevant?

Highly Cited

1986

Highly Cited

1986

- Bernard Chazelle, Leonidas J. Guibas
- Algorithmica
- 1986

This paper presents several applications offractional cascading, a new searching technique which has been described in aâ€¦Â (More)

Is this relevant?