On Pointers versus Addresses

On Pointers versus Addresses

Cached

Download Links

[www2.mta.ac.il]

by Amir M. Ben-Amram , Zvi Galil

Citations:

9 - 2 self

BibTeX

@MISC{Ben-Amram_onpointers,
    author = {Amir M. Ben-Amram and Zvi Galil},
    title = {On Pointers versus Addresses },
    year = {}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Citations

2172	The Design and Analysis of Computer Algorithms - Aho, Hopcroft, et al. - 1974
1611	Computational geometry: An introduction - Preparata, Shamos - 1985
419	Computational geometry - Preparata, Shamos - 1985
321	The Art of Computer Programming, vol. 3: Sorting and Searching - Knuth - 1973
206	The art of computer programming Vol. 1: Fundamental algorithms - Knuth - 1997
138	Dimension Theory - Hurewicz, Wallmann - 1941
121	A model for hierarchical memory - Aggarwal, Alpern, et al. - 1987
121	A functional approach to data structures and its use in multidimensional searching - Chazelle - 1988
98	Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes, Combinatorica 6 - Hart, Sharir - 1986
58	Storage modification machines - Schonhage - 1980
42	On the definition of algorithm - Kolmogorov, Uspensky - 1963
26	Real-time simulation of a set machine on a ram - Paige - 1989
26	A characterization of the power of vector machines - Pratt, Stockmeyer - 1976
18	The I/O complexity of sorting and related problems - Aggarwal, Vitter - 1987
16	On the power of multiplication in random access machines - Hartmanis, Simon - 1974
15	Introduction to set Theory and Topology - Kuratowski - 1961
15	A lower bound on the complexity of the union-split-find problem - Mehlhorn, Näher, et al. - 1988
14	On the single-operation worst-case time complexity of the disjoint set union problem - Blum - 1986
12	Tarjan, "Fast algorithms for finding nearest common ancestors - Harel, E - 1984
8	An information-theoretical approach to time-bounds for on-line computation - Paul, Seiferas, et al. - 1981
7	On a theory of computation over the real numbers; np completeness, recursive functions and universal machines (extended abstract - Blum, Shub, et al. - 1988
6	Kolmogorov complexity and lower bounds - Paul - 1979
5	Two nonlinear lower bounds for on-line computations - Duris, Galil, et al. - 1984
4	Three approaches to the definition of the concept of `amount of information - Kolmogorov - 1965
4	Tarjan, "Planar point location using persistent search trees - Sarnak, E - 1986
4	Tarjan, "A class of algorithms which require nonlinear time to maintain disjoint sets - E - 1979
3	bounds on the complexity of multidimensional searching,Tech - Chazelle - 1986
2	Reckhow, "Time bounded random access machines - Cook, A - 1973
2	Rekursive Funktionen und ihre Komplexit"at. Teubner - Schnorr - 1974
1	On adresses versus pointers," manuscript. [5] A. M. Ben-Amram, On Pointers versus Addreses - Ben-Amram - 1988
1	On the power of shifing integers," manuscript. [8] M. Ben-Or, "Lower bounds on algebraic computation trees - Ben-Amram, Galil - 1983