Entry Feige:1996:FRL 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{Feige:1996:FRL,
author = "Uriel Feige",
title = "A fast randomized {LOGSPACE} algorithm for graph
connectivity",
journal = j-THEOR-COMP-SCI,
volume = "169",
number = "2",
pages = "147--160",
day = "05",
month = dec,
year = "1996",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:20:29 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=169&issue=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=1996&volume=169&issue=2&aid=2321",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240C
(Computational complexity); C4260 (Computational
geometry)",
conflocation = "Jerusalem, Israel; 11-14 July 1994",
conftitle = "21st International Colloquium on Automata, Languages,
and Programming",
corpsource = "Dept. of Appl. Math. and Comput. Sci., Weizmann Inst.
of Sci., Rehovot, Israel",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; computational geometry; fast
randomized LOGSPACE algorithm; graph connectivity;
graph reachability; logarithmic space; polynomial time;
random walk; randomised algorithms; randomized
algorithm; reachability algorithm; undirected graph
reachability",
pubcountry = "Netherlands",
sponsororg = "Eur. Assoc. Theor. Comput. Sci",
treatment = "P Practical; 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,
172(1)121,
172(1)175,
172(1)209,
172(1)233,
172(1)265,
174(1)193,
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
- connectivity,
164(1)287,
173(1)151,
203(2)253
- fast,
137(2)269,
140(2)265,
147(1)211,
154(1)3,
155(2)349,
162(1)133,
164(1)1,
164(1)59,
205(1)307,
210(1)199,
215(1)89
- logarithmic,
144(1)67,
159(1)43,
196(1)395,
207(1)217
- LOGSPACE,
149(1)67,
155(1)111,
175(1)183,
228(1)151
- random,
143(1)73,
144(1)67,
144(1)125,
144(1)277,
145(1)381,
147(1)267,
148(1)19,
152(2)171,
152(2)219,
154(1)23,
156(1)301,
159(1)5,
159(1)29,
159(1)43,
162(1)151,
162(2)341,
164(1)107,
175(2)393,
178(1)155,
190(2)151,
191(1)185,
196(1)3,
196(1)109,
201(1)281,
207(2)343,
207(2)387,
215(1)1,
218(2)219,
218(2)233,
218(2)263,
219(1)287,
226(1)29,
229(1)103
- randomised,
148(1)133,
154(1)23,
154(2)225,
157(1)35,
158(1)53,
180(1)17,
181(1)45,
182(1)233,
191(1)215,
194(1)163,
196(1)181
- randomized,
137(1)145,
148(1)133,
154(1)23,
154(2)225,
158(1)53,
162(2)245,
174(1)193,
180(1)17,
181(2)229,
182(1)233,
191(1)97,
194(1)163,
196(1)3,
207(2)329
- reachability,
138(1)3,
138(1)35,
147(1)117,
148(2)261,
148(2)281,
153(1)49,
165(2)391,
168(1)121,
172(1)121,
174(1)97,
174(1)217,
176(1)39,
179(1)301,
183(2)215,
198(1)211,
221(1)211
- undirected,
159(1)65,
161(1)289,
162(2)297,
172(1)121,
180(1)169,
181(1)107,
192(1)3
- walk,
145(1)381,
161(1)289,
187(1)179,
187(1)z,
218(2)249