Complete Lattices
Complete Lattices is a mathematical structure in order theory consisting of a partially ordered set in which every subset has both a supremum (least upper bound) and an infimum (greatest lower bound).
541
Publications
17.8K
Citations
718
Authors
392
Institutions
Publications per year
2017–2026
42
Parents
541
On Lovász’ lattice reduction and the nearest lattice point problem
László Babai · COMBINATORICA · 1986 · 930 citations
R. P. Dilworth · Bulletin of the American Mathematical Society · 1950 · 320 citations · Full text
Radim Bělohlávek · Mathematical logic quarterly · 1999 · 312 citations
Why mathematical morphology needs complete lattices
Christian Ronse · Signal Processing · 1990 · 218 citations
1–5 of 541
718
9
h-index
8
h-index
8
h-index
7
h-index
6
h-index
1–5 of 718
392

University of Manitoba
Winnipeg, Canada
10 h-index
19 publications
293 citations
Sichuan Normal University
Chengdu, China
10 h-index
14 publications
284 citations

Leibniz University Hannover
Hanover, Germany
7 h-index
8 publications
126 citations
Leshan Normal University
Leshan, China
6 h-index
11 publications
171 citations
Wuhan University
Wuhan, China
5 h-index
9 publications
214 citations
Mathematical Institute of the Slovak Academy of Sciences
Bratislava, Slovakia
5 h-index
5 publications
66 citations
University of Vienna
Vienna, Austria
5 h-index
6 publications
133 citations

Centre National de la Recherche Scientifique
Paris, France
5 h-index
6 publications
166 citations
1–8 of 392
23 publications · 936 citations
21
h-index
27 publications · 881 citations
18
h-index
TRAN · 28 publications · 688 citations
17
h-index
PROC · 21 publications · 668 citations
13
h-index
17 publications · 515 citations
12
h-index
1–5