• Stars
    star
    2,708
  • Rank 16,851 (Top 0.4 %)
  • Language
    Python
  • License
    Other
  • Created over 8 years ago
  • Updated 17 days ago

Reviews

There are no reviews yet. Be the first to send feedback to the community and the maintainers!

Repository Details

A web app for ranking computer science departments according to their research output in selective venues, and for finding active faculty across a wide range of areas.

Computer Science Rankings

This ranking of top computer science schools is designed to identify institutions and faculty actively engaged in research across a number of areas of computer science. Unlike US News and World Report's approach, which is exclusively based on surveys, this ranking is entirely metrics-based. It measures the number of publications by faculty that have appeared at the most selective conferences in each area of computer science.

This approach is intended to be difficult to game, since publishing in such conferences is generally difficult: contrast this with other approaches like citation-based metrics, which have been repeatedly shown to be easy to manipulate. That said, incorporating citations in some form is a long-term goal.

See the FAQ for more details.


This repository contains all code and data used to build the computer science rankings website, hosted here: https://csrankings.org

Adding or modifying affiliations

NOTE: Updates are now processed on a quarterly basis. You may submit pull requests at any time, but they may not be processed until the next quarter (after three months have elapsed).

You can now edit files directly in GitHub to create pull requests. All data is in the files csrankings-[a-z].csv, with authors listed in alphabetical order by their first name, organized by the initial letter. Please read CONTRIBUTING.md for full details on how to contribute.

Trying it out at home

Because of GitHub size limits, to run this site, you will want to download the DBLP data by running make update-dblp (note that this will consume upwards of 19GiB of memory). To then rebuild the databases, just run make. You can test it by running a local web server (e.g., python3 -m http.server) and then connecting to http://0.0.0.0:8000.

You will also need to install libxml2-utils (or whatever package includes xmllint on your distro), npm, typescript, closure-compiler, python-lxml, pypy, and basex via a command line like:

apt-get install libxml2-utils npm python-lxml basex; npm install -g typescript google-closure-compiler

Quick contribution via a shallow clone

A full clone of the CSrankings repository is almost 2GB, and the csrankings.csv file is too large to edit via the GitHub web site. To contribute a change without creating a full local clone of the CSrankings repo, you can do a shallow clone. To do so, follow these steps:

  1. Fork the CSrankings repo. If you have an existing fork, but it is not up to date with the main repository, this technique may not work. If necessary, delete and re-create your fork to get it up to date. (Do not delete your existing fork if it has unmerged changes you want to preserve!)
  2. Do a shallow clone of your fork: git clone --depth 1 https://github.com/yourusername/CSrankings. This will only download the most recent commit, not the full git history.
  3. Make your changes on a branch, push them to your clone, and create a pull request on GitHub as usual.

If you want to make another contribution and some time has passed, perform steps 1-3 again, creating a fresh fork and shallow clone.

Acknowledgements and other rankings

This site was developed primarily by and is maintained by Emery Berger. It incorporates extensive feedback from too many folks to mention here, including many contributors who have helped to add and maintain faculty affiliations, home pages, and so on.

This site was initially based on code and data collected by Swarat Chaudhuri (UT-Austin), though it has evolved considerably since its inception. The original faculty affiliation dataset was constructed by Papoutsaki et al.; since then, it has been extensively cleaned and updated by numerous contributors. A previous ranking also used DBLP and Brown's dataset for ranking theoretical computer science.

This site uses information from DBLP.org which is made available under the ODC Attribution License.

License

CSRankings is covered by the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

More Repositories

1

Hoard

The Hoard Memory Allocator: A Fast, Scalable, and Memory-efficient Malloc for Linux, Windows, and Mac.
C++
1,099
star
2

Malloc-Implementations

A collection of memory allocators
C
435
star
3

DieHard

DieHard: An error-resistant memory allocator for Windows, Linux, and Mac OS X
C
398
star
4

Heap-Layers

Heap Layers: An Extensible Memory Allocation Infrastructure
C++
383
star
5

csconferences

Major CS conference publication stats (including accepted and submitted) by year.
Python
109
star
6

dthreads

dthreads: Efficient Deterministic Multithreading
C
49
star
7

cheap

Cheap: customized heaps for improved application performance.
C++
25
star
8

COMPSCI-630

Public notes, etc. for CMPSCI 630, the UMass CS graduate systems course.
TeX
21
star
9

web-programming

web programming course (COMPSCI 326, UMass Amherst)
JavaScript
14
star
10

COMPSCI590S

Systems for Data Science repo
TeX
12
star
11

Grace

Grace - a replacement for pthreads that enforces sequential semantics (stronger than determinism).
C
10
star
12

PLDI-2016

Documents related to PLDI 2016.
TeX
9
star
13

hangover

Basic fuzzer for malloc implementations
C++
9
star
14

PC-Resources

Resources for conference program chairs, especially in systems/PL areas of computer science.
Python
8
star
15

ApproximateCounter

A C++ implementation of a scalable approximate counter.
C++
4
star
16

COMPSCI-630-S18-Assignment1

Rust
2
star
17

opendetex

Automatically exported from code.google.com/p/opendetex
Lex
2
star
18

publications

Emery Berger publications
TeX
2
star
19

emeryberger

2
star
20

eon

The Eon programming language
C
1
star
21

bertsort

C++
1
star
22

ASPLOS-2021

Python
1
star
23

Jack

You don't know Jack.
C++
1
star
24

wordle-solver

"Finds" the wordle solution of the day
HTML
1
star