-2000: Standard Specification For Public Key Cryptorgraphy, American National Standards Institute, IEEE Computer Society, 2000.
 Daniel J. Bernstein and Peter Birkner and Tanja Lange and Christiane Peters, ECM using Edwards curves, Math. Comput., 82 (282), (2013)
 Torbjörn Granlund and the GMP development team, GMP-5.0.5, 2012.
 Daniel J. Bernstein and Tien-Ren Chen and Chen-Mou Cheng and Tanja Lange and Bo-Yin Yang, ECM on Graphics Cards, EUROCRYPT, 2009, 483-501
 Paul Zimmermann and Bruce Dodson, 20
 P.J. Cameron, The random graph revisited, http://www.math.uni-bielefeld.de/rehmann/ECM/cdrom/3ecm/pdfs/pant3/camer.pdf
 G. Cherlin and P. Komjáth, There is no universal countable pentagon-free graph, J. Graph Theory 18 (1994) 337-341. doi:10.1002/jgt.3190180405
 G. Cherlin, S. Shelah and N. Shi, Universal graphs with forbidden subgraphs and algebraic closure, Adv. Appl. Math. 22 (1999) 454-491. doi:10.1006/aama.1998.0641
 G. Cherlin and N. Shi, Graphs omitting a finite set of cycles, J. Graph Theory 21
 A. Dujella, M. Jukić Bokun, On the rank of elliptic curves over Q ( i ) with torsion group Z4 ⊕ Z4, Proc. Japan Acad. Ser. A Math. Sci. 86 (2010), 93-96.
 A. Dujella, F. Najman, Elliptic curves with large torsion and positive rank over number fields of small degree and ECM factorization , Period. Math. Hungar. 65 (2012), 193-203.
 N. Elkies, j = 0, rank 15; also 3-rank 6 and 7 in real and imaginary quadratic fields , Number Theory Listserv posting, December 30, 2009, http://listserv.nodak.edu/cgi-bin/wa.exe?A2= ind0912&L
Meng, X.L. and Rubin, D.B. (1993). Maximum Likelihood Estimation via the ECM Algorithm: a General Framework. Biometrika, 80, 267-278.
Norberg, A., Adolfsson, C., Arvidson G., Gidlund, P., and Nordberg, L., (2010). A General Methodology for Selective Data Editing. Stockholm: Statistics Sweden. Available at: http://gauss.stat.su.se/master/statdatabaser/HT10/Literature/SwedishEditingMethods. pdf (accessed October 9, 2013).
Yuliya Gaidamaka, Alexander Pechinkin, Rostislav Razumchik, Konstantin Samouylov and Eduard Sopin
Abaev, P.O., Gaidamaka, Y.V., Pechinkin, A.V., Razumchik, R.V. and Shorgin, S.Y. (2012b). Simulation of overload control in SIP server networks, Proceedings of the 26th European Conference on Modelling and Simulation, ECMS 2012, Koblenz, Germany, pp. 533-539.
Abaev, P., Gaidamaka, Y., Samouylov, K., Pechinkin, A., Razumchik, R. and Shorgin, S. (2014). Hysteretic control technique for overload problem solution in network of SIP servers, Computing and Informatics 33(1): 1-18.
Bekker, R. (2009). Queues with levy input and hysteretic
Alexander Zeifman, Rostislav Razumchik, Yacov Satin, Ksenia Kiseleva, Anna Korotysheva and Victor Korolev
, Queueing Systems 76(2): 205-221.
Zeifman, A., Korotysheva, A., Korolev, V. and Satin, Y. (2016a). Truncation bounds for approximations of inhomogeneous continuous-time Markov chains, Probability Theory and Its Applications 61(3): 563-569, (in Russian).
Zeifman, A., Korotysheva, A., Satin, Y., Shilova, G., Razumchik, R., Korolev, V. and Shorgin, S. (2016b). Uniform in time bounds for “no-wait” probability in queues of Mt/Mt/S type, Proceedings of the 30th European Conference on Modelling and Simulation, ECMS 2016, Regensburg, Germany, pp
Vladimir Podolskiy, Anshul Jindal and Michael Gerndt
Kolodziej, J. (2017). Security supportive energy aware scheduling and scaling for cloud environments, European Conference on Modelling and Simulation, ECMS 2017, Budapest, Hungary, pp. 583–590.
Jindal, A., Podolskiy, V. and Gerndt, M. (2017). Multilayered cloud applications autoscaling performance estimation, 2017 IEEE 7th International Symposium on Cloud and Service Computing (SC2), Kanazawa, Japan , pp. 24–31.
Versluis, L. and Neacsu, A.I. (2017). A trace-based performance study of autoscaling workloads of workflows in datacenters, Technical Report 1711
Kołodziej, J., Xhafa, F. and Kolanko, L. (2009). Hierarchic genetic scheduler of independent jobs in computational grid environment, in J. Otamendi, A. Bargiela, J.L. Montes and L.M. Doncel Pedrera (Eds.), Proceedings of ECMS 2009, Madrid, Spain , IEEE Press, Los Alamitos, CA, pp. 108-115.
Kwok, Y.-K., Hwang, K. and Song, S. (2007). Selfish grids: Game-theoretic modeling and nas/psa benchmark evaluation, IEEE Transactions on Parallel and Distributing Systems 18 (5): 1-16.
Laccetti, G. and Schmidb, G. (2007). A
Peter G.M. van der Heijden, Paul A. Smith, Maarten Cruyff and Bart Bakker
International Working Group for Disease Monitoring and Forecasting. 1995. “Capture-Recapture and Multiple Record Systems Estimation. Part I. History and Theoretical Development.” American Journal of Epidemiology 142: 1047-1058. Doi: http://dx.doi.org/10.1093/oxfordjournals.aje.a117558.
Madigan, D. and J.C. York. 1997. “Bayesian Methods for Estimation of the Size of a Closed Population.” Biometrika 84: 19-31. Doi: http://dx.doi.org/10.1093/biomet/84.1.19.
Meng, X.L. and D.B. Rubin. 1991. “IPF for Contingency Tables with Missing Data via the ECM
The invasive capability is fundamental in determining the malignancy of a solid tumor. In particular, tumor invasion fronts are characterized by different morphologies, which result both from cell-based processes (such as cell elasticity, adhesive properties and motility) and from subcellular molecular dynamics (such as growth factor internalization, ECM protein digestion and MMP secretion). Of particular relevance is the development of tumors with unstable fingered morphologies: they are in fact more aggressive and hard to be treated than smoother ones as, even if their invasive depth is limited, they are difficult to be surgically removed. The phenomenon of malignant fingering has been reproduced with several mathematical approaches. In this respect, we here present a qualitative comparison between the results obtained by an individual cell-based model (an extended version of the cellular Potts model) and by a measure-based theoretic method. In particular, we show that in both cases a fundamental role in finger extension is played by intercellular adhesive forces and taxis-like migration.