Entry Miltersen:1994:CMI from tcs1990.bib
Last update: Wed Sep 26 02:11:46 MDT 2018
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{Miltersen:1994:CMI,
author = "Peter Bro Miltersen and Sairam Subramanian and Jeffrey
Scott Vitter and Roberto Tamassia",
title = "Complexity models for incremental computation",
journal = j-THEOR-COMP-SCI,
volume = "130",
number = "1",
pages = "203--236",
day = "01",
month = aug,
year = "1994",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:18:17 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1994&volume=130&issue=1;
http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1994&volume=130&issue=1&aid=1640",
acknowledgement = ack-nhfb,
classification = "B1100 (Circuit theory); B1265Z (Other digital
circuits); C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Aarhus Univ., Denmark",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "circuit theory; circuit-value; common
LOGSPACE-complete problems; comparator gates;
comparators (circuits); complexity classes; complexity
theoretic approach; computational complexity; efficient
dynamic solutions; incr-POLYLOGTIME-complete;
incremental computation; incremental efficiency;
incremental time complexity; incrementally complete
problems; intuitive notion; LOGSPACE; lower bounding;
network-stability problems; NLOGSPACE; nonuniform
model; nonuniform NC; NRP-completeness; restrictions
problems; sequential space complexity",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- approach,
71(2)209,
71(3)347,
79(1)179,
80(1)105,
81(1)65,
85(2)253,
85(2)305,
90(1)37,
93(1)91,
97(1)1,
100(2)385,
101(2)265,
104(2)263,
109(1)123,
109(1)181,
112(1)53,
119(1)23,
128(1)63,
128(1)159,
129(1)167,
129(2)337,
131(2)271,
133(1)105,
133(2)387,
135(2)171,
135(2)267,
136(1)183
- bounding,
132(1)387
- circuit,
78(2)357,
79(1)25,
81(2)257,
82(1)85,
82(1)157,
84(2)225,
85(1)155,
86(2)343,
90(1)235,
93(2)185,
93(2)303,
95(2)207,
97(2)285,
98(2)289,
99(2)213,
100(1)253,
101(1)133,
102(2)215,
102(2)307,
107(1)77,
107(1)95,
107(1)121,
112(2)291,
113(1)167,
116(2)415,
123(2)389,
125(2)295,
132(1)347
- common,
78(2)363,
83(2)287,
87(1)43,
88(1)59,
92(1)3,
92(1)191,
92(1)z,
108(2)345,
108(2)365,
125(1)91,
125(2)205
- complete,
70(1)127,
70(2)233,
71(3)347,
72(2)265,
74(1)3,
75(1)85,
75(1)z,
75(3)357,
76(2)179,
80(2)203,
81(1)1,
83(2)337,
85(1)75,
87(1)1,
88(1)33,
88(1)83,
89(2)207,
91(1)101,
94(2)281,
96(2)305,
97(2)183,
98(1)27,
98(1)z,
100(2)365,
102(1)135,
104(2)263,
111(1)125,
111(1)z,
112(2)255,
114(1)63,
114(2)231,
118(2)167,
118(2)315,
119(1)127,
119(1)z,
120(1)83,
121(1)351,
122(1)97,
124(1)1,
129(2)309,
131(1)95,
131(2)311,
132(1)229,
133(2)205,
134(1)27,
136(2)487,
136(2)507
- digital,
74(2)163,
79(1)151,
84(2)225,
85(1)117,
95(1)169,
95(2)207,
100(1)243,
123(2)291,
129(2)407,
133(1)35
- dynamic,
72(2)97,
72(2)147,
72(2)z,
74(1)95,
76(1)115,
79(1)151,
79(2)341,
84(1)127,
87(1)43,
87(1)189,
89(1)161,
90(1)95,
90(2)355,
91(2)181,
92(1)49,
92(1)z,
92(2)291,
93(2)201,
94(1)141,
94(2)223,
94(2)335,
95(1)1,
97(1)1,
106(2)361,
110(1)215,
116(2)359,
119(1)63,
119(1)223,
119(2)331,
124(1)127,
127(2)387,
128(1)179,
129(2)279,
129(2)397,
130(1)49,
131(2)295,
133(2)205,
134(1)79,
136(1)217
- efficiency,
79(1)241,
80(2)337,
81(2)201,
116(1)195
- efficient,
71(1)95,
74(3)299,
76(2)223,
77(3)291,
78(1)245,
80(1)53,
91(1)1,
91(1)57,
99(2)265,
106(1)21,
108(2)331,
116(1)195,
116(2)305,
119(2)247,
129(2)293,
133(2)361,
134(2)493
- gate,
85(1)155,
86(2)343,
93(2)303,
97(2)285,
102(2)307,
107(1)63,
113(1)167,
133(1)23
- incremental,
71(2)209,
92(2)319,
133(2)387
- intuitive,
88(1)15
- LOGSPACE,
100(1)45
- lower,
74(3)313,
81(2)237,
82(1)113,
82(1)157,
83(2)169,
92(1)191,
93(2)279,
96(2)411,
97(2)285,
102(2)215,
106(2)351,
108(2)271,
111(1)59,
112(2)355,
112(2)419,
113(1)75,
116(2)415,
119(2)267,
123(2)389,
125(2)373,
127(2)395,
128(1)63,
129(2)279,
130(1)17,
130(1)49,
130(1)73,
130(1)163,
130(1)175,
131(2)243,
131(2)331,
133(1)23,
134(1)253
- NC,
71(3)401,
116(1)95,
125(2)295
- nonuniform,
85(2)305,
96(2)305,
99(2)279,
101(1)99,
115(2)277
- notion,
87(1)115,
87(2)347,
90(1)253,
100(2)267,
101(2)265,
112(1)99,
115(1)77,
116(1)59,
121(1)59,
127(2)351
- other,
71(2)177,
71(2)193,
71(2)209,
71(2)227,
71(2)z,
73(2)231,
74(1)95,
74(2)163,
74(2)183,
74(3)253,
77(1)73,
77(1)195,
78(1)3,
80(1)105,
80(2)303,
81(2)237,
84(1)77,
84(1)127,
86(2)205,
90(2)271,
92(2)249,
100(1)105,
104(2)299,
108(2)291,
112(2)383,
121(1)351,
122(1)165,
123(2)291,
125(2)329,
128(1)99,
129(2)279,
129(2)407,
130(1)17,
133(1)15
- restriction,
93(2)265,
102(1)135,
114(1)119,
120(1)83,
127(2)351
- sequential,
71(2)209,
73(3)319,
76(1)93,
76(2)285,
76(2)331,
76(2)343,
77(1)97,
88(1)1,
88(1)59,
94(1)125,
101(2)177,
103(2)235,
107(2)357,
109(1)181,
118(1)81,
119(2)311,
124(1)1,
132(1)1,
134(1)119
- solution,
74(3)329,
81(1)49,
91(1)57,
125(1)111,
127(2)313,
128(1)179,
129(1)1,
131(1)121,
131(2)311,
133(1)23,
134(1)131
- space,
70(1)159,
70(2)233,
71(3)347,
73(1)1,
74(1)115,
74(2)183,
74(3)273,
75(1)15,
75(1)85,
76(2)179,
77(3)221,
80(2)289,
82(1)1,
82(1)165,
85(2)353,
86(1)3,
87(1)1,
87(1)43,
88(1)83,
91(1)1,
92(1)3,
92(1)33,
92(1)87,
93(1)143,
93(2)201,
94(2)175,
95(2)231,
95(2)245,
96(1)157,
96(1)z,
96(2)411,
97(2)183,
99(1)121,
101(1)99,
101(2)239,
103(2)283,
110(1)99,
111(1)89,
111(1)103,
111(1)191,
111(1)z,
113(2)191,
114(2)273,
119(1)63,
123(1)139,
124(1)1,
124(2)195,
124(2)343,
125(2)295,
125(2)345,
125(2)355,
127(1)171,
127(2)199,
129(2)397,
130(1)85,
132(1)319,
133(1)49,
134(1)131,
134(2)529,
135(2)171
- Tamassia, Roberto,
119(2)331
- theoretic,
70(1)127,
79(2)359,
80(2)125,
116(2)339,
121(1)59,
123(2)389