Entry Goles:1997:UCF 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{Goles:1997:UCF,
author = "Eric Goles and Maurice Margenstern",
title = "Universality of the chip-firing game",
journal = j-THEOR-COMP-SCI,
volume = "172",
number = "1--2",
pages = "121--134",
day = "10",
month = feb,
year = "1997",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:20:35 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1997&volume=172&issue=1-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=1997&volume=172&issue=1-2&aid=2183",
acknowledgement = ack-nhfb,
classification = "B0240E (Game theory); B0250 (Combinatorial
mathematics); C1140E (Game theory); C1160
(Combinatorial mathematics); C4260 (Computational
geometry)",
corpsource = "Dept. Ingenieria Matematica, Chile Univ., Santiago,
Chile",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "chip-firing game universality; computational geometry;
exponential cycles; exponential transient time; finite
graphs; game theory; graph theory; parallel updating;
periodic configurations; reachability problem;
two-register machine; undirected graphs",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
xxauthor = "E. Goles and M. Margenstem",
}
Related entries
- B0240E,
137(2)253,
141(1)133,
143(1)93,
143(2)319,
148(1)111,
156(1)263,
157(2)161,
157(2)215,
159(1)137,
163(1)99,
164(1)253,
174(1)97,
174(1)247,
180(1)1,
182(1)217,
191(1)157,
197(1)203,
197(1)241
- B0250,
141(1)133,
141(1)351,
143(1)93,
144(1)3,
144(1)67,
144(1)161,
144(1)277,
148(1)121,
148(1)165,
152(2)305,
153(1)129,
153(1)171,
153(1)245,
154(2)165,
156(1)263,
159(1)29,
174(1)97,
176(1)347,
178(1)103,
181(1)181,
187(1)49,
187(1)167,
188(1)231,
191(1)157
- C1140E,
137(2)253,
141(1)133,
142(2)229,
143(1)93,
143(2)319,
148(1)111,
156(1)263,
157(2)161,
157(2)215,
158(1)343,
159(1)137,
163(1)99,
164(1)253,
174(1)97,
174(1)247,
175(2)283,
180(1)1,
182(1)217,
191(1)157,
197(1)203,
197(1)241,
197(1)245-2
- 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,
169(2)147,
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
- configuration,
148(1)157,
188(1)129,
194(1)123,
221(1)211
- cycle,
143(1)1,
143(2)189,
168(1)121,
174(1)217,
191(1)245,
194(1)241-1,
204(1)233
- exponential,
154(1)23,
154(1)57,
155(1)141,
161(1)263,
168(1)3,
183(2)215,
186(1)107
- Goles, Eric,
168(2)405,
181(1)1,
188(1)129,
218(2)285
- Margenstern, Maurice,
168(2)213
- periodic,
127(2)287,
143(2)251,
144(1)251,
154(2)165,
164(1)29,
174(1)157,
174(1)203
- 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,
169(2)147,
174(1)97,
174(1)217,
176(1)39,
179(1)301,
183(2)215,
198(1)211,
221(1)211
- transient,
182(1)159,
205(1)183
- undirected,
159(1)65,
161(1)289,
162(2)297,
169(2)147,
180(1)169,
181(1)107,
192(1)3
- universality,
168(2)267,
168(2)303,
175(1)3,
190(2)167
- updating,
201(1)85,
201(1)249