Empirical algorithmics (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Empirical algorithmics" in English language version.

refsWebsite

Global rank English rank

4doi.org

2^nd place

3semanticscholar.org

11^th place

8^th place

3psu.edu

207^th place

136^th place

2springer.com

274^th place

309^th place

2drdobbs.com

7,788^th place

5,521^st place

1jsoftware.us

low place

1academia.edu

121^st place

142^nd place

1epfl.ch

4,521^st place

4,877^th place

1acm.org

1,185^th place

840^th place

1performantcode.com

low place

1stackoverflow.com

4,643^rd place

2,973^rd place

1lemire.me

low place

1jetbrains.com

8,974^th place

7,712^th place

1oracle.com

1,514^th place

1,024^th place

1uic.edu

5,752^nd place

3,776^th place

1smartbear.com

low place

1stackify.com

low place

1realworldhaskell.org

low place

1secondlife.com

low place

1cmu.edu

1,564^th place

1,028^th place

1had.co.nz

low place

1github.com

383^rd place

320^th place

1virgilio.it

6,468^th place

low place

1developforperformance.com

low place

1nxp.com

low place

8,784^th place

1researchgate.net

120^th place

125^th place

1degruyter.com

1,425^th place

1,138^th place

academia.edu

Coppa, Emilio; Demetrescu, Camil; Finocchi, Irene (2014). "Input-Sensitive Profiling". IEEE Transactions on Software Engineering. 40 (12): 1185–1205. CiteSeerX 10.1.1.707.4347. doi:10.1109/TSE.2014.2339825.

acm.org

ubiquity.acm.org

"On experimental algorithmics: an interview with Catherine McGeoch and Bernard Moret". Ubiquity. 2011 (August). ACM Digital Library. 2011.

cmu.edu

cs.cmu.edu

Pattis, Richard E. (2007). "Analysis of Algorithms, Advanced Programming/Practicum, 15-200". School of Computer Science, Carnegie Mellon University.

degruyter.com

Jaskowski, Wojciech; Liskowski, Pawel; Szubert, Marcin Grzegorz; Krawiec, Krzysztof (2016). "The performance profile: A multi-criteria performance evaluation method for test-based problems" (PDF). Applied Mathematics and Computer Science. 26. De Gruyter: 216.

developforperformance.com

Krauss, Kirk (2018). "Matching Wildcards: An Improved Algorithm for Big Data". Develop for Performance.

doi.org

Moret, Bernard M. E. (1999). Towards A Discipline Of Experimental Algorithmics. DIMACS Series in Discrete Mathematics and Theoretical Computer Science. Vol. 59. DIMACS Series in Discrete Mathematics and Theoretical Computer Science. pp. 197–213. doi:10.1090/dimacs/059/10. ISBN 9780821828922. S2CID 2221596.
Coppa, Emilio; Demetrescu, Camil; Finocchi, Irene (2014). "Input-Sensitive Profiling". IEEE Transactions on Software Engineering. 40 (12): 1185–1205. CiteSeerX 10.1.1.707.4347. doi:10.1109/TSE.2014.2339825.
Moret, Bernard M. E.; Bader, David A.; Warnow, Tandy (2002). "High-Performance Algorithm Engineering for Computational Phylogenetics" (PDF). The Journal of Supercomputing. 22 (1): 99–111. doi:10.1023/a:1014362705613. S2CID 614550.
Shen, Du; Poshyvanyk, Denys; Luo, Qi; Grechanik, Mark (2015). "Automating performance bottleneck detection using search-based application profiling" (PDF). Proceedings of the 2015 International Symposium on Software Testing and Analysis. ACM Digital Library. pp. 270–281. doi:10.1145/2771783.2771816. ISBN 9781450336208. S2CID 8625903.

drdobbs.com

Krauss, Kirk (2008). "Matching Wildcards: An Algorithm". Dr. Dobb's Journal.
Krauss, Kirk (2014). "Matching Wildcards: An Empirical Way to Tame an Algorithm". Dr. Dobb's Journal.

epfl.ch

infoscience.epfl.ch

Moret, Bernard M. E.; Bader, David A.; Warnow, Tandy (2002). "High-Performance Algorithm Engineering for Computational Phylogenetics" (PDF). The Journal of Supercomputing. 22 (1): 99–111. doi:10.1023/a:1014362705613. S2CID 614550.

github.com

Salz, Rich (1991). "wildmat.c". GitHub.

had.co.nz

adv-r.had.co.nz

Wickham, Hadley (2014). "Optimising code". Advanced R. Chapman and Hall/CRC.

jetbrains.com

"Finding Application Bottlenecks". dotTrace 2018.1 Help. JetBrains. 2018.

jsoftware.us

Guzman, John Paul; Limoanco, Teresita (2017). "An Empirical Approach to Algorithm Analysis Resulting in Approximations to Big Theta Time Complexity" (PDF). Journal of Software. 12 (12).

lemire.me

Lemire, Daniel (2013). "Big-O notation and real-world performance". WordPress.

nxp.com

Grehan, Rick (2005). "Code Profilers: Choosing a Tool for Analyzing Performance" (PDF). Freescale Semiconductor. If, on the other hand, you need to step through your code with microscopic accuracy, fine-tuning individual machine instructions, then an active profiler with cycle-counting cannot be beat.

oracle.com

Shmeltzer, Shay (2005). "Locating Bottlenecks in Your Code with the Event Profiler". Oracle Technology Network JDeveloper documentation. Oracle Corp.

performantcode.com

Grzegorz, Mirek (2018). "Big-O Ambiguity". performant code_.

psu.edu

citeseerx.ist.psu.edu

Coppa, Emilio; Demetrescu, Camil; Finocchi, Irene (2014). "Input-Sensitive Profiling". IEEE Transactions on Software Engineering. 40 (12): 1185–1205. CiteSeerX 10.1.1.707.4347. doi:10.1109/TSE.2014.2339825.
Zaparanuks, Dmitrijs; Hauswirth, Matthias (2012). Algorithmic Profiling. 33rd ACM SIGPLAN Conference on Programming Language Design and Implementation. ACM Digital Library. pp. 67–76. CiteSeerX 10.1.1.459.4913.
Hough, Richard; et al. (2006). "Cycle-Accurate Microarchitecture Performance Evaluation". Proceedings of Workshop on Introspective Architecture. Georgia Institute of Technology. CiteSeerX 10.1.1.395.9306.

realworldhaskell.org

book.realworldhaskell.org

O'Sullivan, Bryan; Stewart, Don; Goerzen, John (2008). "25. Profiling and optimization". Real World Haskell. O'Reilly Media.

researchgate.net

Khamparia, Aditya; Banu, Saira (2013). Program Analysis with Dynamic Instrumentation Pin and Performance Tools. IEEE International conference on Emerging trends in Computing, Communication and Nanotechnology. IEEE Xplore Digital Library.

secondlife.com

wiki.secondlife.com

Linden, Doug (2007). "Profiling and Optimization". Second Life Wiki.

semanticscholar.org

api.semanticscholar.org

Moret, Bernard M. E. (1999). Towards A Discipline Of Experimental Algorithmics. DIMACS Series in Discrete Mathematics and Theoretical Computer Science. Vol. 59. DIMACS Series in Discrete Mathematics and Theoretical Computer Science. pp. 197–213. doi:10.1090/dimacs/059/10. ISBN 9780821828922. S2CID 2221596.
Moret, Bernard M. E.; Bader, David A.; Warnow, Tandy (2002). "High-Performance Algorithm Engineering for Computational Phylogenetics" (PDF). The Journal of Supercomputing. 22 (1): 99–111. doi:10.1023/a:1014362705613. S2CID 614550.
Shen, Du; Poshyvanyk, Denys; Luo, Qi; Grechanik, Mark (2015). "Automating performance bottleneck detection using search-based application profiling" (PDF). Proceedings of the 2015 International Symposium on Software Testing and Analysis. ACM Digital Library. pp. 270–281. doi:10.1145/2771783.2771816. ISBN 9781450336208. S2CID 8625903.

smartbear.com

"Performance & Memory Profiling and Code Coverage". The Profile Learning Center. SmartBear Software. 2018.

springer.com

Fleischer, Rudolf; et al., eds. (2002). Experimental Algorithmics, From Algorithm Design to Robust and Efficient Software. Springer International Publishing AG.
Hromkovic, Juraj (2004). Algorithmics for Hard Problems. Springer International Publishing AG.

stackify.com

Janssen, Thorben (2017). "11 Simple Java Performance Tuning Tips". Stackify Developer Tips, Tricks and Resources.

stackoverflow.com

Kölker, Jonas (2009). "When does Big-O notation fail?". Stack Overflow.

uic.edu

cs.uic.edu

Shen, Du; Poshyvanyk, Denys; Luo, Qi; Grechanik, Mark (2015). "Automating performance bottleneck detection using search-based application profiling" (PDF). Proceedings of the 2015 International Symposium on Software Testing and Analysis. ACM Digital Library. pp. 270–281. doi:10.1145/2771783.2771816. ISBN 9781450336208. S2CID 8625903.

virgilio.it

xoomer.virgilio.it

Cantatore, Alessandro (2003). "Wildcard matching algorithms".