Entry Munro:1996:SRO from tcs1995.bib
Last update: Sun Oct 15 02:56:11 MDT 2017
Top |
Symbols |
Numbers |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Munro:1996:SRO,
author = "J. Ian Munro and Venkatesh Raman",
title = "Selection from read-only memory and sorting with
minimum data movement",
journal = j-THEOR-COMP-SCI,
volume = "165",
number = "2",
pages = "311--323",
day = "10",
month = oct,
year = "1996",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:20:16 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=165&issue=2;
http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1996&volume=165&issue=2&aid=2166",
acknowledgement = ack-nhfb,
classification = "C4240C (Computational complexity); C6130 (Data
handling techniques)",
corpsource = "Dept. of Comput. Sci., Waterloo Univ., Ont., Canada",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "average case algorithm; computational complexity; data
organization; read-only memory; sorting; sorting with
minimum data movement; time-space tradeoffs; worst case
algorithm",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- average,
147(1)267,
164(1)277,
191(1)245,
193(1)149,
200(1)261,
218(1)197
- C6130,
137(2)269,
141(1)53,
144(1)161,
145(1)345,
147(1)19,
147(1)165,
157(1)35,
157(1)115,
163(1)145,
163(1)239,
163(1)259,
164(1)73,
178(1)129,
180(1)203,
181(1)159,
187(1)105,
187(1)117,
187(1)123,
187(1)147,
187(1)203,
187(1)221,
187(1)231,
187(1)249,
187(1)263,
187(1)z,
188(1)231,
188(1)241,
190(2)115
- case,
137(1)159,
141(1)195,
145(1)189,
147(1)267,
164(1)59,
166(1)221,
176(1)39,
176(1)67,
180(1)181,
181(1)3,
183(2)157,
191(1)245,
201(1)171,
210(2)341
- handling,
137(2)269,
140(2)231,
141(1)53,
142(2)141,
144(1)161,
145(1)345,
147(1)19,
147(1)165,
151(1)37,
155(2)439,
157(1)35,
157(1)115,
158(1)279,
160(1)365,
161(1)235,
163(1)145,
163(1)211,
163(1)239,
163(1)259,
164(1)73,
166(1)101,
171(1)3,
171(1)221,
171(1)247,
173(1)3,
173(1)89,
173(1)113,
173(1)151,
173(1)183,
173(1)209,
173(1)235,
173(1)253,
173(1)283,
178(1)129,
179(1)273,
180(1)203,
181(1)159,
183(2)281,
187(1)105,
187(1)117,
187(1)123,
187(1)147,
187(1)203,
187(1)221,
187(1)231,
187(1)249,
187(1)263,
187(1)z,
188(1)231,
188(1)241,
190(2)115,
192(1)77,
192(1)107,
192(2)259,
193(1)149,
197(1)243
- memory,
140(1)179,
143(1)73,
147(1)1,
149(2)257,
155(2)349,
162(2)245,
168(2)303,
175(2)393,
180(1)341,
181(1)75,
186(1)199,
196(1)3,
196(1)109,
196(1)215,
196(1)365
- minimum,
140(2)291,
147(1)69,
158(1)117,
163(1)269,
174(1)23,
175(2)309,
181(1)57,
181(2)267,
181(2)347,
185(2)319,
188(1)1,
194(1)207,
206(1)301,
225(1)113
- organization,
164(1)73,
168(1)21
- selection,
151(2)353,
167(1)95
- sorting,
145(1)111,
145(1)189,
154(2)225,
157(1)35,
163(1)211,
163(1)239,
164(1)1,
174(1)193,
183(2)187,
188(1)241,
196(1)3,
196(1)109
- space, time-,
147(1)19
- time-space,
147(1)19
- tradeoff,
161(1)235,
181(1)141
- worst,
137(1)159,
145(1)189,
164(1)59,
181(1)3