Semi-automatic analysis of algorithm complexity (Case study: Square-root computation)

Madalina Erascu. Semi-automatic analysis of algorithm complexity (Case study: Square-root computation). In IEEE 12th International Symposium on Intelligent Systems and Informatics, SISY 2014, Subotica, Serbia, September 11-13, 2014. pages 67-72, IEEE, 2014. [doi]

@inproceedings{Erascu14,
  title = {Semi-automatic analysis of algorithm complexity (Case study: Square-root computation)},
  author = {Madalina Erascu},
  year = {2014},
  doi = {10.1109/SISY.2014.6923559},
  url = {http://dx.doi.org/10.1109/SISY.2014.6923559},
  researchr = {https://researchr.org/publication/Erascu14},
  cites = {0},
  citedby = {0},
  pages = {67-72},
  booktitle = {IEEE 12th International Symposium on Intelligent Systems and Informatics, SISY 2014, Subotica, Serbia, September 11-13, 2014},
  publisher = {IEEE},
}