Entry Karchmer:1986:TTS from tcs1985.bib
Last update: Thu Sep 27 02:46:57 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{Karchmer:1986:TTS,
author = "M. Karchmer",
title = "Two time-space tradeoffs for element distinctness",
journal = j-THEOR-COMP-SCI,
volume = "47",
number = "3",
pages = "237--246",
month = "????",
year = "1986",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Comput. Sci., Hebrew Univ., Jerusalem,
Israel",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Boolean function; Boolean functions; branching
program; computational complexity; element
distinctness; k-headed Turing machine; linear queries;
low-level computational complexity; minimum operations;
time-space tradeoffs; Turing machines",
pubcountry = "Netherlands A01",
treatment = "T Theoretical or Mathematical",
}
Related entries
- boolean,
35(2)313,
36(1)59,
36(1)119,
36(2)239,
36(2)291,
36(2)333,
38(1)55,
38(1)133,
38(2)343,
40(2)275,
43(1)43,
43(2)201,
44(2)127,
44(3)247,
47(1)61,
48(1)53,
49(1)1,
51(1)53,
52(1)59,
52(3)239,
53(2)267,
54(1)65,
55(2)291,
56(3)345,
57(1)97,
57(1)113,
59(1)85,
61(2)307,
64(3)271,
64(3)331,
66(1)15,
66(1)113,
68(1)19
- branching,
36(1)71,
38(2)269,
43(2)345,
46(2)175,
48(1)53,
59(1)115,
62(3)319,
64(1)39,
64(3)331
- element,
40(1)3,
40(2)275,
41(1)81,
49(1)13,
51(1)239,
52(1)77,
53(2)201,
55(2)265
- linear,
35(1)109,
35(2)261,
37(2)123,
38(1)69,
39(1)69,
39(1)z,
40(1)31,
40(1)67,
40(2)195,
40(2)257,
41(2)231,
41(2)325,
43(1)11,
43(2)345,
47(3)277,
47(3)329,
48(1)35,
49(1)81,
50(1)1,
54(1)65,
54(2)199,
57(2)161,
57(2)317,
58(1)209,
59(0)3,
59(1)157,
59(3)309,
60(3)255,
60(3)341,
63(3)275,
64(1)97,
64(2)135,
64(2)159,
65(2)221,
65(2)243,
65(2)z,
67(1)55,
68(3)333
- minimum,
58(1)379,
60(3)231,
61(2)307,
63(1)91,
66(2)181
- operation,
35(2)271,
36(2)291,
36(2)333,
39(2)327,
40(2)257,
42(2)123,
48(2)145,
48(2)273,
49(2)185,
51(3)281,
52(1)1,
52(3)251,
55(2)183,
55(2)265,
58(1)175,
60(3)297,
61(2)199,
62(1)3,
62(3)235,
64(1)119,
64(3)221,
66(2)157,
68(1)71
- query,
40(2)237,
46(1)67,
47(1)61,
52(3)281,
62(0)3,
62(1)67,
62(1)187,
62(3)251,
63(2)185,
63(3)253,
66(1)105,
69(1)1
- space, time-,
43(2)345
- time-space,
43(2)345
- tradeoff,
58(1)57,
63(2)203
- Turing,
35(2)191,
35(2)215,
36(2)341,
37(1)1,
40(2)175,
41(2)331,
43(1)43,
43(1)107,
44(1)1,
44(1)111,
47(2)131,
51(3)265,
52(1)15,
52(3)251,
52(3)341,
53(2)307,
54(2)325,
54(2)331,
55(2)291,
57(1)47,
58(1)175,
58(1)263,
61(2)149,
66(3)289,
67(1)5,
67(1)99,
68(1)19,
68(2)123
- two,
37(1)51,
38(2)167,
40(2)319,
46(1)101,
47(2)191,
49(1)81,
58(1)17,
58(1)361,
61(1)67,
62(3)235,
63(1)1,
63(2)141,
63(2)157,
64(1)39,
66(3)233