Dominator (graph theory) (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Dominator (graph theory)" in English language version.

refsWebsite

Global rank English rank

7doi.org

2^nd place

6semanticscholar.org

11^th place

8^th place

4acm.org

1,185^th place

840^th place

3psu.edu

207^th place

136^th place

1sciencedirect.com

149^th place

178^th place

1worldcat.org

5^th place

1eclipse.org

low place

8,992^nd place

1web.archive.org

1^st place

1uoi.gr

low place

1rice.edu

3,843^rd place

2,772^nd place

acm.org (Global: 1,185^th place; English: 840^th place)

portal.acm.org

Prosser, Reese T. (1959). "Applications of Boolean matrices to the analysis of flow diagrams". Papers presented at the December 1-3, 1959, eastern joint IRE-AIEE-ACM computer conference on - IRE-AIEE-ACM '59 (Eastern). pp. 133–138. doi:10.1145/1460299.1460314. S2CID 15546681.
Cytron, Ron; Ferrante, Jeanne; Rosen, Barry K.; Wegman, Mark N.; Zadeck, F. Kenneth (1989). "An efficient method of computing static single assignment form". Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '89. pp. 25–35. doi:10.1145/75277.75280. ISBN 0897912942. S2CID 8301431.

dl.acm.org

Teslenko, Maxim; Dubrova, Elena (2005). "An Efficient Algorithm for Finding Double-Vertex Dominators in Circuit Graphs". Design, Automation and Test in Europe. pp. 406–411. CiteSeerX 10.1.1.598.3053. doi:10.1109/DATE.2005.53. ISBN 9780769522883. S2CID 10305833.
Dubrova, Elena (2005). "Structural Testing Based on Minimum Kernels". Design, Automation and Test in Europe. pp. 1168–1173. CiteSeerX 10.1.1.583.5547. doi:10.1109/DATE.2005.284. ISBN 9780769522883. S2CID 11439732.

doi.org (Global: 2^nd place; English: 2^nd place)

Lengauer, Thomas; Tarjan, Robert Endre (July 1979). "A fast algorithm for finding dominators in a flowgraph". ACM Transactions on Programming Languages and Systems. 1 (1): 121–141. CiteSeerX 10.1.1.117.8843. doi:10.1145/357062.357071. S2CID 976012.
Prosser, Reese T. (1959). "Applications of Boolean matrices to the analysis of flow diagrams". Papers presented at the December 1-3, 1959, eastern joint IRE-AIEE-ACM computer conference on - IRE-AIEE-ACM '59 (Eastern). pp. 133–138. doi:10.1145/1460299.1460314. S2CID 15546681.
Lowry, Edward S.; Medlock, Cleburne W. (January 1969). "Object code optimization". Communications of the ACM. 12 (1): 13–22. doi:10.1145/362835.362838. S2CID 16768560.
Cytron, Ron; Ferrante, Jeanne; Rosen, Barry K.; Wegman, Mark N.; Zadeck, F. Kenneth (1989). "An efficient method of computing static single assignment form". Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '89. pp. 25–35. doi:10.1145/75277.75280. ISBN 0897912942. S2CID 8301431.
Tamrawi, Ahmed; Kothari, Suresh (2018-10-01). "Projected control graph for computing relevant program behaviors". Science of Computer Programming. 163: 93–114. doi:10.1016/j.scico.2018.04.003. ISSN 0167-6423.
Teslenko, Maxim; Dubrova, Elena (2005). "An Efficient Algorithm for Finding Double-Vertex Dominators in Circuit Graphs". Design, Automation and Test in Europe. pp. 406–411. CiteSeerX 10.1.1.598.3053. doi:10.1109/DATE.2005.53. ISBN 9780769522883. S2CID 10305833.
Dubrova, Elena (2005). "Structural Testing Based on Minimum Kernels". Design, Automation and Test in Europe. pp. 1168–1173. CiteSeerX 10.1.1.583.5547. doi:10.1109/DATE.2005.284. ISBN 9780769522883. S2CID 11439732.

eclipse.org (Global: low place; English: 8,992^nd place)

help.eclipse.org

"Dominator Tree". eclipse.org. SAP AG and IBM Corporation. 2012 [2008]. Retrieved 21 June 2013.

psu.edu (Global: 207^th place; English: 136^th place)

citeseerx.ist.psu.edu

Lengauer, Thomas; Tarjan, Robert Endre (July 1979). "A fast algorithm for finding dominators in a flowgraph". ACM Transactions on Programming Languages and Systems. 1 (1): 121–141. CiteSeerX 10.1.1.117.8843. doi:10.1145/357062.357071. S2CID 976012.
Teslenko, Maxim; Dubrova, Elena (2005). "An Efficient Algorithm for Finding Double-Vertex Dominators in Circuit Graphs". Design, Automation and Test in Europe. pp. 406–411. CiteSeerX 10.1.1.598.3053. doi:10.1109/DATE.2005.53. ISBN 9780769522883. S2CID 10305833.
Dubrova, Elena (2005). "Structural Testing Based on Minimum Kernels". Design, Automation and Test in Europe. pp. 1168–1173. CiteSeerX 10.1.1.583.5547. doi:10.1109/DATE.2005.284. ISBN 9780769522883. S2CID 11439732.

rice.edu (Global: 3,843^rd place; English: 2,772^nd place)

hipersoft.rice.edu

Cooper, Keith D.; Harvey, Timothy J; Kennedy, Ken (2001). "A Simple, Fast Dominance Algorithm" (PDF).

sciencedirect.com (Global: 149^th place; English: 178^th place)

Tamrawi, Ahmed; Kothari, Suresh (2018-10-01). "Projected control graph for computing relevant program behaviors". Science of Computer Programming. 163: 93–114. doi:10.1016/j.scico.2018.04.003. ISSN 0167-6423.

semanticscholar.org (Global: 11^th place; English: 8^th place)

api.semanticscholar.org

Lengauer, Thomas; Tarjan, Robert Endre (July 1979). "A fast algorithm for finding dominators in a flowgraph". ACM Transactions on Programming Languages and Systems. 1 (1): 121–141. CiteSeerX 10.1.1.117.8843. doi:10.1145/357062.357071. S2CID 976012.
Prosser, Reese T. (1959). "Applications of Boolean matrices to the analysis of flow diagrams". Papers presented at the December 1-3, 1959, eastern joint IRE-AIEE-ACM computer conference on - IRE-AIEE-ACM '59 (Eastern). pp. 133–138. doi:10.1145/1460299.1460314. S2CID 15546681.
Lowry, Edward S.; Medlock, Cleburne W. (January 1969). "Object code optimization". Communications of the ACM. 12 (1): 13–22. doi:10.1145/362835.362838. S2CID 16768560.
Cytron, Ron; Ferrante, Jeanne; Rosen, Barry K.; Wegman, Mark N.; Zadeck, F. Kenneth (1989). "An efficient method of computing static single assignment form". Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '89. pp. 25–35. doi:10.1145/75277.75280. ISBN 0897912942. S2CID 8301431.
Teslenko, Maxim; Dubrova, Elena (2005). "An Efficient Algorithm for Finding Double-Vertex Dominators in Circuit Graphs". Design, Automation and Test in Europe. pp. 406–411. CiteSeerX 10.1.1.598.3053. doi:10.1109/DATE.2005.53. ISBN 9780769522883. S2CID 10305833.
Dubrova, Elena (2005). "Structural Testing Based on Minimum Kernels". Design, Automation and Test in Europe. pp. 1168–1173. CiteSeerX 10.1.1.583.5547. doi:10.1109/DATE.2005.284. ISBN 9780769522883. S2CID 11439732.

uoi.gr (Global: low place; English: low place)

cs.uoi.gr

Georgiadis, Loukas; Tarjan, Robert E.; Werneck, Renato F. (2006). "Finding Dominators in Practice" (PDF). Archived from the original (PDF) on 15 Apr 2024.

web.archive.org (Global: 1^st place; English: 1^st place)

Georgiadis, Loukas; Tarjan, Robert E.; Werneck, Renato F. (2006). "Finding Dominators in Practice" (PDF). Archived from the original (PDF) on 15 Apr 2024.

worldcat.org (Global: 5^th place; English: 5^th place)

search.worldcat.org

Tamrawi, Ahmed; Kothari, Suresh (2018-10-01). "Projected control graph for computing relevant program behaviors". Science of Computer Programming. 163: 93–114. doi:10.1016/j.scico.2018.04.003. ISSN 0167-6423.

Dominator (graph theory) (English Wikipedia)

acm.org (Global: 1,185th place; English: 840th place)

portal.acm.org

dl.acm.org

doi.org (Global: 2nd place; English: 2nd place)

eclipse.org (Global: low place; English: 8,992nd place)