Note: Electronic journals come and go quite frequently so it's very hard to keep a list which is completely up-to-date. We apologize for any inconvenience. Send comments to .

There are many other indices of electronic journals in mathematics. Here are some of the better ones:

Abstracting and Indexing Journals

  • MathSci Net - the on-line version of Mathematical Reviews.
  • Zentralblatt MATH - the on-line version of Zentralblatt für Mathematik. We do not have a subscription, so you are limited to searches for only 3 items at a time.

Electronic Mathematics and Statistics Journals

E-Library

Most of the above resources are only available from machines in the mathematics department. In most cases, you can access them remotely via researchport, or else you can go directly to:

Free Electronic Journals

Home Pages of Conventional Mathematics and Statistics Journals

This list includes the home pages of many conventional print journals, usually indexed by publisher. In most cases, you can access tables of contents and submission instructions for authors. In some cases, abstracts or even full text are also available.

Mathematics Preprint Servers

These are extremely useful, but you are cautioned that most preprint servers will accept contributions from anyone, and are not refereed.

Subject-Specific Resources in Mathematics

General Science Journals

General Reference Services

Other Library Services

Archives: 2011 | 2012 | 2013 | 2014 | 2015 | 2016 | 2017

  • Approximation Algorithms: Some ancient, some new - the good, the bad and the ugly

    Speaker: Samir Khuller (University of Maryland Computer Science ) - https://www.cs.umd.edu/users/samir/

    When: Wed, September 20, 2017 - 3:15pm
    Where: Kirwan Hall 3206

    View Abstract

    Abstract: NP-complete problems abound in every aspect of our daily lives. One approach is to simply deploy heuristics, but for many of these we do not have any idea as to when the heuristic is effective and when it is not. Approximation algorithms have played a major role in the last three decades in developing a foundation for a better understanding of optimization techniques - greedy algorithms, algorithms based on LinearProgramming (LP) relaxations have paved the way for the design of (in some cases) optimal heuristics. Are these the best ones to use in “typical” instances? Maybe, maybe not.


    In this talk we will focus on two specific areas - one is in the use of greedy algorithms for a basic graph problem called connected dominating set, and the other is in the development of LP based algorithms for a basic scheduling problem in the context of data center scheduling.
  • Faculty Meeting with CMNS Interim Dean, Jerry Wilkinson

    Speaker: (CMNS Dean's Office) -

    When: Wed, September 27, 2017 - 3:15pm
    Where: Kirwan Hall 3206