Entry Berman:1997:NOP 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{Berman:1997:NOP,
author = "Piotr Berman and Andrzej Lingas",
title = "A nearly optimal parallel algorithm for the {Voronoi}
diagram of a convex polygon",
journal = j-THEOR-COMP-SCI,
volume = "174",
number = "1--2",
pages = "193--202",
day = "15",
month = mar,
year = "1997",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:20:42 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1997&volume=174&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=1997&volume=174&issue=1-2&aid=2227",
acknowledgement = ack-nhfb,
classification = "C4240C (Computational complexity); C4240P (Parallel
programming and algorithm theory); C4260 (Computational
geometry)",
corpsource = "Dept. of Comput. Sci., Pennsylvania State Univ.,
University Park, PA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computation time; computational complexity;
computational geometry; concurrent write; convex
polygon; CRCW PRAM algorithm; CRCW PRAM model;
duration-unknown task scheduling problem; integer
sorting subroutine; medial axis construction; nearly
optimal parallel algorithm; parallel algorithms;
processor scheduling; processors; randomized algorithm;
sorting; termination probability; vertices; Voronoi
diagram",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- C4260,
137(1)145,
137(2)177,
140(2)205,
140(2)249,
140(2)265,
140(2)291,
140(2)301,
141(1)337,
143(1)113,
143(1)175,
143(2)189,
143(2)309,
143(2)343,
145(1)27,
145(1)241,
145(1)329,
145(1)381,
147(1)211,
148(1)57,
148(1)93,
151(1)257,
155(2)321,
156(1)1,
156(1)159,
157(1)35,
157(1)53,
157(1)z,
157(2)185,
159(1)103,
159(1)105,
159(1)129,
159(1)137,
162(2)351,
163(1)303,
164(1)59,
164(1)165,
168(1)121,
169(2)147,
172(1)121,
172(1)175,
172(1)209,
172(1)233,
172(1)265,
175(2)239,
180(1)363,
181(1)3,
181(1)57,
181(1)91,
181(1)107,
182(1)233,
186(1)1,
188(1)59,
188(1)129,
191(1)193,
194(1)z,
197(1)203
- concurrent,
138(2)391,
139(1)243,
140(1)95,
140(2)319,
141(1)195,
153(1)245,
155(1)179,
166(1)1,
170(1)1,
172(1)309,
173(1)49,
173(1)209,
173(1)235,
174(1)67,
177(1)111,
177(2)425,
179(1)61,
179(1)333,
179(1)353,
179(1)397,
183(2)187,
183(2)229,
183(2)253,
183(2)281,
189(1)109,
189(1)229,
190(1)61,
192(2)259,
193(1)113,
193(1)197,
194(1)241,
194(1)245,
194(1)246-1,
195(2)259,
196(1)319,
202(1)1,
227(1)185,
254(1)691
- construction,
135(1)67,
143(1)73,
143(2)189,
143(2)251,
144(1)67,
153(1)3,
153(1)171,
155(2)291,
155(2)439,
156(1)203,
156(1)263,
161(1)1,
166(1)263,
169(1)67,
169(2)123,
173(2)349,
173(2)485,
176(1)39,
183(2)253,
192(2)233,
194(1)240,
194(1)247,
199(1)25,
204(1)205,
212(1)261,
217(2)175,
266(1)997
- convex,
138(1)3,
140(2)205,
141(1)337,
155(2)321,
157(2)185,
159(1)65,
188(1)59,
193(1)1,
196(1)395,
197(1)203,
218(2)273
- CRCW,
143(2)309,
147(1)249,
154(2)225,
155(2)411,
164(1)1,
164(1)299,
175(2)393,
188(1)221,
205(1)231
- diagram,
137(1)145,
140(2)265,
141(1)283,
145(1)45,
166(1)1,
180(1)47,
194(1)247-2,
204(1)55
- integer,
127(2)287,
147(1)87,
148(1)33,
154(1)3,
158(1)65,
160(1)305,
167(1)131,
168(2)267,
172(1)255,
172(1)303,
173(1)151,
174(1)137,
174(1)247,
182(1)217,
185(1)63,
193(1)129,
197(1)57,
208(1)149,
209(1)287
- Lingas, Andrzej,
141(1)337,
181(2)307
- nearly,
203(1)143
- optimal,
143(1)73,
143(1)123,
145(1)27,
147(1)1,
154(2)283,
154(2)367,
156(1)177,
157(2)161,
157(2)215,
159(2)191,
162(2)323,
163(1)239,
164(1)107,
164(1)299,
165(2)441,
166(1)221,
168(2)367,
172(1)265,
178(1)225,
180(1)243,
180(1)309,
182(1)217,
185(2)347,
188(1)1,
188(1)221,
196(1)3,
196(1)395,
197(1)189,
197(1)203,
197(1)242-2,
200(1)261,
203(2)205,
205(1)243,
210(2)341,
215(1)69,
220(2)363,
221(1)119,
222(1)113,
225(1)163,
227(1)79
- polygon,
140(2)249,
140(2)291,
145(1)159
- PRAM,
143(2)309,
147(1)1,
147(1)249,
154(2)225,
155(2)349,
158(1)1,
162(2)245,
163(1)211,
164(1)1,
164(1)107,
164(1)299,
168(1)121,
169(1)67,
172(1)1,
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
- probability,
138(2)315,
144(1)125,
144(1)161,
144(1)221,
147(1)267,
148(1)19,
148(1)133,
149(1)67,
152(2)219,
155(1)141,
155(2)349,
156(1)39,
156(1)315,
157(2)277,
159(1)65,
159(1)81,
164(1)107,
171(1)147,
172(1)43,
176(1)1,
181(1)45,
184(1)237,
188(1)1,
191(1)215,
193(1)53,
202(1)1,
207(1)245,
219(1)421,
254(1)691
- processor,
140(2)333,
141(1)1,
146(1)69,
146(1)109,
147(1)1,
147(1)69,
147(1)249,
154(2)225,
155(1)141,
155(2)349,
155(2)411,
162(2)225,
162(2)323,
162(2)341,
168(1)121,
169(1)39,
173(1)209,
178(1)119,
178(1)265,
179(1)251,
179(1)381,
181(2)357,
181(2)379,
183(2)281,
186(1)171,
188(1)221,
190(2)211,
196(1)347
- randomized,
137(1)145,
148(1)133,
154(1)23,
154(2)225,
158(1)53,
162(2)245,
169(2)147,
180(1)17,
181(2)229,
182(1)233,
191(1)97,
194(1)163,
196(1)3,
207(2)329
- scheduling,
144(1)277,
145(1)329,
147(1)1,
162(2)225,
162(2)323,
162(2)341,
164(1)73,
173(1)209,
178(1)119,
178(1)265,
181(2)357,
183(2)281,
191(1)205,
196(1)347,
196(1)395,
215(1)137,
215(1)209,
220(1)157
- sorting,
145(1)111,
145(1)189,
154(2)225,
157(1)35,
163(1)211,
163(1)239,
164(1)1,
165(2)311,
183(2)187,
188(1)241,
196(1)3,
196(1)109
- subroutine,
192(2)201
- task,
144(1)277,
145(1)271,
162(2)323,
171(1)111,
178(1)119,
194(1)163,
196(1)319,
196(1)347,
215(1)209
- termination,
139(1)355,
142(2)179,
142(2)257,
149(2)361,
151(2)487,
152(1)139,
165(1)97,
175(1)127,
175(1)159,
176(1)235,
177(2)407,
190(1)3,
192(1)31,
212(1)247
- vertex,
140(2)265,
145(1)27,
147(1)249,
154(2)247,
157(2)161,
158(1)117,
172(1)233,
172(1)265,
174(1)23,
175(2)239,
225(1)113
- Voronoi,
137(1)145,
140(2)205,
140(2)265
- write,
196(1)259,
220(1)267