Entry Levcopoulos:1996:EFI 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{Levcopoulos:1996:EFI,
author = "Christos Levcopoulos and Ola Petersson",
title = "Exploiting few inversions when sorting: {Sequential}
and parallel algorithms",
journal = j-THEOR-COMP-SCI,
volume = "163",
number = "1--2",
pages = "211--238",
day = "30",
month = aug,
year = "1996",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:20:10 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=163&issue=1-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=163&issue=1-2&aid=2197",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics)C6130 (Data
handling techniques); C4240C (Computational
complexity); C4240P (Parallel programming and algorithm
theory)",
corpsource = "Dept. of Comput. Sci., Lund Univ., Sweden",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; EREW PRAM; input sequence;
parallel algorithms; presortedness; sequential
algorithms; sorting",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
}
Related entries
- EREW,
158(1)1,
164(1)107,
175(2)393,
178(1)225
- Exploiting,
162(2)245
- few,
221(1)77
- 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)239,
163(1)259,
164(1)73,
165(2)311,
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
- input,
138(1)101,
138(2)391,
141(1)269,
143(1)123,
148(1)33,
154(1)57,
156(1)39,
156(1)281,
160(1)305,
172(1)1,
172(1)293,
178(1)103,
182(1)145
- inversion,
148(1)19
- PRAM,
143(2)309,
147(1)1,
147(1)249,
154(2)225,
155(2)349,
158(1)1,
162(2)245,
164(1)1,
164(1)107,
164(1)299,
168(1)121,
169(1)67,
172(1)1,
174(1)193,
175(2)393,
178(1)225,
179(1)381,
180(1)169,
180(1)287,
181(2)267,
188(1)221,
194(1)225,
196(1)3,
196(1)109,
205(1)231
- sequence,
139(1)27,
143(2)335,
144(1)101,
145(1)291,
145(1)317,
147(1)31,
148(1)1,
150(1)77,
151(1)163,
151(1)277,
155(2)321,
156(1)39,
158(1)35,
158(1)65,
158(1)81,
161(1)289,
163(1)193,
164(1)165,
165(2)233,
165(2)295,
168(2)267,
168(2)337,
170(1)349,
174(1)67,
174(1)171,
174(1)259,
178(1)155,
180(1)115,
180(1)203,
182(1)145,
182(1)233,
183(1)143,
184(1)61,
185(1)3,
188(1)161,
188(1)195,
191(1)185,
191(1)245,
194(1)240,
194(1)241-2,
194(1)244-2,
197(1)244-1,
205(1)337,
207(2)343,
207(2)363,
209(1)179,
209(1)261,
209(1)377,
210(2)305,
210(2)341,
215(1)31,
218(1)3,
218(1)177,
221(1)41,
225(1)185
- sequential,
138(2)243,
138(2)273,
138(2)315,
140(2)291,
152(2)219,
160(1)1,
162(2)297,
165(1)75,
168(1)121,
169(1)39,
174(1)269,
177(1)3,
177(1)59,
177(2)329,
178(1)237,
179(1)61,
186(1)107,
191(1)131,
192(2)233,
192(2)259,
194(1)245,
196(1)71,
197(1)189,
221(1)251
- sorting,
145(1)111,
145(1)189,
154(2)225,
157(1)35,
163(1)239,
164(1)1,
165(2)311,
174(1)193,
183(2)187,
188(1)241,
196(1)3,
196(1)109
- when,
159(2)355