Entry Cazanescu:1992:GRA 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{Cazanescu:1992:GRA,
author = "V.-E. Cazanescu and Gh. Stefanescu",
title = "A general result on abstract flowchart schemes with
applications to the study of accessibility, reduction
and minimization",
journal = j-THEOR-COMP-SCI,
volume = "99",
number = "1",
pages = "1--63",
day = "01",
month = jun,
year = "1992",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:24:22 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Fac. of Math., Bucharest Univ., Romania",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "abstract flowchart schemes; accessibility; adequate
abstract structure; flowcharting; minimization;
programming theory; reduction; support theory",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- abstract,
70(1)99,
70(2)193,
71(2)209,
75(3)223,
77(1)5,
77(1)195,
80(1)117,
81(1)117,
81(2)269,
82(2)389,
83(2)261,
87(1)43,
87(1)143,
87(1)163,
88(2)231,
90(1)61,
94(1)1,
94(1)63,
95(2)323,
96(1)217,
96(1)249,
96(1)z,
100(2)267,
104(1)53,
104(1)89,
104(1)129,
104(2)235,
105(2)217,
109(1)225,
111(1)3,
111(1)191,
112(1)99,
115(1)77,
116(1)59,
118(2)231,
119(1)23,
121(1)113,
122(1)165,
124(1)93,
126(2)259,
129(2)337,
134(2)455,
135(2)267,
136(1)79,
136(1)109,
136(1)125,
136(1)163
- adequate,
76(2)223
- application,
70(1)3,
70(2)193,
72(1)55,
81(2)201,
84(1)77,
88(1)83,
88(1)127,
97(1)83,
98(1)137,
98(2)263,
100(1)105,
100(1)223,
103(1)51,
104(1)129,
109(1)181,
112(1)99,
112(2)419,
115(1)43,
117(1)289,
119(1)173,
123(1)61,
125(2)345,
127(2)255,
130(1)17,
133(1)23
- general,
75(1)85,
82(1)165,
82(2)215,
84(2)281,
86(2)343,
94(2)281,
97(1)105,
98(1)99,
98(1)137,
103(2)365,
116(1)195,
117(1)z,
121(1)169,
123(1)31,
125(1)45,
129(1)79,
130(1)17,
134(1)107,
135(2)221,
136(1)277
- minimization,
88(2)269,
125(1)3,
130(1)73
- reduction,
72(2)133,
81(2)189,
82(1)141,
88(1)1,
88(2)269,
89(2)207,
92(1)3,
93(1)75,
96(2)305,
97(2)245,
98(1)137,
100(1)205,
103(2)283,
104(1)109,
107(1)145,
107(2)333,
108(2)185,
111(1)145,
115(2)261,
115(2)371,
118(2)193,
121(1)279,
123(1)95,
123(2)407,
126(2)259,
127(1)99,
127(1)149,
131(2)441,
132(1)179,
132(1)229,
132(1)403,
135(1)67,
135(1)111,
135(1)z
- 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,
104(1)3,
110(1)145,
113(1)119,
116(1)195,
116(2)317,
120(2)197,
121(1)71,
125(2)243,
128(1)3,
134(2)387,
135(2)361,
136(2)507
- schemes,
71(2)265,
71(2)z,
77(3)291,
81(2)295,
83(2)237,
100(2)347,
110(2)419,
118(1)67,
129(1)123,
130(1)17
- study,
94(2)373,
100(1)137,
113(2)371,
125(2)329
- support,
73(2)213,
117(1)131