Department of Computer Science

290(top 1%)

papers

9.7K(top 1%)

citations

47(top 1%)

h-index

93(top 1%)

g-index

405

all documents

12.4K

doc citations

990

citing journals

Top Articles

#	Title	Journal	Year	Citations
1	Notions of computation and monads	Information and Computation	1991	1,200
2	Testing equivalences for processes	Theoretical Computer Science	1984	920
3	Calculi for synchrony and asynchrony	Theoretical Computer Science	1983	706
4	Approximate counting, uniform generation and rapidly mixing Markov chains	Information and Computation	1989	499
5	Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow	Combinatorics Probability and Computing	1992	320
6	Improved approximation algorithms for MAXk-CUT and MAX BISECTION	Algorithmica	1997	303
7	Universality considerations in VLSI circuits	IEEE Transactions on Computers	1981	289
8	A very simple algorithm for estimating the number of k-colorings of a low-degree graph	Random Structures and Algorithms	1995	219
9	A fast parallel algorithm for routing in permutation networks	IEEE Transactions on Computers	1981	202
10	Large Cliques Elude the Metropolis Process	Random Structures and Algorithms	1992	194
11	Premonoidal categories and notions of computation	Mathematical Structures in Computer Science	1997	157
12	Modal logics for mobile processes	Theoretical Computer Science	1993	153
13	Boundary conditions for lightness computation in Mondrian World	Computer Vision, Graphics, and Image Processing	1985	146
14	Towards a mathematical operational semantics		0	145
15	An ideal model for recursive polymorphic types	Information and Control	1986	144
16	Type inference for polymorphic references	Information and Computation	1990	140
17	Power domains and predicate transformers: A topological view		1983	133
18	A probabilistic powerdomain of evaluations		0	128
19	Concurrent Processes and Their Syntax	Journal of the ACM	1979	124
20	Simple type-theoretic foundations for object-oriented programming	Journal of Functional Programming	1994	124
21	Conductance and the rapid mixing property for Markov chains: the approximation of permanent resolved		1988	114
22	Generalised algebraic theories and contextual categories	Annals of Pure and Applied Logic	1986	112
23	On the verification of broadcast protocols		0	108
24	Eliminating cache conflict misses through XOR-based placement functions		1997	104
25	The theory and practice of transforming call-by-need into call-by-value	Lecture Notes in Computer Science	1980	102
26	Two-dimensional monomer-dimer systems are computationally intractable	Journal of Statistical Physics	1987	96
27	The largest cartesian closed category of domains	Theoretical Computer Science	1983	88
28	Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers	Machine Learning	1995	88
29	Abstract types have existential types		1985	84
30	Fast uniform generation of regular graphs	Theoretical Computer Science	1990	82
31	On the existence of free models in abstract algebraic institutions	Theoretical Computer Science	1985	80
32	Some fundamental algebraic tools for the semantics of computation: Part 3. indexed categories	Theoretical Computer Science	1991	80
33	Surface descriptions from stereo and shading	Image and Vision Computing	1985	79
34	Essential concepts of algebraic specification and program development	Formal Aspects of Computing	1997	78
35	Flowgraphs and Flow Algebras	Journal of the ACM	1979	77
36	Persistent object management system	Software - Practice and Experience	1984	75
37	The Metropolis algorithm for graph bisection	Discrete Applied Mathematics	1998	75
38	An ideal model for recursive polymorphic types		1984	74
39	Dynamic typing in polymorphic languages	Journal of Functional Programming	1995	73
40	Modal and temporal logics for processes	Lecture Notes in Computer Science	1996	73
41	Toward formal development of programs from algebraic specifications: Parameterisation revisited	Acta Informatica	1992	64
42	On counting problems and the polynomial-time hierarchy	Theoretical Computer Science	1980	63
43	Functions as processes		1990	63
44	A compact representation for permutation groups	Journal of Algorithms	1986	61
45	A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes	Mathematical Structures in Computer Science	1996	61
46	Nuclear and trace ideals in tensored ∗-categories	Journal of Pure and Applied Algebra	1999	60
47	Unique decomposition of processes	Theoretical Computer Science	1993	59
48	The swappable logic unit: a paradigm for virtual hardware		0	59
49	ECC, an extended calculus of constructions		0	58
50	Kripke-style models for typed lambda calculus	Annals of Pure and Applied Logic	1991	58

Profile

Scientometrics

Citing Bodies

Department of Computer Science

Top Articles