Class information for: |
Basic class information |
Class id | #P | Avg. number of references |
Database coverage of references |
---|---|---|---|
14808 | 749 | 21.0 | 30% |
Hierarchy of classes |
The table includes all classes above and classes immediately below the current class. |
Terms with highest relevance score |
rank | Term | termType | Chi square | Shr. of publ. in class containing term |
Class's shr. of term's tot. occurrences |
#P with term in class |
---|---|---|---|---|---|---|
1 | ORDERED BINARY DECISION DIAGRAMS | authKW | 997723 | 5% | 64% | 38 |
2 | BINARY DECISION DIAGRAMS | authKW | 749016 | 10% | 25% | 73 |
3 | BRANCHING PROGRAMS | authKW | 692240 | 4% | 57% | 30 |
4 | DECISION DIAGRAMS | authKW | 398765 | 4% | 33% | 30 |
5 | BDDS | authKW | 372711 | 2% | 57% | 16 |
6 | INFORMAT LS2 | address | 366901 | 1% | 100% | 9 |
7 | OBDD | authKW | 332917 | 2% | 58% | 14 |
8 | READ ONCE BRANCHING PROGRAMS | authKW | 330209 | 1% | 90% | 9 |
9 | VARIABLE ORDERING | authKW | 266328 | 2% | 47% | 14 |
10 | MULTIPLE OUTPUT FUNCTION | authKW | 209656 | 1% | 86% | 6 |
Web of Science journal categories |
Rank | Term | Chi square | Shr. of publ. in class containing term |
Class's shr. of term's tot. occurrences |
#P with term in class |
---|---|---|---|---|---|
1 | Computer Science, Theory & Methods | 22725 | 48% | 0% | 358 |
2 | Computer Science, Hardware & Architecture | 22084 | 31% | 0% | 229 |
3 | Computer Science, Information Systems | 3261 | 17% | 0% | 131 |
4 | Computer Science, Software Engineering | 2086 | 13% | 0% | 94 |
5 | Engineering, Electrical & Electronic | 1454 | 27% | 0% | 204 |
6 | Logic | 865 | 2% | 0% | 18 |
7 | Computer Science, Interdisciplinary Applications | 682 | 9% | 0% | 65 |
8 | Computer Science, Artificial Intelligence | 592 | 8% | 0% | 59 |
9 | Mathematics, Applied | 254 | 9% | 0% | 64 |
10 | COMPUTER APPLICATIONS & CYBERNETICS | 242 | 1% | 0% | 4 |
Address terms |
Rank | Term | Chi square | Shr. of publ. in class containing term |
Class's shr. of term's tot. occurrences |
#P with term in class |
---|---|---|---|---|---|
1 | INFORMAT LS2 | 366901 | 1% | 100% | 9 |
2 | FB INFORMAT | 207634 | 4% | 16% | 32 |
3 | LS2 INFORMAT | 163067 | 1% | 100% | 4 |
4 | LS2 | 93178 | 1% | 57% | 4 |
5 | CL DAT DF LD V | 81534 | 0% | 100% | 2 |
6 | THEORET CYBERNET | 63800 | 1% | 26% | 6 |
7 | FB INFORMATIK | 52411 | 0% | 43% | 3 |
8 | CHAIR COMP ARCHITECTURE PROF DR BERND BECKER | 40767 | 0% | 100% | 1 |
9 | CL DAT DF V | 40767 | 0% | 100% | 1 |
10 | DESIGN AUTORMAT GRP | 40767 | 0% | 100% | 1 |
Journals |
Rank | Term | Chi square | Shr. of publ. in class containing term |
Class's shr. of term's tot. occurrences |
#P with term in class |
---|---|---|---|---|---|
1 | FORMAL METHODS IN SYSTEM DESIGN | 77983 | 4% | 6% | 31 |
2 | IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS | 30198 | 8% | 1% | 60 |
3 | NOUVEL AUTOMATISME | 20380 | 0% | 25% | 2 |
4 | LECTURE NOTES IN COMPUTER SCIENCE | 15862 | 25% | 0% | 186 |
5 | JOURNAL OF MULTIPLE-VALUED LOGIC AND SOFT COMPUTING | 13327 | 2% | 3% | 13 |
6 | IEEE TRANSACTIONS ON COMPUTERS | 11344 | 5% | 1% | 38 |
7 | INTEGRATION-THE VLSI JOURNAL | 6955 | 2% | 1% | 13 |
8 | THEORY OF COMPUTING SYSTEMS | 6934 | 2% | 1% | 13 |
9 | INFORMATION AND COMPUTATION | 6236 | 2% | 1% | 18 |
10 | INFORMATION PROCESSING LETTERS | 5743 | 4% | 0% | 30 |
Author Key Words |
Rank | Term | Chi square | Shr. of publ. in class containing term |
Class's shr. of term's tot. occurrences |
#P with term in class |
LCSH search | Wikipedia search |
---|---|---|---|---|---|---|---|
1 | ORDERED BINARY DECISION DIAGRAMS | 997723 | 5% | 64% | 38 | Search ORDERED+BINARY+DECISION+DIAGRAMS | Search ORDERED+BINARY+DECISION+DIAGRAMS |
2 | BINARY DECISION DIAGRAMS | 749016 | 10% | 25% | 73 | Search BINARY+DECISION+DIAGRAMS | Search BINARY+DECISION+DIAGRAMS |
3 | BRANCHING PROGRAMS | 692240 | 4% | 57% | 30 | Search BRANCHING+PROGRAMS | Search BRANCHING+PROGRAMS |
4 | DECISION DIAGRAMS | 398765 | 4% | 33% | 30 | Search DECISION+DIAGRAMS | Search DECISION+DIAGRAMS |
5 | BDDS | 372711 | 2% | 57% | 16 | Search BDDS | Search BDDS |
6 | OBDD | 332917 | 2% | 58% | 14 | Search OBDD | Search OBDD |
7 | READ ONCE BRANCHING PROGRAMS | 330209 | 1% | 90% | 9 | Search READ+ONCE+BRANCHING+PROGRAMS | Search READ+ONCE+BRANCHING+PROGRAMS |
8 | VARIABLE ORDERING | 266328 | 2% | 47% | 14 | Search VARIABLE+ORDERING | Search VARIABLE+ORDERING |
9 | MULTIPLE OUTPUT FUNCTION | 209656 | 1% | 86% | 6 | Search MULTIPLE+OUTPUT+FUNCTION | Search MULTIPLE+OUTPUT+FUNCTION |
10 | OBDDS | 181592 | 1% | 64% | 7 | Search OBDDS | Search OBDDS |
Core articles |
The table includes core articles in the class. The following variables is taken into account for the relevance score of an article in a cluster c: (1) Number of references referring to publications in the class. (2) Share of total number of active references referring to publications in the class. (3) Age of the article. New articles get higher score than old articles. (4) Citation rate, normalized to year. |
Rank | Reference | # ref. in cl. |
Shr. of ref. in cl. |
Citations |
---|---|---|---|---|
1 | WEGENER, I , (2004) BDDS - DESIGN, ANALYSIS, COMPLEXITY, AND APPLICATIONS.DISCRETE APPLIED MATHEMATICS. VOL. 138. ISSUE 1-2. P. 229-251 | 20 | 100% | 10 |
2 | BOLLIG, B , (2012) ON SYMBOLIC OBDD-BASED ALGORITHMS FOR THE MINIMUM SPANNING TREE PROBLEM.THEORETICAL COMPUTER SCIENCE. VOL. 447. ISSUE . P. 2 -12 | 22 | 63% | 4 |
3 | SIELING, D , (2002) LOWER BOUNDS FOR LINEARLY TRANSFORMED OBDDS AND FBDDS.JOURNAL OF COMPUTER AND SYSTEM SCIENCES. VOL. 64. ISSUE 2. P. 419 -438 | 17 | 100% | 0 |
4 | BOLLIG, B , PROGER, T , (2014) ON EFFICIENT IMPLICIT OBDD-BASED ALGORITHMS FOR MAXIMAL MATCHINGS.INFORMATION AND COMPUTATION. VOL. 239. ISSUE . P. 29 -43 | 14 | 88% | 0 |
5 | BOLLIG, B , (2011) LARGER LOWER BOUNDS ON THE OBDD COMPLEXITY OF INTEGER MULTIPLICATION.INFORMATION AND COMPUTATION. VOL. 209. ISSUE 3. P. 333-343 | 12 | 100% | 0 |
6 | PONZIO, S , (1998) A LOWER BOUND FOR INTEGER MULTIPLICATION WITH READ-ONCE BRANCHING PROGRAMS.SIAM JOURNAL ON COMPUTING. VOL. 28. ISSUE 3. P. 798 -815 | 21 | 78% | 16 |
7 | SAWITZKI, D , (2005) LOWER BOUNDS ON THE OBDD SIZE OF GRAPHS OF SOME POPULAR FUNCTIONS.SOFSEM 2005:THEORY AND PRACTICE OF COMPUTER SCIENCE. VOL. 3381. ISSUE . P. 298-309 | 15 | 88% | 7 |
8 | BOLLIG, B , WAACK, S , WOELFEL, P , (2006) PARITY GRAPH-DRIVEN READ-ONCE BRANCHING PROGRAMS AND AN EXPONENTIAL LOWER BOUND FOR INTEGER MULTIPLICATION.THEORETICAL COMPUTER SCIENCE. VOL. 362. ISSUE 1-3. P. 86 -99 | 14 | 88% | 0 |
9 | BOLLIG, B , BURY, M , (2016) ON THE OBDD REPRESENTATION OF SOME GRAPH CLASSES.DISCRETE APPLIED MATHEMATICS. VOL. 214. ISSUE . P. 34 -53 | 15 | 63% | 0 |
10 | BOLLIG, B , (2011) ON THE OBDD COMPLEXITY OF THE MOST SIGNIFICANT BIT OF INTEGER MULTIPLICATION.THEORETICAL COMPUTER SCIENCE. VOL. 412. ISSUE 18. P. 1686-1695 | 10 | 100% | 0 |
Classes with closest relation at Level 1 |