Entry Patt-Shamir:1993:TST 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{Patt-Shamir:1993:TST,
author = "Boaz Patt-Shamir and David Peleg",
title = "Time-space tradeoffs for set operations",
journal = j-THEOR-COMP-SCI,
volume = "110",
number = "1",
pages = "99--129",
day = "15",
month = mar,
year = "1993",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:17:02 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1993&volume=110&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=1993&volume=110&issue=1&aid=1143",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Appl. Math., Weizmann Inst., Rehovot,
Israel",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "comparison branching programs; computational
complexity; element distinctness; R-way branching
program model; set complementation; set disjointness;
set equality; set inclusion; set intersection; set
operations; set union; space requirement; time
requirement; time-space tradeoffs; where in $n=O((\log
n)^{-1/2})$",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
}
Related entries
- branching,
74(3)313,
75(3)263,
89(1)161,
96(1)35,
96(1)z,
107(1)121,
114(2)273,
124(1)169
- comparison,
72(2)251,
83(2)275,
87(2)263,
92(1)3,
95(2)231,
103(1)137,
110(1)145,
124(1)1
- complementation,
132(1)71
- disjointness,
106(2)385
- element,
70(2)233,
74(2)163,
79(2)357,
96(2)325,
97(1)67,
111(1)89,
119(2)267,
123(1)89,
123(2)407,
129(2)397
- equality,
75(3)335,
80(2)263,
87(1)203,
94(1)1,
98(1)5,
98(1)41,
102(2)355,
114(2)273,
120(1)1,
122(1)225,
134(2)329
- inclusion,
71(3)281,
82(2)215,
91(1)85,
93(1)43,
95(1)143,
97(2)217,
126(2)183,
133(1)15,
134(2)365
- intersection,
81(2)295,
95(1)143,
98(1)5,
98(1)79,
99(2)177,
100(2)303,
102(1)135,
126(2)183,
129(2)397
- operation,
71(3)425,
72(2)203,
73(2)213,
76(2)261,
77(1)27,
78(2)377,
79(2)357,
84(2)293,
87(1)43,
88(1)127,
88(1)139,
89(2)207,
91(1)71,
92(1)49,
95(2)245,
99(2)243,
101(2)177,
103(2)283,
105(2)217,
107(2)333,
109(1)257,
110(2)405,
111(1)89,
112(2)291,
115(1)131,
116(1)33,
116(1)195,
117(1)39,
117(1)187,
117(1)289,
119(1)23,
119(1)103,
119(2)355,
125(2)229,
125(2)315,
125(2)345,
126(2)183,
127(2)255,
129(2)397,
130(1)49,
130(1)73,
130(1)125,
132(1)129,
133(1)141,
133(2)421
- requirement,
71(1)3,
82(2)253,
119(2)355,
120(2)311,
130(1)49
- 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,
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,
130(1)203,
132(1)319,
133(1)49,
134(1)131,
134(2)529,
135(2)171
- space, time-,
92(1)33,
107(1)121,
113(1)55,
132(1)435
- time-space,
92(1)33,
107(1)121,
113(1)55,
132(1)435
- tradeoff,
82(1)157,
100(1)253,
106(1)21,
107(1)121
- union,
74(3)325,
76(1)53,
76(2)273,
76(2)309,
77(3)291,
79(1)137,
88(2)351,
91(2)239,
97(2)217,
99(2)177,
113(2)293,
116(1)33,
124(2)195,
126(1)31,
126(2)183,
131(2)311,
132(1)71,
134(1)225,
136(2)333
- where,
107(2)349