Entry DiIanni:1998:EDR 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{DiIanni:1998:EDR,
author = "Miriam {Di Ianni}",
title = "Efficient delay routing",
journal = j-THEOR-COMP-SCI,
volume = "196",
number = "1--2",
pages = "131--151",
day = "06",
month = apr,
year = "1998",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Oct 26 09:00:49 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
acknowledgement = ack-nhfb,
classification = "C4240C (Computational complexity); C4240P (Parallel
programming and algorithm theory)",
corpsource = "Ist. di Elettronica, Perugia Univ., Italy",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; delay routing; delays;
hardness; packet routing schemes; parallel algorithms;
polynomial-time algorithms; sublinear error",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
}
Related entries
- delay,
162(2)323,
176(1)205,
178(1)119,
191(1)61,
195(2)155,
196(1)131-1,
198(1)131,
204(1)11,
205(1)297
- efficient,
140(2)291,
145(1)357,
147(1)19,
147(1)249,
162(2)297,
168(1)121,
173(1)113,
180(1)169,
181(2)247,
187(1)231,
196(1)71,
196(1)131-1,
196(1)259,
201(1)233,
203(1)123,
203(2)175,
226(1)105,
226(1)173
- error,
134(1)51,
148(1)141,
148(2)325,
149(1)129,
156(1)1,
157(2)277,
161(1)235,
162(1)151,
176(1)89,
182(1)217,
188(1)79,
203(1)163
- hardness,
180(1)243,
209(1)287,
209(1)347,
221(1)3
- packet,
158(1)53,
178(1)103,
185(2)347
- polynomial-time,
137(1)129,
137(2)279,
141(1)109,
141(1)175,
145(1)147,
145(1)241,
145(1)371,
148(2)207,
148(2)325,
150(1)1,
155(2)447,
158(1)221,
172(1)209,
174(1)23,
181(1)159,
181(2)229,
184(1)237,
185(1)191,
191(1)215,
193(1)149,
194(1)137,
207(1)89
- routing,
155(1)141,
158(1)53,
163(1)161,
185(2)347,
186(1)171,
196(1)131-1,
196(1)181,
203(1)31,
205(1)115,
220(2)469,
221(1)19,
221(1)119
- schemes,
154(2)283,
160(1)1,
165(2)407,
186(1)171,
188(1)221,
190(1)61,
200(1)313,
205(1)115,
226(1)173
- sublinear,
197(1)189,
218(1)197
- time, polynomial-,
137(1)129,
137(2)279,
141(1)175,
145(1)147,
145(1)241,
145(1)371,
148(2)207,
148(2)325,
150(1)1,
155(2)447,
158(1)221,
172(1)209,
174(1)23,
181(1)159,
184(1)237,
185(1)191,
191(1)215,
193(1)149,
194(1)137,
207(1)89