Entry Saouter:1993:CRE 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{Saouter:1993:CRE,
author = "Yannick Saouter and Patrice Quinton",
title = "Computability of recurrence equations",
journal = j-THEOR-COMP-SCI,
volume = "116",
number = "2",
pages = "317--337",
day = "16",
month = aug,
year = "1993",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:17:28 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1993&volume=116&issue=2;
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=116&issue=2&aid=1240",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory); C5220P (Parallel architecture)",
corpsource = "IRISA, Rennes, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computability; iterative arrays; parallel
architectures; recurrence equations; systolic array
synthesis; systolic arrays; undecidability result",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
}
Related entries
- architecture,
71(1)47,
76(2)331,
84(2)179,
100(1)223,
120(2)215,
125(1)61,
128(1)127,
128(1)241,
130(1)85,
132(1)377
- array,
71(1)47,
81(1)97,
85(1)53,
87(2)329,
88(1)59,
88(1)151,
95(2)207,
120(2)215
- C5220P,
125(1)61,
128(1)127,
128(1)241
- computability,
73(3)313,
77(3)221,
80(2)203,
82(1)1,
86(2)377,
94(1)101,
97(1)1,
100(2)267,
113(2)191,
119(1)187,
119(1)z,
121(1)89,
131(2)243,
132(1)113,
133(1)65,
134(2)537
- equation,
71(3)381,
72(2)119,
74(3)329,
76(2)309,
79(1)179,
82(2)177,
87(1)1,
89(1)3,
90(1)127,
92(1)145,
103(2)165,
108(1)103,
115(1)77,
115(2)391,
119(1)39,
121(1)411,
123(1)145,
123(2)239,
123(2)397,
131(2)311,
132(1)71,
132(1)129,
133(1)23,
135(1)111,
135(2)319
- iterative,
81(2)269,
82(2)215,
88(2)313,
93(1)91,
111(1)125,
119(1)39,
123(1)95,
123(1)139,
125(2)345,
125(2)355
- recurrence,
82(1)85,
94(2)223,
106(2)183,
121(1)309,
129(2)263
- result,
70(1)85,
73(1)47,
73(3)249,
73(3)279,
79(1)111,
79(1)137,
80(2)289,
85(2)305,
87(1)203,
87(2)229,
87(2)287,
88(2)231,
91(2)129,
92(2)249,
93(2)265,
94(2)161,
95(1)115,
97(1)143,
99(1)1,
104(1)3,
110(1)145,
113(1)119,
116(1)195,
120(2)197,
121(1)71,
125(2)243,
128(1)3,
134(2)387,
135(2)361,
136(2)507
- synthesis,
71(1)47,
71(2)227,
71(2)241,
71(2)z,
86(2)343,
90(2)309,
112(1)145,
122(1)69,
122(1)119,
135(2)319
- systolic,
71(1)47,
76(2)331,
83(2)249,
95(2)207
- undecidability,
86(2)377,
87(1)25,
87(2)287,
93(1)1,
103(2)205,
103(2)409,
107(2)349,
123(2)397,
132(1)85,
132(1)395