Entry Knuth:1978:ELS from tcs1975.bib
Last update: Thu Sep 27 02:46:39 MDT 2018
Top |
Symbols |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
Y |
Z
BibTeX entry
@Article{Knuth:1978:ELS,
author = "D. E. Knuth and A. Schonhage",
title = "The expected linearity of a simple equivalence
algorithm",
journal = j-THEOR-COMP-SCI,
volume = "6",
number = "3",
pages = "281--315",
month = jun,
year = "1978",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1975.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Comp. Sci. Dept., Stanford Univ., Stanford, CA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algorithm theory; disjoint equivalence classes;
expected linearity; graph theory; random graphs; simple
equivalence algorithm",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- algorithm,
1(1)13,
1(1)21,
1(1)27,
1(2)103,
1(2)185,
1(3)193,
1(3)215,
1(3)227,
1(4)269,
1(4)289,
2(1)73,
2(2)183,
2(2)228,
2(3)345,
3(2)267,
3(3)293,
3(3)321,
3(3)349,
4(1)59,
4(1)77,
4(2)155,
4(2)171,
4(3)321,
5(1)25,
5(2)113,
5(2)135,
5(2)183,
5(2)205,
5(3)275,
6(1)41,
6(1)93,
6(2)109,
6(2)223,
6(3)233,
6(3)317,
7(1)1,
7(1)79,
7(1)99,
7(2)127,
7(3)239,
7(3)273,
8(1)45,
8(1)57,
8(1)73,
8(3)271,
8(3)325,
8(3)379,
9(1)1,
9(1)39,
9(1)83,
9(1)127,
9(2)329,
9(2)347
- C1160,
1(2)185,
1(3)237,
2(3)305,
2(3)339,
3(1)51,
3(3)371,
4(2)125,
4(2)137,
4(2)155,
4(3)277,
5(1)51,
5(2)179,
5(3)257,
6(1)93,
7(2)217,
8(1)13,
8(1)45,
9(2)265
- C4240,
1(1)13,
1(1)21,
1(2)103,
1(3)193,
1(3)215,
1(4)269,
1(4)289,
2(1)73,
2(2)183,
2(2)228,
3(2)267,
3(3)349,
4(1)59,
4(2)155,
4(2)171,
5(1)25,
5(2)113,
5(2)135,
5(2)205,
5(3)275,
6(1)41,
6(1)93,
6(2)109,
6(2)223,
6(3)233,
6(3)317,
7(1)79,
7(1)99,
7(3)239,
7(3)273,
8(1)57,
8(1)73,
8(3)325,
8(3)379,
9(1)39,
9(1)83,
9(1)127,
9(2)329,
9(2)347
- class,
1(1)59,
1(2)161,
1(3)193,
2(1)1,
2(2)228,
7(3)239,
9(1)127
- combinatorial,
1(2)95,
1(2)185,
1(3)237,
2(3)305,
2(3)339,
3(1)51,
3(2)183,
3(3)371,
4(2)125,
4(2)137,
4(2)155,
4(3)277,
5(1)51,
5(2)179,
5(3)257,
6(1)93,
7(2)217,
7(3)325,
8(1)13,
8(1)45,
9(2)265
- disjoint,
1(4)355,
2(3)383
- equivalence,
1(4)289,
2(3)361,
3(1)75,
3(3)283,
3(3)305,
4(2)199,
4(3)321,
6(2)143,
7(1)25,
7(2)169,
7(3)239,
7(3)333,
8(2)135,
9(2)173,
9(2)377
- graph,
1(3)237,
2(3)305,
2(3)339,
3(3)371,
4(3)277,
5(1)51,
6(1)93,
9(2)265
- Knuth, D. E.,
3(3)321
- mathematics,
1(2)185,
1(3)237,
2(1)9,
2(3)305,
2(3)339,
3(1)51,
3(3)371,
4(2)125,
4(2)137,
4(2)155,
4(3)277,
5(1)51,
5(2)179,
5(2)211,
5(3)257,
6(1)69,
6(1)93,
6(3)255,
7(1)25,
7(1)117,
7(2)217,
7(3)325,
8(1)13,
8(1)45,
9(1)27,
9(1)99,
9(2)265
- programming,
1(1)13,
1(1)21,
1(2)103,
1(2)125,
1(3)193,
1(3)215,
1(4)269,
1(4)289,
2(1)73,
2(2)133,
2(2)183,
2(2)228,
3(2)267,
3(3)349,
4(1)1,
4(1)59,
4(2)155,
4(2)171,
5(1)25,
5(2)113,
5(2)135,
5(2)205,
5(3)223,
5(3)275,
6(1)41,
6(1)93,
6(2)109,
6(2)223,
6(3)233,
6(3)317,
7(1)79,
7(1)99,
7(3)239,
7(3)273,
8(1)57,
8(1)73,
8(3)325,
8(3)379,
9(1)39,
9(1)83,
9(1)127,
9(2)153,
9(2)243,
9(2)265,
9(2)329,
9(2)347
- Schonhage, A.,
1(1)1,
3(2)267
- simple,
1(3)237,
1(4)297,
3(3)321,
9(2)287,
9(2)311