Entry Lakshmanan:1988:SFM 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{Lakshmanan:1988:SFM,
author = "V. S. Lakshmanan",
title = "Split-freedom and {MVD}-intersection: {A} new
characterization of multivalued dependencies having
conflict-free covers",
journal = j-THEOR-COMP-SCI,
volume = "62",
number = "1--2",
pages = "105--122",
month = dec,
year = "1988",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
affiliation = "Indian Inst of Science",
affiliationaddress = "Bangalore, India",
classification = "723; C4250 (Database theory); C6160D (Relational
DBMS)",
conference = "Selected Papers presented at the First International
Conference on Database Theory",
corpsource = "Dept. of Comput. Sci. and Autom., Indian Inst. of
Sci., Bangalore, India",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Computer Programming--Algorithms; conflict-free
covers; Database Systems; database theory; multivalued
dependencies; Multivalued Dependencies;
MVD-intersection; Polynomial Time Algorithms;
Relational; relational databases; Split Free Sets;
split-free sets",
meetingaddress = "Rome, Italy",
meetingdate = "Sep 1986",
meetingdate2 = "09/86",
pubcountry = "Netherlands",
sponsor = "European Assoc for Theoretical Computer Science",
treatment = "T Theoretical or Mathematical",
}
Related entries
- Algorithms, Programming-,
58(0)3,
58(1)3,
58(1)103,
58(1)143,
58(1)183,
59(1)115,
59(3)297,
60(3)255,
60(3)341,
62(0)3,
62(1)67,
62(1)123,
63(2)157,
63(3)295,
64(1)39,
64(1)83,
64(1)107,
64(3)343,
65(1)1,
66(2)157,
66(2)181,
67(1)65
- C4250,
35(2)165,
38(1)1,
38(1)99,
39(2)239,
39(2)309,
41(2)271,
43(1)81,
46(1)67,
48(2)145,
48(2)297,
52(3)281,
54(1)103,
54(2)299,
56(2)187,
58(1)3,
62(1)3,
62(1)67,
62(1)187,
62(1)221,
63(1)63,
69(1)1
- C6160D,
39(2)239,
39(2)309,
63(1)63
- characterization,
35(1)17,
35(1)43,
35(2)261,
36(1)109,
36(2)341,
38(1)117,
39(1)27,
40(2)275,
43(1)1,
43(1)31,
44(2)225,
45(2)121,
46(1)91,
46(1)101,
49(1)23,
50(3)285,
51(1)27,
51(1)117,
51(1)205,
51(3)301,
52(1)165,
52(3)251,
53(2)335,
54(2)199,
57(1)47,
62(1)221,
64(2)191,
66(3)299,
67(1)75,
67(2)143,
68(2)155,
68(2)203,
69(3)289
- conflict-free,
44(3)275,
62(1)221,
64(3)305
- cover,
41(2)141,
68(3)253
- DBMS,
58(1)57,
62(1)3,
62(1)187,
62(3)251,
63(1)63,
69(1)1
- dependency,
38(1)99,
39(2)239,
39(2)309,
41(2)271,
54(1)103,
62(0)3,
62(1)67,
62(1)221
- free,
35(1)71,
35(2)179,
37(1)51,
37(3)269,
37(3)357,
39(1)3,
41(1)121,
41(2)215,
43(1)117,
43(2)293,
44(2)229,
46(2)159,
46(2)319,
47(2)191,
48(2)183,
48(2)201,
48(2)329,
49(2)z,
51(3)301,
52(1)59,
52(3)177,
53(1)125,
54(2)165,
55(2)183,
57(1)147,
57(2)239,
58(1)69,
58(1)81,
58(1)201,
58(1)361,
60(2)177,
62(1)221,
62(3)267,
63(3)253,
63(3)275,
65(2)171,
66(2)117,
67(1)75,
69(3)319
- free, conflict-,
44(3)275,
62(1)221,
64(3)305
- Lakshmanan, V. S.,
54(1)103
- multivalued,
47(1)71,
54(1)103,
62(0)3,
62(1)221
- new,
54(1)53,
57(1)97
- Programming--Algorithms,
58(0)3,
58(1)3,
58(1)103,
58(1)143,
58(1)183,
59(1)115,
59(3)297,
60(3)255,
60(3)341,
62(0)3,
62(1)67,
62(1)123,
63(2)157,
63(3)295,
64(1)39,
64(1)83,
64(1)107,
64(3)343,
65(1)1,
66(2)157,
66(2)181,
67(1)65
- relational,
35(2)165,
38(1)99,
39(2)239,
39(2)309,
43(2)123,
46(1)67,
54(1)103,
62(1)67,
63(1)63,
63(3)253,
69(1)55
- time,
35(2)215,
36(2)203,
36(2)265,
37(1)1,
37(2)123,
38(2)157,
38(2)249,
38(2)269,
38(2)323,
40(1)31,
40(1)57,
40(1)67,
40(2)175,
40(2)195,
41(1)81,
41(2)141,
43(2)337,
46(2)219,
46(2)261,
47(1)39,
47(1)85,
47(3)315,
47(3)329,
48(1)9,
48(1)35,
48(2)273,
49(1)81,
50(2)183,
51(1)177,
51(1)221,
51(1)239,
52(3)177,
52(3)269,
53(2)201,
54(1)53,
54(1)65,
54(1)129,
54(2)181,
54(2)199,
54(2)249,
54(2)315,
56(1)3,
56(2)211,
57(2)317,
57(2)327,
58(1)57,
58(1)69,
58(1)155,
58(1)175,
58(1)249,
58(1)325,
59(1)115,
60(3)255,
60(3)341,
61(2)175,
63(1)43,
63(3)295,
68(1)57,
68(3)319,
69(2)117