Mathematical Foundations of Computing
MFC's goal is to attract high quality, original contributions in the general area of Mathematics of Computing. It welcomes cover the algorithmic and computational papers that address problems motivated by all practical applications such as networking, privacy, big data, data mining bioinformatics, etc.
A prime objective of MFC is to provide a forum for applied research in these areas. Significant practical and theoretical problems in these areas should be addressed to advance theory and methods of Mathematics of Computing. This will lead to the discovery of new theoretical approaches and clever solutions for practical problems in Computing.
Aim and Scope
The following list of keywords, though incomplete, may help to define the scope more precisely.
Foundations: Analysis of algorithms, automata, computational complexity, theoretical computer science, geometry in computer science, discrete algorithms, secure computing, privacy-aware computing, distributed computing and networking, computational probability, statistical computation and simulation, computational intelligence, computational social network, computational biology, coding theory, graph theory, computational learning theory, probability and statistics in computer science, combinatorial optimization in computer science, logic and semantics in computer science, numerical analysis in computer science, numerical algebra in computer science and symbolic computation / computer algebra
Reliable Communication: Algebraic Coding Theory: Codes over Finite Fields and Rings, Lattices. Coding and Geometry: Codes from Designs, Algebraic Geometry Codes. Codes from Graphs: LDPC Codes. Decoding Algorithms: Belief Propagation, List Decoding. Pseudo-Random Sequences: Periodic and Aperiodic Correlation Properties, Merit Factor Problem.
Secure Communication: Public Key Cryptography: Elliptic Curve Cryptography, Digital Signatures. Private Key Cryptography: APN Functions, Boolean Functions. Cryptanalysis: Linear and Differential Cryptanalysis, Algebraic Attacks. Provable Security: Quantum Cryptography. Cryptographic Algorithms and Complexity: Factoring, Discrete Logarithm.
Each paper will be assigned by Professor Zhipeng Cai (EiC) to an Associate Editor (AE). The EiC, in consultation with the AE, will reject the paper if he does not think that the paper should enter into the formal reviewing process. Otherwise, the AE will send it out for external review by requesting at least two independent reports within eight weeks of submission. Once the AE has collected two (or more) reports, the AE will provide the EiC with a final assessment of paper quality and recommendation (accept, minor revision, major revision, reject). MFC will then communicate the final decision to authors. In the case of a major revision, papers will undergo a second round of review with similar procedure. When the paper is finally accepted, the EiC will send the formal acceptance letter to the corresponding author.
Add your name and e-mail address to receive news of forthcoming issues of this journal:
[Back to Top]